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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
