Publications

Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, и 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, и P.J. Stuckey (Ред.), 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, и 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]