Component-based decision trees for classification

Intelligent Data Analysis

Volumn 15, Issue 5, 2011, Pages 671-693

  Delibasic, Boris ^a   Jovanovic, Milos ^a   Vukicevic, Milan ^a   Suknovic, Milija ^a   Obradovic, Zoran ^b  

^a UNIVERSITY OF BELGRADE   (Serbia)

^b TEMPLE UNIVERSITY   (United States)

Author keywords

Classification; data mining; decision tree; induction; open source platform; reusable components

Indexed keywords

ALGORITHM DESIGN; ALGORITHM PERFORMANCE; BENCHMARK DATASETS; BLACK BOXES; COMPONENT BASED; DATA MINING ALGORITHM; DATA SETS; DECISION-TREE ALGORITHM; END USERS; INDUCTION; INDUCTION PROCESS; JOINT INFLUENCE; NEW COMPONENTS; OPEN-SOURCE; REUSABLE COMPONENTS; STATISTICAL SIGNIFICANCE; TESTING ALGORITHM; TREE NODES;

ALGORITHMS; DECISION TREES; DESIGN; OPTIMIZATION; PLANT EXTRACTS; TREES (MATHEMATICS);

DATA MINING;

EID: 80052637880     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/IDA-2011-0489     Document Type: Conference Paper

References (30)

1. C. Alexander, The timeless way of building, Oxford University Press, 1979.
2. E. Alpaydin, Combined 5 ?2 cv F test for comparing supervised classification learning algorithms, Neural Computation 11 (1999), 1885-1892.
3. A. Asuncion and D. J. Newman, UCI Machine Learning Repository, University of California, School of Information and Computer Science. [www. ics. uci. edu/∼mlearn/MLRepository. html], 2007.
4. L. Breiman, J. Friedman. C. J. Stone and R. A. Olshen, Classification and Regression Trees, CRC Press, 1984.
5. J. O. Coplien and N. B. Harrison, Organizational Patterns of Agile Software Development, Prentice Hall PTR, 2005.
6. B. Delibasic, K. Kirchner, J. Ruhland , M. Jovanovic and M. Vukicevic, Reusable components for partitioning clustering algorithms, Artificial Intelligence Review (2009). Doi: 10. 1007/s10462-009-9133-6.
7. T. Dietterich, Approximate statistical tests for comparing supervised classification learning algorithms, Neural Computation 10 (1998), 1895-1923. (Pubitemid 128463689)
8. N. Drossos, A. Papagelis and D. Kalles, Decision tree toolkit: A component-based library of decision tree algorithms, Lecture Notes in Computer Science (2000), 381-387.
9. U. M. Fayyad and K. B. Irani, On the hand ling of continuous-valued attributes in decision tree generation, Machine Learning 8 (1992), 87-102.
10. E. Gamma, R. Helm, R. Johnson and J. Vlissides, Design patterns: Abstraction and reuse of object-oriented design, in: Proceedings of the 7th European Conference on Object-Oriented Programming, G. Goos and J. Hartmanis, ed. , Springer, Berlin/Heidelberg, 1993, pp. 406-431.
11. J. Gehrke, R. Ramakrishnan and V. Ganti, RainForest: A Framework for fast decision tree construction of large datasets, Data Mining and Knowledge Discovery 4 (2000), 127-168.
12. G. V. Kass, An exploratory technique for investigating large quantities of categorical data, Applied Statistics 29 (1980), 119-127.
13. R. Kohavi, Scaling up the accuracy of naive-Bayes classifiers: A decision-tree hybrid, in: KDD 96, 1999, pp. 202-207.
14. W. Y. Loh and Y. S. Shih, Split selection methods for classification trees, Statistica Sinica 7 (1997), 815-840.
15. R. L. Mantaras, A distance-based attribute selection measure for decision tree induction, Machine Learning 6 (1991), 81-92.
16. I. Mierswa, M. Wurst, R. Klinkenberg, M. Scholz and T. Euler, YALE: Rapid prototyping for complex data mining tasks, in: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, 2006, pp. 935-940. (Pubitemid 44535615)
17. S. K. Murthy,Automatic construction of decision trees fromdata: Amultidisciplinary survey, Data Mining and Knowledge Discovery 2, 345-389.
18. J. R. Quinlan, Induction of decision trees, Machine Learning 1 (1986), 81-106.
19. J. R. Quinlan, C4. 5 Programs for Machine Learning, Morgan Kaufmann, 1993.
20. R. Development Core Team, R: A language and environment for statistical computing, R Foundation for Statistical Computing, Vienna, Austria, 2008 [http://www. R-project. org].
21. S. R. Safavian and D. Land grebe, A survey of decision tree classifier methodology, IEEE Transactions on System, Man, and Cybernetics 21 (1991), 660-674. (Pubitemid 21703512)
22. S. Salzberg,On comparing classifiers: Acritique of current research and methods, Data Mining and Knowledge Discovery 1 (1999), 1-12.
23. S. Sonnenburg, M. L. Braun, C. S. Ong, S. Bengio, L. Bottou, G. Holmes, Y. LeCun, K. R. Mueller, F. Pereira, C. E. Rasmussen, G. Raetsch, B. Schoelkopf and A. Smola, The need for open source software in machine learning, Journal of Machine Learning Research 8 (2007), 2443-2466. (Pubitemid 350046193)
24. W. Tracz, Where does reuse start? ACM SIGSOFT Software Engineering Notes 15 (1990), 42-46.
25. T. Winn and P. Calder, Is this a pattern? IEEE Software 19 (2002), 59-66. (Pubitemid 34069371)
26. I. Witten and E. Frank, Data mining: Practical Machine Learning Tools and Techniques, 2nd Edition, Morgan Kaufmann, San Francisco, 2005.
27. D. H. Wolpert, The lack of a priori distinctions between learning algorithms, Neural Computation 8 (1996), 1341-1390. (Pubitemid 126449973)
28. X. Wu, V. Kumar, J. R. Quinlan, J. Ghosh, Q. Yang, H. Motoda, G. J. McLachlan, A. Ng, B. Liu, P. S. Yu, Z. H. Zhou, M. Steinbach, D. J. Hand and D. Steinberg, Top 10 algorithms in data mining, Knowledge information systems 14 (2008), 1-37.
29. M. J. Zaki, N. Parimi, N. De, F. Gao, B. Phophaakdee, J. Urban, V. Chaoji, M. Al Hasan and S Salem, Towards generic pattern mining, Lecture Notes in Computer Science (2005), 91-97.
30. Z. H. Zhou and Z. Q. Chen, Hybrid decision tree, Knowledge Based Systems 15 (2002), 515-528.