Correlated itemset mining in ROC space: A constraint programming approach

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

Volumn , Issue , 2009, Pages 647-655

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

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Constraint programming; Itemset mining; ROC Analysis

Indexed keywords

ALTERNATIVE APPROACH; CONSTRAINT PROGRAMMING; CONVEX HULL; CORRELATION MEASURES; FREQUENCY THRESHOLD; INFORMATION GAIN; ITEM SETS; ITEMSET; ITEMSET MINING; MEMORY REQUIREMENTS; ORDERS OF MAGNITUDE; PATTERN MINING; PRUNING ALGORITHMS; ROC ANALYSIS; RUNTIMES;

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

MINING;

EID: 70350660915     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557019.1557092     Document Type: Conference Paper

References (30)

1. S. D. Bay and M. J. Pazzani. Detecting change in categorical data: Mining contrast sets. In KDD, pages 302-306, 1999.
2. R. J. Bayardo Jr. and R. Agrawal. Mining the most interesting rules. In KDD, pages 145-154, 1999.
3. R. J. Bayardo Jr., R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. In ICDE, pages 188-197, 1999.
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. 2 - decision trees for tree structured data. In PKDD, pages 46-58, 2005.
6. B. Bringmann, A. Zimmermann, L. De Raedt, and S. Nijssen. Don't be afraid of simpler patterns. In PKDD, pages 55-66, 2006.
7. 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.
8. H. Cheng, X. Yan, J. Han, and C.-W. Hsu. Discriminative frequent pattern analysis for effective classification. In ICDE, pages 716-725, 2007.
9. H. Cheng, X. Yan, J. Han, and P. S. Yu. Direct discriminative pattern mining for effective classification. In ICDE, pages 169-178, 2008.
10. L. De Raedt, T. Guns, and S. Nijssen. Constraint programming for itemset mining. In KDD, pages 204-212, 2008.
11. M. Deshpande, M. Kuramochi, N. Wale, and G. Karypis. Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans. Knowl. Data Eng., 17(8):1036-1050, 2005.
12. G. Dong and J. Li. Efficient mining of emerging patterns: Discovering trends and differences. In KDD, pages 43-52, 1999.
13. W. Fan, K. Zhang, H. Cheng, J. Gao, X. Yan, J. Han, P. S. Yu, and O. Verscheure. Direct mining of discriminative and essential frequent patterns via model-based search tree. In KDD, pages 230-238, 2008.
14. T. Fawcett. An introduction to ROC analysis. Pattern Recognition Letters, 27(8):861-874, 2006.
15. J. Fürnkranz and P. A. Flach. ROC 'n' rule learning - towards a better understanding of covering algorithms. Machine Learning, 58(1):39-77, 2005.
16. H. Grosskreutz, S. Rüping, and S. Wrobel. Tight optimistic estimates for fast subgroup discovery. In ECML/PKDD (1), pages 440-456, 2008.
17. M. Hirao, H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. A practical algorithm to find the best subsequence patterns. Theor. Comput. Sci., 292(2):465-479, 2003.
18. B. Kavsek, N. Lavrac, and V. Jovanoski. APRIORI-SD: Adapting association rule learning to subgroup discovery. In IDA, pages 230-241, 2003.
19. S. Kramer, L. De Raedt, and C. Helma. Molecular feature mining in HIV data. In KDD, pages 136-143, 2001.
20. Y. Morimoto, T. Fukuda, H. Matsuzawa, T. Tokuyama, and K. Yoda. Algorithms for mining association rules for binary segmentations of huge categorical databases. In VLDB, pages 380-391, 1998.
21. S. Morishita and J. Sese. Traversing itemset lattice with statistical metric pruning. In PODS, pages 226-236, 2000.
22. S. Nijssen and J. N. Kok. Multi-class correlated pattern mining. In KDID, pages 165-187, 2005.
23. R. C. Prati and P. A. Flach. ROCCER: An algorithm for rule learning based on ROC analysis. In IJCAI, pages 823-828, 2005.
24. J. Sese and S. Morishita. Answering the most correlated n association rules efficiently. In PKDD, pages 410-422, 2002.
25. T. Uno, M. Kiyomi, and H. Arimura. Lcm ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets. In FIMI, 2004.
26. S. Wrobel. An algorithm for multi-relational discovery of subgroups. In PKDD, pages 78-87, 1997.
27. X. Yan, H. Cheng, J. Han, and P. S. Yu. Mining significant graph patterns by leap search. In SIGMOD Conference, pages 433-444, 2008.
28. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In KDD, pages 283-286, 1997.
29. J. Zhu and G. Grahne. Reducing the main memory consumptions of FPmax* and FPclose. In FIMI, 2004.
30. A. Zimmermann and B. Bringmann. CTC - correlating tree patterns for classification. In ICDM, pages 833-836, 2005.