Fuzzy attribute implications: computing non-redundant bases using maximal independent sets

Authors:
Radim Bělohlávek;Vilém Vychodil
Affiliations:
Department of Computer Science, Palacký University, Olomouc, Olomouc, Czech Republic;Department of Computer Science, Palacký University, Olomouc, Olomouc, Czech Republic
Venue:
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Year:
2005

Citing 4
Cited 2

Fuzzy sets and fuzzy logic: theory and applications

Fuzzy sets and fuzzy logic: theory and applications
Fuzzy logic: mathematical tools for approximate reasoning

Fuzzy logic: mathematical tools for approximate reasoning
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Fuzzy Relational Systems: Foundations and Principles

Fuzzy Relational Systems: Foundations and Principles

Graded LinClosure and its role in relational data analysis

CLA'06 Proceedings of the 4th international conference on Concept lattices and their applications
Attribute implications in a fuzzy setting

ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note describes 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 minimal set 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. We reduce the problem of computing systems of pseudo-intents to the problem of computing maximal independent sets in certain graphs. We outline theoretical foundations, the algorithm, and present demonstrating examples.