A combinative method for decision tree construction

Proceedings - Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2005

Volumn 2005, Issue , 2005, Pages 139-143

  Pop, Daniel ^a   Jichici, Ciprian ^a   Negru, Viorel ^a  

^a WEST UNIVERSITY OF TIMISOARA   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; DECISION SUPPORT SYSTEMS; QUALITY ASSURANCE; SET THEORY;

COMBINATIVE METHODS; DECISION TREE CONSTRUCTION; SPLITTING NODES; WINNING SPLITTING ATTRIBUTE;

TREES (MATHEMATICS);

EID: 33847206791     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SYNASC.2005.1     Document Type: Conference Paper

References (24)

1. R. Agrawal, T. Imielinski, and A. Swami. Database mining: A performance perspective. IEEE Transactions on Knowledge and Data Eng., 5(6):914-925, 1993.
2. D. Bahler. Methods of decision tree induction. Proceedings of the 4th North Carolina Symposium on Art. Intell. and Advanced Computing Tech., 1992.
3. S. Brandt. Data Analysis: Statistical and Computational Methods for Scientists and Engineers, 3rd Ed. Springer, 1999.
4. L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and Regression Trees. Chapman & Hall/CRC, 1984.
5. W. Buntine and T. Niblett. A further comparison of splitting rules for decision-tree induction. Mach. Learn., (8):75-85, 1992.
6. R. L. de Mantaras. A distance-based attribute selection measure for decision tree induction. Machine Learning, 6:81-92, 1991.
7. S. Harinath and S. R. Quinn. Professional SQL Server Analysis Services 2005 with MDX. Wiley, 2005.
8. S. Hettich, C. Blake, and C. Merz. UCI repository of machine learning databases, 1998.
9. L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is np-complete. Information Processing Letters, 5(1):15-17, 1976.
10. M. Kantardzic. Data Mining. Concepts, Models, Methods and Algoritms. John Wiley and Sons Inc, 2003.
11. W. Liu and A. White. The importance of attribute selection measures in decision tree induction. Mach. Learn., (15):25-41, 1994.
12. W. Loh and Y. Shih. Split selection methods for classification trees. Statistica Sinica, 7(4), 1997.
13. J. Magidson. The chaid approach to segmentation modeling. Handbook of Marketing Research, 1993.
14. M. Mehta, R. Agrawal, and J. Rissanen. Sliq: A fast scalable classifier for data mining. Proc. of the 5th Int'l Conference on Extending Database Technology, 1996.
15. J. Mingers. Expert systems - rule induction with statistical data. Journal of the Operations Research Society, 38:39-47, 1987.
16. J. Mingers. An empirical comparison of selection measures for decision-tree induction. Machine Learning, (3):319-342, 1989.
17. S. K. Murthy. Automatic construction of decision trees from data: A multi-disciplinary survey. Kluwer Academic Publishers, 1997.
18. D. Nguyen and T. Ho. An interactive-graphic system for decision tree induction. Journal of Japanese Society for Artijicial Intelligence, 14:131-138, 1999.
19. D. Nguyen, T. Ho, and H. Shimodaira. A visualization tool for interactive learning of large decision trees. Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence, ICTA100, pages 28-35, 2000.
20. D. Pop and V. Negru. Inter-translability of representation forms in classification. Proc. of the The International Symposium SINTES, 10:120-123, 2000.
21. D. Pop and V. Negru. An extensible environment for expert system development. In V. Palade, R. Howlett, and L. Jain, editors, KES2003, Lecture Notes in Artificial Intelligence (LNAI2773), pages 1016-1022. Springer-Verlag, Berlin Heidelberg, 2003.
22. J. R. Quinlan. C4.5: Programs For Machine Learning. Morgan Kaufmann, 1993.
23. J. Shafer, R. Agrawal, and M. Mehta. Sprint: A scalable parallel classifier for data mining. Proc. of the 22nd Int'l Conference on Very Large Databases, 1996.
24. A. White and W. Liu. Bias in information-based measures in decision tree induction. Machine Learning, 15:321-329, 1994.