A fast incremental algorithm for building lattices

Journal of Experimental and Theoretical Artificial Intelligence

Volumn 14, Issue 2-3, 2002, Pages 217-227

  Nourine, Lhouari ^a   Raynaud, Olivier ^a  

^a UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

Data structure; Family of sets; Galois lattice; Incremental algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; SET THEORY;

INCREMENTAL ALGORITHMS;

DATA STRUCTURES;

EID: 0036555970     PISSN: 0952813X     EISSN: None     Source Type: Journal    
DOI: 10.1080/09528130210164152     Document Type: Article

References (14)

1. Bordat, J.P., 1986, Calcul pratique du treillis de Galois d'une correspondance. Math. Sci. Hum, 96:31-47.
2. Carpineto, C., and Romano, G., 1996. A lattice conceptual Clustering system and its application browsing retrieval. Machine learning, 24:95-122.
3. Chein, M., 1969, Algorithme de recherche de sous-matrice premire d'une matrice. Bull. Math. R.S. Roumanie, 13, 2nd edn, 21-25.
4. Davey, B.A., and Priestley, H.A., 1991, Introduction to lattices and order, 2nd edn (Cambridge: Cambridge University Press).
5. Ganter, B., 1984, Two basic algorithms in concept analysis. Technical report, No 1 831, Technische Hoschule Darmstadt.
6. Ganter, B., and Kuznetsov, S.O., 1998, Stepwise consruction of the Dedekind-Macneille completion, in Proc. Conceptual Structures.' Theory, Tools and Application, LNCS 1453 (Springer), pp. 295-302.
7. Kuznetsov, S.O., and Ob'edkov, 2001, Comparing performance of algorithms for generating concept lattices. In Proc. of the concept Lattices-based Theory, Methodes and Tools for KDD (CLKDD'01) E.M. Nguifo, M. Liquire and V. Duquenne (eds), Stanford July.
8. Godin, R., Missaoui, R., and Alaoui, H., 1995, Incremental concept formation algorithms based on Galois (concept) lattices. Computational Intelligence, 11 (2): 246-267.
9. Habib, M., Medina, R., Nourine, L., and Steiner, G., 2001, Efficient algorithms on distributive lattices. Discrete Applied Mathematics, 110 (2-3): 169-187.
10. Habib, M., and Nourine, L., 1996, Tree structure for distributive lattices and its applications. Theor. Comp. Sci., 165 (2): 391-405.
11. Jard, C., Jourdan, C.-V., and Rampon, J.-X., 1994, Computing on-line in the lattice of maximal antichains of posers. Order, 11 (3): 197-210.
12. Norris, E.M., 1974, An algorithm for computing the maximal rectangles of a binary relation. Journal of ACM, 21:356-366.
13. Nourine, L., and Raynaud, O., 1997, A fast algorithm for building lattices. Information Processing Letters, 71: 199-204.
14. Ganter, B., and Wille, R., 1999, Formal Concept Analysis-Mathematical Foundations (Berlin: Springer-Verlag).