Computing non-redundant bases of if-then rules from data tables with graded attributes.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F06%3A00002577" target="_blank" >RIV/61989592:15310/06:00002577 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Computing non-redundant bases of if-then rules from data tables with graded attributes.
Original language description
We present a method for computation of non-redundant bases of attribute implications from data tables with fuzzy attributes. Attribute implications are formulas describing particular dependencies of attributes in data. A non-redundant basis is a minimalset of attribute implications such that each attribute implication which is true in a given data (semantically) follows from the basis. Our bases are uniquely given by so-called systems of pseudo-intents. Pseudo-intents are particular granules in data tables. We reduce the problem of computing systems of pseudo-intents to the problem of computing maximal independent sets in certain graphs. We present theoretical foundations, the algorithm, and demonstrating examples.
Czech name
Výpočet neredundatních bází IF-THEN pravidel z datových tabulek se stupňovitými atributy.
Czech description
Prezentace výpočetu neredundantních bazí if-then pravidel z datových tabulek se stupňovitými atributy.
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1ET101370417" target="_blank" >1ET101370417: Hierarchical analysis of complex data</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
2006 IEEE International Conference on Granular Computing
ISBN
1-4244-0133-X
ISSN
—
e-ISSN
—
Number of pages
814
Pages from-to
205-210
Publisher name
IEEE Computer Society Press
Place of publication
New York
Event location
—
Event date
—
Type of event by nationality
—
UT code for WoS article
—