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, the concept of attribute reduction of formal concept was proposed with its properties being discussed. The CL–Axiom and some equivalent conditions for an attributes subset to be a reduction of a formal concept are 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. (ed.): Lattice Theory. 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, Dordrecht, Boston (1982)
Wille, R.: Lattices in data analysis: how to draw them with a computer. In: Wille, R., et al. (eds.) 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)
Zhang, W.X., Wei, L., Qi, J.J.: Attribute Reduction in Concept Lattice Based on Discernibility Matrix. In: Proceedings of the Tenth International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, Canada, pp. 157–165 (2005)
Yao, Y.Y.: A Comparative Study of Formal Concept Analysis and Rough Set Theory in Data Analysis. In: Proceedings of 4th International Conference on Rough Sets and Current Trends in Computing, Uppsala, Sweden, pp. 59–68 (2004)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jin, J., Qin, K., Pei, Z. (2006). Reduction-Based Approaches Towards Constructing Galois (Concept) Lattices. In: Wang, GY., Peters, J.F., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2006. Lecture Notes in Computer Science(), vol 4062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795131_16
Download citation
DOI: https://doi.org/10.1007/11795131_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36297-5
Online ISBN: 978-3-540-36299-9
eBook Packages: Computer ScienceComputer Science (R0)