A fast decision tree learning algorithm

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 500-505

  Su, Jiang ^a   Zhang, Harry ^a  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DECISION TABLES; LEARNING SYSTEMS; TREES (MATHEMATICS);

ASYMPTOTIC IMPROVEMENT; DECISION TREE; SPACE COMPLEXITY; TRAINING DATA;

LEARNING ALGORITHMS;

EID: 33750742739     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Auer, P.; Holte, R. C.; and Maass, W. 1995. Theory and applications of agnostic PAC-learning with small decision trees. In Proceedings of the 12th International Conference on Machine Learning. Morgan Kaufmann. 21-29.
2. Dietterich, T. G. 1997. Machine learning research: Four current directions. AI Magazine 18:4:97-136.
3. Domingos, P., and Pazzani, M. 1997. Beyond independence: Conditions for the optimality of the simple Bayesian classifier. Machine Learning 29:103-130.
4. Dumais, S.; Platt, J.; Heckerman, D.; and Sahami, M. 1998. Inductive learning algorithms and representations for text categorization. In Proceedings of the Seventh International Conference on Information and Knowledge Management. 148-155.
5. Forman, G., and Cohen, I. 2004. Learning from little: Comparison of classifiers given little training. In Proceeding of PKDD2004. 161-172.
6. Friedman, N., and Goldszmidt, M. 1996. Learning Bayesian networks with local structure. In Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence. 252-262.
7. Gehrke, J. E.; Ramakrishnan, R.; and Ganti, V. 2000. Rainforest - A framework for fast decision tree construction of large datasets. Data Mining and Knowledge Discovery 4:2/3:127-162.
8. Holte, R. 1993. Very simple classification rules perform well on most commonly used datasets. Machine Learning 11:63-91.
9. Kohavi, R. 1996. Scaling up the accuracy of naive-Bayes classifiers: A decision-tree hybrid. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining. AAAI Press. 202-207.
10. Mehta, M.; Agrawal, R.; and Rissanen, J. 1996. SLIQ: A fast scalable classifier for data mining. In Proceedings of the Fifth International Conference on Extending Database Technology. 18-32.
11. Perlich, C.; Provost, F.; and Simonoff, J. S. 2003. Tree induction vs. logistic regression: A learning-curve analysis. Machine Learning Research 4:211-255.
12. Provost, F. J., and Kolluri, V. 1999. A survey of methods for scaling up inductive algorithms. Data Min. Knowl. Discov 3(2):131-169.
13. Quinlan, J. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann: San Mateo, CA.
14. Shafer, J. C.; Agrawal, R.; and Mehta, M. 1996. SPRINT: A scalable parallel classifier for data mining. In Proceedings of the 22nd International Conference on Very Large Databases. Morgan Kaufmann. 544-555.
15. Shavlik, J.; Mooney, R.; and Towell, G. 1991. Symbolic and neural network learning algorithms: An experimental comparison. Machine Learning 6:111-143.
16. Witten, I. H., and Frank, E. 2000. Data Mining -Practical Machine Learning Tools and Techniques with Java Implementation. Morgan Kaufmann.