Publications

G. Stumme, R. Taouil, Y. Bastide, und L. Lakhal. Conceptual Clustering with Iceberg Concept Lattices. In R. Klinkenberg, S. Rüping, A. Fick, N. Henze, C. Herzog, R. Molitor, und O. Schröder (Hrsg.), Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01), Universität Dortmund 763, Oktober 2001. [PUMA: 2001 analysis closed clustering concept conceptual discovery fca formal iceberg itemsets kdd knowledge lattices] 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

Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, und L. Lakhal. Pascal: un alogorithme d'extraction des motifs fréquents. Technique et Science Informatiques (TSI), (21)1:65-95, 2002. [PUMA: 2002 analysis association closed concept condensed fca formal iceberg itemsets lattices myown pascal representations rules titanic] URL

G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, und L. Lakhal. Fast Computation of Concept Lattices Using Data Mining Techniques. In M. Bouzeghoub, M. Klusch, W. Nutt, und U. Sattler (Hrsg.), Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases, 2000. [PUMA: 2000 algorithm algorithms analysis closed computation concept condensed fca formal iceberg itemsets lattices myown representations] URL

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

G. Stumme, R. Taouil, Y. Bastide, N. Pasqier, und L. Lakhal. Computing Iceberg Concept Lattices with Titanic. J. Data and KnowledgeEngineering (DKE), (42)2:189-222, 2002. [PUMA: 2002 analysis closed concept fca formal iceberg itemsets lattices myown titanic] 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

G. Stumme, R. Taouil, Y. Bastide, und L. Lakhal. Conceptual Clustering with Iceberg Concept Lattices. In R. Klinkenberg, S. Rüping, A. Fick, N. Henze, C. Herzog, R. Molitor, und O. Schröder (Hrsg.), Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01), Universität Dortmund 763, Oktober 2001. [PUMA: 2001 analysis closed clustering concept conceptual discovery fca formal iceberg itemsets kdd knowledge lattices myown] 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

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