Abstract
The Galois lattice approach has been shown to provide a rich framework for the study of monothetic formal concepts within the context of an object by attribute correspondence. Yet, the approach is hampered by two problems: First, even for data sets of moderate size the Galois lattice is usually very complex. Second, small modifications of the correspondence under study (e.g., due to error) may lead to considerable modifications of the lattice. This paper presents a procedure to construct an approximate Galois lattice with limited order and length for a given binary correspondence. The procedure, which is based on Boolean matrix theory, makes use of an algorithm for Boolean factor analysis. Goodness-of-recovery results from a simulation study suggest that it allows one to retrieve a true correspondence from error-perturbed data.
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, G. (1940), Lattice Theory, American Mathematical Society, Providence.
De Boeck, P., and Rosenberg, S. (1988), Hierarchical classes: Model and data analysis, Psychometrika, 53, 361–381.
Duquenne, V. (1991a), The core of finite lattices, Discrete Mathematics, 88, 133–147.
Duquenne, V. (1991b), Glad: General Lattice Analysis & Design, A Forten Program for a Glad User, CAMS-EHESS, Paris.
Ganter, B. (1984), Two basic algorithms in concept analysis (Preprint 831), Technische Hochschule, Darmstadt.
Guenoche, A., and Van Mechelen, I. (1992), Galois approach to the induction of concepts, in I. Van Mechelen, J. Hampton, R. Michalski, and P. Theuns (eds.), Categories and concepts: Theoretical views and inductive data analysis, Academic Press, London, 287–308.
Kim, K.H. (1982), Boolean Matrix Theory, Marcel Dekker, New York.
Luxenburger, M. (1991), Implications partielles et dépendances partielles, Mathématiques, Informatique et Sciences Humaines, 113, 35–55.
Mickey, M.R., Mundle, P., and Engelman, L. (1983), Boolean factor analysis, in W.J. Dixon (ed.), BMDP Statistical Software, University of California Press, Berkeley, 538–545, 692.
Stoehr, B., and Wille, R. (1991), Formal Concept Analysis of Data with Tolerances (Preprint 1401), Technische Hochschule, Darmstadt.
Wille, R. (1977), Aspects of finite lattices, in M. Aigner (ed.), Higher Combinatorics, D. Reidel Publishing Company, Dordrecht, 79–100.
Wille, R. (1982), Restructuring lattice theory: An approach based on hierarchies of concepts, in D. Rival (Ed.), Ordered Sets, Reidel, Boston, 445–470.
Wille, R. (1984), Line diagrams of hierarchical concept systems, International Classification, 11, 77–86.
Zaretski, K.A. (1963), The semigroup of binary relations (Russian), Mat. Sbornik, 61, 291–305.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Van Mechelen, I. (1993). Approximate Galois Lattices of Formal Concepts. In: Opitz, O., Lausen, B., Klar, R. (eds) Information and Classification. Studies in Classification, Data Analysis and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-50974-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-50974-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56736-3
Online ISBN: 978-3-642-50974-2
eBook Packages: Springer Book Archive