Generalizing itemset mining in a constraint programming setting

Inductive Databases and Constraint-Based Data Mining

Volumn , Issue , 2010, Pages 107-126

  Besson, Jérémy ^a   Boulicaut, Jean François ^b   Guns, Tias ^c   Nijssen, Siegfried ^c  

^a VILNIUS UNIVERSITY   (Lithuania)

^b UNIVERSITÉ DE LYON   (France)

^c UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79955766063     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-4419-7738-0_5     Document Type: Chapter

References (30)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI Press, 1996.
2. S. Basu, I. Davidson, and K. Wagstaff. Constrained Clustering: Advances in Algorithms, Theory and Applications. Chapman & Hall/CRC Press, Data Mining and Knowledge Discovery Series, 2008.
3. J Besson, C. Robardet, and J-F. Boulicaut. Mining a new fault-tolerant pattern type as an alternative to formal concept discovery. In ICCS'06: Proc. Int. Conf. on Conceptual Structures, volume 4068 of LNCS. Springer, 2006.
4. S. Bistarelli and F. Bonchi. Interestingness is not a dichotomy: Introducing softness in constrained pattern mining. In PKDD'05: Proc. 9th European Conf. on Principles and Practice of Knowledge Discovery in Databases, volume 3721 of LNCS, pages 22-33. Springer, 2005.
5. Francesco Bonchi, Fosca Giannotti, Claudio Lucchese, Salvatore Orlando, Raffaele Perego, and Roberto Trasarti. A constraint-based querying system for exploratory pattern discovery. Information Systems, 34(1):3-27, 2009.
6. Francesco Bonchi, Fosca Giannotti, Alessio Mazzanti, and Dino Pedreschi. Adaptive constraint pushing in frequent pattern mining. In PKDD'03: Proc. 7th European Conf. on Principles and Practice of Knowledge Discovery in Databases, volume 2838 of LNCS, pages 47-58. Springer, 2003.
7. Francesco Bonchi, Fosca Giannotti, Alessio Mazzanti, and Dino Pedreschi. Examiner: Optimized level-wise frequent pattern mining with monotone constraint. In ICDM 2003: Proc. 3rd International Conf. on Data Mining, pages 11-18. IEEE Computer Society, 2003.
8. Jean-François Boulicaut, Luc De Raedt, and Heikki Mannila, editors. Constraint-Based Mining and Inductive Databases, volume 3848 of LNCS. Springer, 2005.
9. C. Bucila, J. E. Gehrke, D. Kifer, and W. White. Dualminer: A dual-pruning algorithm for itemsets with constraints. Data Mining and Knowledge Discovery Journal, 7(4):241-272, Oct. 2003.
10. Toon Calders, Christophe Rigotti, and Jean-François Boulicaut. A survey on condensed representations for frequent sets. In Constraint-based Mining and Inductive Databases, volume 3848 of LNCS, pages 64-80. Springer, 2005.
11. L. Cerf, J. Besson, C. Robardet, and J.-F. Boulicaut. Closed patterns meet n-ary relations. ACM Trans. on Knowledge Discovery from Data, 3(1), March 2009.
12. Hong Cheng, Philip S. Yu, and Jiawei Han. Ac-close: Efficiently mining approximate closed itemsets by core pattern recovery. In ICDM, pages 839-844, 2006.
13. Luc De Raedt, Tias Guns, and Siegfried Nijssen. Constraint programming for itemset mining. In KDD'08: Proc. 14th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pages 204-212, 2008.
14. B. Ganter. Two basic algorithms in concept analysis. Technical report, Germany Darmstadt: Technisch Hochschule Darmstadt, Preprint 831, 1984.
15. Bernhard Ganter, Gerd Stumme, and Rudolph Wille. Formal Concept Analysis, Foundations and Applications, volume 3626 of LNCS. Springer, 2005.
16. B. Goethals and M. J. Zaki, editors. Frequent Itemset Mining Implementations, volume 90. CEUR-WS.org, Melbourne, Florida, USA, December 2003.
17. Jiawei Han, Jian Pei, Yiwen Yin, and Runying Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8(1):53-87, 2004.
18. David J. Hand, Niall M. Adams, and Richard J. Bolton, editors. Pattern Detection and Discovery, ESF Exploratory Workshop Proceedings, volume 2447 of LNCS. Springer, 2002.
19. Daniel Kifer, Johannes E. Gehrke, Cristian Bucila, and Walker M. White. How to quickly find a witness. In Constraint-Based Mining and Inductive Databases, pages 216-242, 2004.
20. Jinze Liu, Susan Paulsen, Xing Sun, Wei Wang, Andrew B. Nobel, and Jan Prins. Mining approximate frequent itemsets in the presence of noise: Algorithm and analysis. In SDM, 2006.
21. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. In Data Mining and Knowledge Discovery journal, volume 1(3), pages 241-258. Kluwer Academic Publishers, 1997.
22. Katharina Morik, Jean-François Boulicaut, and Arno Siebes, editors. Local Pattern Detection, International Dagstuhl Seminar Revised Selected Papers, volume 3539 of LNCS. Springer, 2005.
23. Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25-46, 1999.
24. Jian Pei, Anthony K. H. Tung, and Jiawei Han. Fault-tolerant frequent pattern mining: Problems and challenges. In DMKD. Workshop, 2001.
25. A. Soulet and B. Crémilleux. An efficient framework for mining flexible constraints. In PaKDD'05: Pacific-Asia Conf. on Knowledge Discovery and Data Mining, volume 3518 of LNCS, pages 661-671. Springer, 2005.
26. T. Uno, M. Kiyomi, and H. Arimura. Lcm ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets. In FIMI'04, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, volume 126 of CEUR Workshop Proceedings. CEUR-WS.org, 2004.
27. T. Uno, M. Kiyomi, and H. Arimura. LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining. In OSDM'05: Proc. 1st Int. Workshop on Open Source Data Mining, pages 77-86. ACM Press, 2005.
28. C. Yang, U. Fayyad, and P. S. Bradley. Efficient discovery of error-tolerant frequent itemsets in high dimensions. In SIGKDD, pages 194-203, San Francisco, California, USA, August 2001. ACM Press.
29. Mohammed J. Zaki. Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng., 12(3):372-390, 2000.
30. Mengsheng Zhang, Wei Wang, and Jinze Liu. Mining approximate order preserving clusters in the presence of noise. In ICDE, pages 160-168, 2008.