Publications

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: concept discovery association OntologyHandbook bases analysis kdd myown rule knowledge closed formal rules condensed FCA itemsets 2001 fca representations mining] 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: concept discovery analys association kdd myown frequent rule data knowledge closed formal rules representation condensed itemsets fca 2000 representations mining] 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: algorithm concept discovery algorithms association analysis kdd myown frequent data knowledge closed formal rules condensed itemsets fca 2000 representations mining] 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: concept discovery analys association OntologyHandbook kdd myown frequent rule data knowledge closed formal rules representation condensed FCA itemsets fca 2000 representations mining]