Partitioning large data to scale up lattice-based algorithm

Proceedings of the International Conference on Tools with Artificial Intelligence

Volumn , Issue , 2003, Pages 537-541

  Fu, Huaiguo ^a   Nguifo, Engelbert Mephu ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; DATA REDUCTION; HIERARCHICAL SYSTEMS; INFORMATION RETRIEVAL; MATHEMATICAL OPERATORS; THEOREM PROVING;

LATTICE BASED ALGORITHMS; RULES MINING;

FUZZY SETS;

EID: 0345529092     PISSN: 10636730     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. G. Birkhoff. Lattice Theory. American Mathematical Society, Providence, RI, 3rd edition, 1967.
2. J. Bordat. Calcul pratique du treillis de galois d'une correspondance. Mathématiques, Informatiques et Sciences Humaines, 24(94):31-47, 1986.
3. M. Chein. Algorithme de recherche des sous matrices premières d'une matrice. Bull.Math.R.S., 13, 1969.
4. H. Fu and E. Mephu Nguifo. How well go lattice algorithms on currently used machine learning testbeds? ICFCA 2003, First International Conference on Formal Concept Analysis, 2003.
5. B. Ganter. Two basic algorithms in concept analysis. Technical report, Darmstadt University, 1984.
6. B. Ganter and R. Wille. Formal Concept Analysis. Mathematical Foundations. Springer, 1999.
7. R. Godin, G. Mineau, and et al. Méthodes de classification conceptuelle basés sur les treillis de galois et application. Revue d'intelligence artificielle, pages 105-137, 1995.
8. E. Mephu Nguifo, M. Liquiere, and V. Duquenne. Journal of Experimental and Theoretical Artificial Intelligence (JETAI) Special Issue on Concept Lattice-based theory, methods and tools for Knowledge Discovery in Databases. Taylor and Francis, 2002.
9. E. Norris. An algorithm for computing the maximal rectangles in a binary relation. Revue Roumaine Math. Pures et Appl., XXIII(2):243-250, 1978.
10. L. Nourine and O. Raynaud. A fast algorithm for building lattices. Information Processing Letters, 71:199-204, 1999.
11. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemsets lattices. Journal of Information Systems, 24(1):25-46, 1999.
12. P. Valtchev and R. Missaoui. Building galois (concept) lattices from parts: Generalizing the incremental approach. In In Proceedings of the ICCS 2001, Harry Delugach, Gerd Stumme (eds.), LNCS 2120, pages 290-303. Springer Verlag, 2001.