Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Attribute reduction in concept lattice based on discernibility matrix
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
Hi-index | 0.00 |
This paper proposes an interconnection approach, which is based on extended many-valued context and extended formal descriptions. An extended many-valued context Π=(G, M, Q, W, I) consists of sets G, M, Q and W and a quaternary-relation I ⊆G×M×Q×W. An extended formal description is regarded as a mapping from the set of attributes to the power set of the values, assigning to each attribute the set of allowed values under some conditions. The extended formal descriptions are naturally ordered by preciseness, and then a concept lattice is obtained according to the theory of FCA. This concept lattice is the well structure interconnection among concepts. The paper also proposed some important propositions, which are used to decide whether two concepts have semantic interconnections. In the end, the paper describes an interconnection algorithm with the time complexity O(n2).