Abstract
In this paper we propose a “divide and conquer” based generating algorithm for closed sets of a binary relation. We show that some existing algorithms are particular instances of our algorithm. This allows us to compare those algorithms and exhibit that the practical efficiency relies on the number of invalid closed sets generated. This number strongly depends on a choice function and the structure of the lattice. We exhibit a class of lattices for which no invalid closed sets are generated and thus reduce time complexity for such lattices. We made several tests which illustrate the impact of the choice function in practical efficiency.
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
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large database. In: ACM SIGMOD conf. Management of data, pp. 265–290 (1993)
Bertet, K., Medina, R., Nourine, L., Raynaud, O.: Algorithmique combinatoire dans les bases de données massives. In: Actes du workshop ‘Usage des treillis de Galois pour l’intelligence artificielle’ AFIA 2003, Laval (2003)
Birkhoff, G.: Lattice Theory, third edition, vol. XXV. American Mathematical Colloquium Publications, Providence (1967)
Bordat, J.P.: Calcul pratique du treillis de galois d’une correspondance. Journal of Math. Sci. Hum. 96, 31–47 (1986)
Ganter, B.: Two basic algorithms in concept analysis. Technical report, Technische Hoschule Darmstadt (1984)
Ganter, B., Reuter, K.: Finding all closed sets: a general approach. Order 8 (1991)
Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical Foundations. Springer, Heidelberg (1996)
Habib, M., Medina, R., Nourine, L., Steiner, G.: Efficient algorithms on distributive lattices. Discrete Applied Mathematics 110, 169–187 (2001)
Kuznetsov, S., Obiedkov, S.: Comparing performance of algorithms for generating concept lattices. Journal of Experimental and Theoretical Artificial Intelligence (JETAI) 2/3(14), 189–216 (2002)
Lindig, C.: Fast concept analysis. In: Stumme, G. (ed.) Working with Conceptual Structures, Contributions to ICCS 2000 (2000)
Markowsky, G.: Primes, irreducibles and extremal lattices. Order 9, 265–290 (1992)
Nourine, L.: Une structuration algorithmique de la théorie des treillis. Habilitation à diriger des recherches, Université Montpellier II (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gély, A. (2005). A Generic Algorithm for Generating Closed Sets of a Binary Relation. In: Ganter, B., Godin, R. (eds) Formal Concept Analysis. ICFCA 2005. Lecture Notes in Computer Science(), vol 3403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32262-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-32262-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24525-4
Online ISBN: 978-3-540-32262-7
eBook Packages: Computer ScienceComputer Science (R0)