Constraint programming for itemset mining

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2008, Pages 204-212

  De Raedt, Luc ^a   Guns, Tias ^a   Nijssen, Siegfried ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Constraint programming; Itemset mining

Indexed keywords

COMPLEX BENCHMARKS; CONSTRAINT PROGRAMMING; CONSTRAINT PROGRAMMING SYSTEMS; CONSTRAINT-BASED MININGS; ITEMSET MINING; PATTERN MININGS;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; INFORMATION MANAGEMENT;

MINING;

EID: 65449187983     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401919     Document Type: Conference Paper

References (16)

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. K. R. Apt and M. Wallace. Constraint Logic Programming using Eclipse. Cambridge University Press, New York, NY, USA, 2007.
3. F. Bonchi and C. Lucchese. On closed constrained frequent pattern mining. In ICDM, pages 35-42. IEEE Computer Society, 2004.
4. F. Bonchi and C. Lucchese. Extending the state-of-the-art of constraint-based pattern discovery. Data Knowl. Eng., 60(2):377-399, 2007.
5. C. Bucila, J. Gehrke, D. Kifer, and W. M. White. Dualminer: A dual-pruning algorithm for itemsets with constraints. Data Min. Knowl. Discov., 7(3):241-272, 2003.
6. D. Burdick, M. Calimlim, J. Flannick, J. Gehrke, and T. Yiu. Mafia: A maximal frequent itemset algorithm. IEEE Trans. Knowl. Data Eng., 17(11):1490-1504, 2005.
7. J. Cheng, Y. Ke, and W. Ng. δ-tolerance closed frequent itemsets. In ICDM '06: Proceedings of the Sixth International Conference on Data Mining, pages 139-148, 2006.
8. G. Dong and J. Li. Efficient mining of emerging patterns: Discovering trends and differences. In KDD, pages 43-52, 1999.
9. E. Frank and I. H. Witten. Using a permutation test for attribute selection in decision trees. In Proc. 15th International Conf. on Machine Learning, pages 152-160, 1998.
10. B. Goethals and M. J. Zaki. Advances in frequent itemset mining implementations: report on FIMI'03. In SIGKDD Explorations Newsletter, volume 6, pages 109-117, 2004.
11. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proceedings of the A CM SIGMOD International Conference on Management of Data, pages 1-12, 2000.
12. J. Pei, J. Han, and L. V. S. Lakshmanan. Mining frequent item sets with convertible constraints. In Proceedings of the IEEE International Conference on Data Engineering (ICDE), pages 433-442, 2001.
13. F. Rossi, P. van Beek, and T. Walsh. Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., 2006.
14. C. Schulte and P. J. Stuckey. Efficient constraint propagation engines. Transactions on Programming Languages and Systems, 2008. To appear.
15. T. Uno, M. Kiyomi, and H. Arimura. Lcm ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining. In OSDM '05: Proceedings of the 1st international workshop on open source data mining, pages 77-86, 2005.
16. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In KDD, pages 283-286, 1997.