Mining optimal decision trees from itemset lattices

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

Volumn , Issue , 2007, Pages 530-539

  Nijssen, Siegfried ^a   Fromont, Elisa ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Constraint based mining; Decision trees; Formal concepts; Frequent itemsets

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DECISION TREES; OPTIMIZATION;

CONSTRAINT-BASED MINING; FORMAL CONCEPTS; FREQUENT ITEMSETS;

DATA MINING;

EID: 36849072609     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281192.1281250     Document Type: Conference Paper

References (32)

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/MIT Press, 1996.
2. P. Auer, R. C. Holte, and W. Maass. Theory and applications of agnostic PAC-learning with small decision trees. In ICML, pages 21-29, 1995.
3. R. J. Bayardo, B. Goethals, and M. J. Zaki, editors. FIMI '04, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Brighton, UK, volume 126 of CEUR Workshop Proceedings. CEUR-WS.org, 2004.
4. G. Blanchard, C. Schäfer, Y. Rozenholc, and K. R. Müller. Optimal dyadic decision trees. Machine Learning, 66(2-3):209-241, 2007.
5. J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets: A condensed representation of boolean data, for the approximation of frequency queries. Data Mining and Knowledge Discovery, 7(1):5-22, 2003.
6. T. G. Dietterich, M. J. Kearns, and Y. Mansour. Applying the waek learning framework to understand and improve C4.5. In ICML, pages 96-104, 1996.
7. E. Fredkin. The memory. Communications of the ACM, 3(9):490-499, 1960.
8. E. Fromont, H. Blockeel, and J. Struyf. Integrating decision tree learning into inductive databases. In Revised selected papers of the workshop on Knowledge Discovery in Inductive Databases (KDID '06). To appear, Springer, 2007.
9. M. R. Garey. Optimal binary identification procedures. SIAM Journal of Applied Mathematics, 23(2):173-186, 1972.
10. M. N. Garofalakis, D. Hyun, R. Rastogi, and K. Shim. Building decision trees with constraints. Data Mining and Knowledge Discovery, 7(2): 187-214, 2003.
11. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In 2000 ACM SIGMOD International Conference on Management of Data, pages 1-12. ACM Press, 2000.
12. L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15-17, 1976.
13. T. Imielinski and H. Mannila. A database perspective on knowledge discovery. Communications of the ACM, 39:58-64, 1996.
14. M. J. Kearns and Y. Mansour. On the boosting ability of top-down decision tree learning algorithms. Journal of Computer and System Sciences, 58(1):109-128, 1999.
15. A. Lew. Optimal conversion of extended-entry decision tables with general cost criteria. Communications of the ACM, 21(4):269-279, 1978.
16. W. S. Meisel and D. Michalopoulos. A partitioning algorithm with application in pattern classification and the optimization of decision tree. IEEE Trans. Comput., C-22:93-103, 1973.
17. T. Mitchell. Machine Learning. McGraw-Hill, New York, 1997.
18. P. M. Murphy and M. J. Pazzani. Exploring the decision forest: an empirical investigation of Occam's razor in decision tree induction. Computational Learning Theory and Natural Learning Systems, volume IV: Making Learning Systems Practical, pages 171-187. MIT Press, 1997.
19. C. Nadeau and Y. Bengio. Inference for the generalization error. Machine Learning, 52(3):239-281, 2003.
20. D. Newman, S. Hettich, C. Blake, and C. Merz. UCI repository of machine learning databases, 1998.
21. S. Nijssen and E. Fromont. Mining optimal decision trees from itemset lattices. Technical report CW476, Dept. Computer Science, Katholieke Universiteit Leuven, March 2007.
22. D. Page and S. Ray. Skewing: An efficient alternative to lookahead for decision tree induction. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI'03), pages 601-612, 2003.
23. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25-46, 1999.
24. H. J. Payne and W. S. Meisel. An algorithm for constructing optimal binary decision trees. IEEE Trans. Computers, 26(9):905-916, 1977.
25. F. Provost and P. Domingos. Tree induction for probability-based ranking. Machine Learning, 52:199-215, 2003.
26. J. R. Quinlan. C4-5: Programs for Machine Learning. Morgan Kaufmann, 1993.
27. J. R. Quinlan and R. M. Cameron-Jones. Oversearching and layered search in empirical learning. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI'95), pages 1019-1024, 1995.
28. H. Schumacher and K. C. Sevcik. The synthetic approach to decision table conversion. Communications of the ACM, 19(6):343-351, 1976.
29. T. Uno, M. Kiyomi, and H. Arimura. LCM ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets. In [3], 2004.
30. I. H. Witten and E. Frank. Data Mining: Practical machine learning tools and techniques. Morgan Kaufmann, San Francisco, 2nd edition edition, 2005.
31. X. Yan, H. Cheng, J. Han, and D. Xin. Summarizing itemset patterns: a profile-based approach. In Proceeding of the conference on Knowledge Discovery and Data Mining (SIGKDD'05), pages 314-323, 2005.
32. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In Proceeding of the conference on Knowledge Discovery and Data Mining (SIGKDD'97), pages 283-286, 1997.