A partitional view of concept lattice

  • Authors:
  • Jian-Jun Qi;Ling Wei;Zeng-Zhi Li

  • Affiliations:
  • Institute of Computer Architecture and Network, Xi'an Jiaotong University, Xi'an, PR China;Department of Mathematics, Northwest University, Xi'an, PR China;Institute of Computer Architecture and Network, Xi'an Jiaotong University, Xi'an, PR China

  • Venue:
  • RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Formal concept analysis and rough set theory are two different methods for knowledge representation and knowledge discovery, and both have been successfully applied to various fields. The basis of rough set theory is an equivalence relation on a universe of objects, and that of formal concept analysis is an ordered hierarchical structure — concept lattice. This paper discusses the basic connection between formal concept analysis and rough set theory, and also analyzes the relationship between a concept lattice and the power set of a partition. Finally, it is proved that a concept lattice can be transformed into a partition and vice versa, and transformation algorithms and examples are given.