Alpha Galois lattices: An overview

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

Volumn 3403, Issue , 2005, Pages 299-314

  Ventos, Véronique ^a   Soldano, Henry ^b  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITÉ PARIS 13   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE;

ALPHA GALOIS LATTICES; FORMAL CONCEPT ANALYSIS; ICEBERG CONCEPT LATTICES;

FORMAL LOGIC;

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

References (18)

1. M. Barbu and M. Montjardet. Ordre et Classification, Algèbre et Combinatoire 2. Hachette Université, 1970.
2. Garrett Birkhoff. Lattice Theory. American Mathematical Society Colloquium Publications, Rhode Island, 1973.
3. J-G. Ganascia. TDIS: an algebraic formalization. In Int. Joint Conf. on Art. Int., volume 2, pages 1008-1013, 1993.
4. B. Ganter and R. Wille. Formal Concept Analysis: Logical Foundations. Springer Verlag, 1999.
5. Bernhard Ganter and Sergei O. Kuznetsov. Pattern structures and their projections. ICCS-01, LNCS, 2120:129-142, 2001.
6. J.L. Guigues and V. Duquenne. Famille non redondante d'implications informatives résultant d'un tableau de données binaires. Mathématiques et Sciences humaines, 95:5-18, 1986.
7. Joachim Hereth, Gerd Stumme, Rudolf Wille, and Uta Wille. Conceptual knowledge discovery and data analysis. In Ganter, B., Mineau, G. (eds.): Conceptual Structures: Logical, Linguistic and Computational Issues, pages 421-437. LNAI 1867, Springer, Berlin-Heidelberg, New-York, 2000.
8. S. Kuznetsov and S. Obiedkov. Comparing performance of algorithms for generating concept lattices. J. of Experimental and Theoretical Art. Int., 2/3(14):189-216, 2002.
9. M. Liquiere and J. Sallantin. Structural machine learning with Galois lattice and graphs. In ICML98, Morgan Kaufmann, 1998.
10. M. Luxenburger. Implications partielles dans un contexte. Mathématiques, Informatique et Sciences Humaines, 29(113):35-55, 1991.
11. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25-46, 1999.
12. N. Pernelle, M-C. Rousset, H. Soldano, and V. Ventos. Zoom: a nested Galois lattices-based system for conceptual clustering. J. of Experimental and Theoretical Artificial Intelligence, 2/3(14):157-187, 2002.
13. Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, and Lotfi Lakhal. Intelligent structuring and reducing of association rules with formal concept analysis. Lecture Notes in Computer Science, 2174:335-349, 2001.
14. Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, and Lotfi Lakhal. Computing iceberg concept lattices with titanic. Data and Knowledge Engineering, 42(2):189-222, 2002.
15. P. Valtchev, R. Missaoui, and P. Lebrun. A partition-based approach towards building Galois (concept) lattices. Discrete Mathematics, 256(3):801-829, 2002.
16. V. Ventos and H. Soldano. Les treillis de Galois alpha ou De l?influence d?une partition a priori des donneés. Revue d'Intelligence Artificielle, to appear, 2005.
17. K. Waiyamai and L. Lakhal. Knowledge discovery from very large databases using frequent concept lattices. In 11th Eur. Conf. on Machine Learning, ECML'2000, pages 437-445, 2000.
18. M. J. Zaki. Generating non-redundant association rules. Intl. Conf. on Knowledge Discovery and DataMining (KDD 2000), 2000.