On computing the minimal generator family for concept lattices and icebergs

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3403, Issue , 2005, Pages 192-207

  Nehmé, Kamal ^a   Valtchev, Petko ^a   Rouane, Mohamed H ^a   Godin, Robert ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

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

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATABASE SYSTEMS; GRAPH THEORY; PROBLEM SOLVING;

DATA EXPLORATION; DATABASE DESIGN; LATTICE CONSTRUCTION; MINIMAL GENERATORS (MINGEN);

FORMAL LOGIC;

EID: 26844569541     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32262-7_13     Document Type: Conference Paper

References (18)

1. M. Barbut and B. Monjardet. Ordre et Classification: Algèbre et comminatoire. Hachette, 1970.
2. C. Berge. Hypergraphs: Combinatorics of Finite Sets. North Holland, Amsterdam, 1989.
3. B. Ganter. Two basic algorithms in concept analysis, preprint 831, Technische Hochschule, Darmstadt, 1984.
4. B. Ganter and R. Wille. Formal Concept Analysis, Mathematical Foundations. Springer-Verlag, 1999.
5. R. Godin, R. Missaoui, and H. Alaoui. Incremental Concept Formation Algorithms Based on Galois (Concept) Lattices. Computational Intelligence, 11(2):246-267, 1995.
6. J.L. Guigues and V. Duquenne. Familles minimales d'implications informatives résultant d'un tableau de données binaires. Mathématiques et Sciences Humaines, 95:5-18, 1986.
7. D. Maier. The theory of Relational Databases. Computer Science Press, 1983.
8. N. Pasquier. Extraction de bases pour les règles d'association à partir des itemsets fermés fréquents. In Proceedings of the 18th INFORSID'2000, pages 56-77, Lyon, France, 2000.
9. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In Proceedings, ICDT-99, pages 398-416, Jerusalem, Israel, 1999.
10. M. H. Rouane, K. Nehme, P. Valtchev, and R. Godin. On-line maintenance of iceberg concept lattices. In Contributions to the 12th ICCS, page 14 p., Huntsville (AL), 2004. Shaker Verlag.
11. G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, and L. Lakhal. Computing Iceberg Concept Lattices with Titanic. Data and Knowledge Engineering, 42(2):189-222, 2002.
12. P. Valtchev and V. Duquenne. Implication-based methods for the merge of factor concept lattices (32 p.). submitted to Discrete Applied Mathematics.
13. P. Valtchev, D. Grosser, C. Roume, and M. Rouane Hacene. GALICIA: an open platform for lattices. In B. Ganter and A. de Moor, editors, Using Conceptual Structures: Contributions to 11th Intl. Conference on Conceptual Structures (ICCS'03), pages 241-254, Aachen (DE), 2003. Shaker Verlag.
14. P. Valtchev, M. Rouane Hacene, and R. Missaoui. A generic scheme for the design of efficient on-line algorithms for lattices. In A. de Moor, W. Lex, and B. Ganter, editors, Proceedings of the 11th Intl. Conference on Conceptual Structures (ICCS'03), volume 2746 of Lecture Notes in Computer Science, pages 282-295, Berlin (DE), 2003. Springer-Verlag.
15. P. Valtchev and R. Missaoui. Building concept (Galois) lattices from parts: generalizing the incremental methods. In H. Delugach and G. Stumme, editors, Proceedings of the ICCS'01, volume 2120 of Lecture Notes in Computer Science, pages 290-303, 2001.
16. P. Valtchev, R. Missaoui, and R. Godin. Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges. In P. Eklund, editor, Concept Lattices: Proceedings of the 2nd Int. Conf. on Formal Concept Analysis (FCA '04), volume 2961 of Lecture Notes in Computer Science, pages 352-371. Springer-Verlag, 2004.
17. P. Valtchev, R. Missaoui, R. Godin, and M. Meridji. Generating Frequent Itemsets Incrementally: Two Novel Approaches Based On Galois Lattice Theory. Journal of Experimental & Theoretical Artificial Intelligence, 14(2-3):115-142, 2002.
18. R. Wille. Restructuring lattice theory: An approach based on hierarchies of concepts. In I. Rival, editor, Ordered sets, pages 445-470, Dordrecht-Boston, 1982. Reidel.