Author:
Boulicaut Jean-Francois,Masson Cyrille
Reference25 articles.
1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307– 328. AAAI Press, 1996.
2. Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal. Mining minimal nonredundant association rules using frequent closed itemsets. In Proc. CL 2000, volume 1861 of LNCS, pages 972–986. Springer-Verlag, 2000.
3. M. Botta, J.-F. Boulicaut, C. Masson, and R. Meo. Query languages supporting descriptive rule mining: a comparative study. In Database Technologies for Data Mining - Discovering Knowledge with Inductive Queries, volume 2682 of LNCS, pages 27–54. Springer-Verlag, 2004.
4. J.-F. Boulicaut. Inductive databases and multiple uses of frequent itemsets: the cInQ approach. In Database Technologies for Data Mining - Discovering Knowledge with Inductive Queries, volume 2682 of LNCS, pages 3–26. Springer-Verlag, 2004.
5. J.-F. Boulicaut and B. Jeudy. Constraint-based Data Mining. In Data Mining and Knowledge Discovery Handbook. Chapter 16.7, this volume, Kluwer, 2005.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献