Construction of concept lattices based on indiscernibility matrices

Authors:
Hongru Li;Ping Wei;Xiaoxue Song
Affiliations:
Department of Mathematics and Information Sciences, Yan’tai University, Yan’tai, Shan’dong, P. R. China;Department of Mathematics and Information Sciences, Yan’tai University, Yan’tai, Shan’dong, P. R. China;Faculty of Science, Institute for Information and System Sciences, Xi’an Jiaotong University, Xi’an, Shaan’xi, P.R. China
Venue:
KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
Year:
2006

Citing 5
Cited 1

Algebraic aspects of attribute dependencies in information systems

Fundamenta Informaticae
Construction of the L-fuzzy concept lattice

Fuzzy Sets and Systems
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Concept Approximation in Concept Lattice

PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
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

Duality in Rough Set Theory Based on the Square of Opposition

Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday

Quantified Score

Hi-index	0.00

Visualization

Abstract

Formal concepts and concept lattices are two central notions of formal concept analysis. This paper investigates the problem of determining formal concepts based on the congruences on semilattices. The properties of congruences corresponding to formal contexts are discussed. The relationship between the closed sets generated by congruences and the elements of indiscernibility matrices is examined. Consequently, a new approach of determining concept lattices is derived.