Abstract
Galois (concept) lattices and formal concept analysis have been proved useful in the resolution of many problems of theoretical and practical interest. Recent studies have put the emphasis on the need for both efficient and flexible algorithms to construct the lattice. In this paper, some equivalent conditions for an attributes subset to be a reduction of a formal concept are presented. Further more, the structure of concept lattice was analyzed and it is proved that each concept is the meet of some single attribute generalized concepts. Based on the above research, reduction-based approaches towards constructing concept lattice was presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Birkhoff, B.: (revised edition): Lattice Theory, vol. 25. American Mathematical Society Colloquium Publ., Providence, RI (1973)
Wille, R.: Restructuring the lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445–470. Reidel, Boston (1982)
Wille, R.: Lattices in data analysis: how to draw them with a computer. In: Algorithms and order, pp. 33–58. Kluwer Acad. Publ., Dordrecht (1989)
Wille, R.: Concepe lattices and conceptual knowledge systems. Comput. Math. Apll. 23(6-9), 493–515 (1992)
Ganter, B. (ed.): Two basic algorithms in concept analysis. Technische Hochschule, Darmstadt (1984)
Ganter, B., Wille, R. (eds.): Formal Concept Analysis. Mathematical Foundations. Springer, Berlin (1999)
Norris, E.M.: An algorithm for computing the maximal rectangles in a binary relation. Rev. Roumaine Math. Pures Appl. 23(2), 243–250 (1978)
Bordat, J.P.: Calcul pratique du treillis de Galois d’une correspondance. Mat. Sci. Hum. 96, 31–47 (1986)
Godin, R., Missaoui, R., Alaoui, H.: Incremental concept formation algorithms based on Galois (concept) lattices. Computational Intelligence 11(2), 246–267 (1995)
Nourine, L., Raynaud, O.: A fast algorithm for building lattices. Inform. Process. Lett. 71, 199–204 (1999)
Valtchev, P., Missaoui, R., Lebrun, P.: A partition-based approach towards constructing Galois (concept) lattices. Discrete Mathematics 256, 801–829 (2002)
Jingyu, J., Keyun, Q., Zheng, P.: Reduction-based approaches towards constructing Galois (concept) lattices. In: Wang, G.-Y., Peters, J.F., Skowron, A., Yao, Y. (eds.) RSKT 2006. LNCS (LNAI), vol. 4062, pp. 107–113. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhong, Y., Qin, K., Wu, Z. (2008). An Approach for Constructing Concept Lattices. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2008. Lecture Notes in Computer Science(), vol 5009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79721-0_63
Download citation
DOI: https://doi.org/10.1007/978-3-540-79721-0_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79720-3
Online ISBN: 978-3-540-79721-0
eBook Packages: Computer ScienceComputer Science (R0)