Publications

G. Stumme. Conceptual Knowledge Discovery with Frequent Concept Lattices. 1999. [PUMA: 1999 analysis association closed concept condensed data discovery fca formal frequent iceberg itemsets kdd knowledge lattices mining myown representations rule rules] URL

Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, und L. Lakhal. Levelwise Search of Frequent Patterns. Actes des 16ièmes Journées Bases de Données Avancées, 307-322, Blois, France, Oktober 2000. [PUMA: 2000 algorithm algorithms analysis association closed concept condensed data discovery fca formal frequent itemsets kdd knowledge mining myown representations rules] URL

Nicolas Pasquier, Rafik Taouil, Yves Bastide, Gerd Stumme, und Lotfi Lakhal. Generating a Condensed Representation for Association Rules. Journal Intelligent Information Systems (JIIS), (24)1:29-60, Kluwer Academic Publishers, 2005. [PUMA: 2005 OntologyHandbook analysis association closed concept condensed data discovery fca formal itegpub itemset kdd knowledge l3s mining myown representations rule rules sets] URL

Lotfi Lakhal, und Gerd Stumme. Efficient Mining of Association Rules Based on Formal Concept Analysis. In Bernhard Ganter, Gerd Stumme, und Rudolf Wille (Hrsg.), Formal Concept Analysis: Foundations and Applications, (3626):180-195, Springer, Heidelberg, 2005. [PUMA: 2005 analysis association book closed concept condensed data discovery fca formal itegpub itemsets kdd knowledge l3s mining myown representations rules] URL

G. Stumme. Efficient Data Mining Based on Formal Concept Analysis. In A. Hameurlain, R. Cicchetti, und R. Traunmüller (Hrsg.), Database and Expert Systems Applications. Proc. DEXA 2002, (2453):534-546, Springer, Heidelberg, 2002. [PUMA: 2002 association closed condensed data discovery fca itemsets kdd knowledge mining myown representations rules] URL

Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, und L. Lakhal. Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets. In J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Laus, C. Palamidessi, L.M. Pereira, Y. Sagiv, und P.J. Stuckey (Hrsg.), Computational Logic --- CL 2000 Proc. CL'00, (1861)Springer, Heidelberg, 2000. [PUMA: 2000 analys association closed concept condensed data discovery fca formal frequent itemsets kdd knowledge mining myown representation representations rule rules] URL

Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, und L. Lakhal. Mining Frequent Patterns with Counting Inference.. SIGKDD Explorations, Special Issue on Scalable Algorithms, (2)2:71-80, 2000. [PUMA: 2000 FCA OntologyHandbook analys association closed concept condensed data discovery fca formal frequent itemsets kdd knowledge mining myown representation representations rule rules]

G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, und L. Lakhal. Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis. In F. Baader, G. Brewker, und T. Eiter (Hrsg.), KI 2001: Advances in Artificial Intelligence. KI 2001, (2174):335-350, Springer, Heidelberg, 2001. [PUMA: 2001 FCA OntologyHandbook analysis association bases closed concept condensed discovery fca formal itemsets kdd knowledge mining myown representations rule rules] URL

Nicolas Pasquier, Yves Bastide, Rafik Taouil, und Lotfi Lakhal. Pruning closed itemset lattices for associations rules.. In Mokrane Bouzeghoub (Hrsg.), Bases de Donn�es Avanc�es, 1998. [PUMA: FCA OntologyHandbook analysis association closed concept fca formal itemset mining rules] URL

Nicolas Pasquier, Yves Bastide, Rafik Taouil, und Lotfi Lakhal. Pruning closed itemset lattices for associations rules.. In Mokrane Bouzeghoub (Hrsg.), Bases de Données Avancées, 1998. [PUMA: analysis association closed concept fca formal itemset mining rules] URL

Jean-Francois Boulicaut, Artur Bykowski, und Christophe Rigotti. Approximation of Frequency Queris by Means of Free-Sets. Principles of Data Mining and Knowledge Discovery, 75-85, 2000. [PUMA: Analysis Concept Formal closed dm fca free itemset itemsets kdd mining sets] URL