A partition-based approach towards constructing Galois (concept) lattices

Discrete Mathematics

Volumn 256, Issue 3, 2002, Pages 801-829

  Valtchev, P ^a,b,c   Missaoui, R ^b   Lebrun, P ^b  

^a INRIA ROCQUENCOURT   (France)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Context apposition; Data fragments; Formal concept analysis; Galois lattice; Lattice products; Lattice constructing algorithms

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; KNOWLEDGE ACQUISITION; PROBLEM SOLVING; SOFTWARE ENGINEERING;

CONTEXT APPOSITION; DATA FRAGMENTS; FORMAL CONCEPT ANALYSIS; GALOIS LATTICE; LATTICE PRODUCTS; LATTICE-CONSTRUCTING ALGORITHMS;

DATA MINING;

EID: 0012190941     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00349-7     Document Type: Article

References (25)

1. M. Barbut, B. Monjardet, Ordre et Classification: Algèbre et combinatoire, Hachette, Paris, 1970.
2. B. Birkhoff, Lattice Theory, Vol. 25, American Mathematical Society Colloquium Publ., Providence, RI, 1973 (revised edition).
3. J.-P. Bordat, Calcul pratique du treillis de Galois d'une correspondance, Mat. Sci. Hum. 96 (1986) 31-47.
4. M. Chein, Algorithme de recherche des sous-matrices premières d'une matrice, Bull. Math. Soc. Sci. R.S. Roumanie 13 (61) (1969) No. 1, 21-25.
5. B.A. Davey, H.A. Priestley, Introduction to Lattices and Order, Cambridge University Press, Cambridge, 1992.
6. B. Ganter, Two basic algorithms in concept analysis, Technische Hochschule, Darmstadt, 1984, preprint 831.
7. B. Ganter, R. Wille, Formal Concept Analysis, Mathematical Foundations, Springer, Berlin, 1999.
8. R. Godin, H. Mili, G.W. Mineau, R. Missaoui, A. Arfi, T.T. Chau, Design of class hierarchies based on concept (Galois) lattices, Theory Appl. Object Systems 4(2) (1998) 117-134.
9. R. Godin, R. Missaoui, H. Alaoui, Incremental concept formation algorithms based on Galois (concept) lattices, Comput. Intelligence 11(2) (1995) 246-267.
10. A. Guénoche, Construction du treillis de Galois d'une relation binaire, Mat. Sci. Hum. 109 (1990) 41-53.
11. G.-V. Jourdan, J.-X. Rampon, C. Jard, Computing on-line the lattice of maximal antichains of posets, Order 11(2) (1994) 197-210.
12. R.E. Kent, Automatic Classification, Intel survey paper, Intel, 1995.
13. S. Kuznetsov, Some counting and decision problems in formal concept analysis, Technische Universität, Dresden, September 1999, Preprint MATH-AL-14-1999.
14. S. Kuznetsov, S. Objedkov, Algorithms for the construction of the set of all concept and their line diagram, Technische Universität, Dresden, June 2000, Preprint MATH-AL-05-2000.
15. G.W. Mineau, R. Godin, Automatic structuring of knowledge bases by conceptual clustering, IEEE Trans. Knowledge Data Eng. 7(5) (1995) 824-828.
16. E.M. Morris, An algorithm for computing the maximal rectangles in a binary relation, Rev. Roumaine Math. Pures Appl. 23(2) (1978) 243-250.
17. L. Nourine, O. Raynaud, A fast algorithm for building lattices, Inform. Process. Lett. 71 (1999) 199-204.
18. N. Pasquier, Y. Bastide, T. Taouil, L. Lakhal, Efficient mining of association rules using closed itemset lattices, Inform. Systems 24(1) (1999) 25-46.
19. G. Snelting, F. Tip, Reengineering class hierarchies using concept analysis, in: Proceedings of ACM SIGPLAN/SIGSOFT Symposium on Foundations of Software Engineering, Orlando, FL, 1998, pp. 99-110.
20. P. Valtchev, An algorithm for minimal insertion in a type lattice, Comput. Intelligence 15(1) (1999) 63-78.
21. R. Wille, Restructuring the lattice theory: an approach based on hierarchies of concepts, in: I. Rival (Ed.), Ordered Sets, Reidel, Dordrecht, Boston, 1982, pp. 445-470.
22. R. Wille, Tensoral decomposition of concept lattices, Order 2 (1985) 81-95.
23. R. Wille, Subdirect product construction of concept lattices, Discrete Math. 63 (1987) 305-313.
24. R. Wille, Lattices in data analysis: how to draw them with a computer, in: I. Rival (Ed.), Algorithms and Order, Kluwer, Dodrecht, Boston, 1989, pp. 33-58.
25. M.J. Zaki, C.-T. Ho, Scalable algorithms for association mining, IEEE Trans. Knowledge Data Eng. 12(2) (2000) 372-390.