Decision Tree with Better Ranking

Proceedings, Twentieth International Conference on Machine Learning

Volumn 2, Issue , 2003, Pages 480-487

  Ling, Charles X ^a   Yan, Robert J ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION THEORY; ESTIMATION; PROBABILITY; TREES (MATHEMATICS);

AREA UNDER THE CURVE (AUC); DECISION TREE; PROBABILITY ESTIMATION ALGORITHM; RECEIVER OPERATING CHARACTERISTICS (ROC);

LEARNING SYSTEMS;

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

References (14)

1. Bauer, E., & Kohavi, R. (1999). An empirical comparison of voting classification algorithms: Bagging, boosting and variants. Artificial Intelligence, 36, 105-142.
2. Blake, C., & Merz, C. (1998). UCI repository of machine learning databases. http://www.ics.uci.edu/~mlearn/MLRepository.html. University of California, Irvine, Dept. of Information and Computer Sciences.
3. Bradley, A. P. (1997). The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition, 30, 1145-1159.
4. Cohen, W. W., Schapire, R. E., & Singer, Y. (1999). Learning to order things. Journal of Artificial Intelligence Research, 10, 243-270.
5. Hand, D. J., & Till, R. J. (2001). A simple generalisation of the area under the ROC curve for multiple class classification problems. Machine Learning, 45, 171-186.
6. Hastie, T. J., & Pregibon, D. (1990). Shrinking trees (Technical Report). At&T laboratories.
7. Ling, C. X., Huang, J., & Zhang, H. (2003). AUC: a statistically consistent and more discriminating measure than accuracy. Proceedings of 18th International Conference on Artificial Intelligence (IJCAI-2003). To appear.
8. Margineantu, D. D., & Dietterich, T. G. (2001). Improved class probability estimates from decision tree models. In C. Holmes (Ed.), Nonlinear estimation and classification. The Mathematical Sciences Research Institute, University of California Berkeley.
9. Pazzani, M., Merz, C., Murphy, P., Ali, K., Hume, T., & Brunk, C. (1994). Reducing misclassification costs. In Proceedings of the 11th international conference on machine learning, 217-225. Morgan Kaufmann.
10. Provost, F., & Domingos, P. (2003). Tree induction for probability-based ranking. Machine Learning. To appear.
11. Provost, F., Fawcett, T., & Kohavi, R. (1998). The case against accuracy estimation for comparing induction algorithms. In Proceedings of the fifteenth international conference on machine learning, 445-453. Morgan Kaufmann.
12. Quinlan, J. (1993). C4.5: Programs for machine learning. Morgan Kaufmann: San Mateo, CA.
13. Shavlik, J., Mooney, R., & Towell, G. (1991). Symbolic and neural learning algorithms: An experimental comparison. Machine Learning, 6, 111 - 144.
14. Smyth, P., Gray, A., & Fayyad, U. (1995). Retrofitting decision tree classifiers using kernel density estimation. Proceedings of the 12th International Conference on machine Learning (pp. 506-514).