¹School of Computer Science, Qufu Normal University, Yantai Street 80, Rizhao, China, 276826
²Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China
³chool of Architectual Engineering, Rizhao Politechnic, Rizhao, China, 276826

---

Abstract—Formal concept analysis (FCA) is a valid tool for data mining and knowledge discovery, which identifies concept lattices from binary relations. Given a nonempty finite set A of binary attributes, one obtains a maximal binary relation Rmax based on a relation schema S(A). Firstly, we analyze concepts in Rmax and the concept lattice L(Rmax), and there are some important results as follows: for any two concepts in Rmax, the union of their intents is an intent of some concept in Rmax, and further the intent of their supremum is the union of their intents; for any two concepts in Rmax, if one of them is not a sub-concept or super-concept of the other one, then the union of their extents is not an extent of any concept in Rmax; L(Rmax) is a complemented distributive lattice. Secondly, we provide the structural connection between L(R) and L(Rmax): for any relation R based on S(A), there is a supremum-preserving order-embedding map from L(R) to L(Rmax), and conversely, there is an infimum- preserving order-preserving map from L(Rmax) to L(R), which is generally not a surjective homomorphism. Thirdly, we propose two algorithms to extract concepts in R from L(Rmax), which are respectively based on intents and extents of concepts, and prove their soundness. These results have already been used to analyze the data in architectual engineering and medical science.

Index Terms—Concept lattices; relation schemas; maximal binary relations; order-preserving maps.

[PDF]

Cite: Yuxia Lei, Yuefei Sui, Jingying Tian, "The Maximal Relation Based on A Given Relation Schema and Its Concept Lattice," Journal of Software vol. 8, no. 6, pp. 1308-1315, 2013.