Anytime induction of Cost-sensitive Trees

Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference

Volumn , Issue , 2008, Pages

  Esmeir, Saher ^a   Markovitch, Shaul ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORESTRY; LEARNING SYSTEMS; STOCHASTIC SYSTEMS;

ANYTIME ALGORITHM; CLASSIFICATION PROCESS; COMPUTATION TIME; COST-SENSITIVE; LEARNING PROCESS; MACHINE LEARNING TECHNIQUES; MISCLASSIFICATION COSTS; REAL-WORLD; TESTING COSTS; TREE TOPS;

COSTS;

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

References (24)

1. N. Abe, B. Zadrozny, and J. Langford. An iterative method for multi-class cost-sensitive learning. In KDD, 2004.
2. V. Bayer-Zubek and Dietterich. Integrating learning from examples into the search for diagnostic policies. Artificial Intelligence, 24:263-303, 2005. (Pubitemid 43130938)
3. C. L. Blake and C. J. Merz. UCI repository of machine learning databases, 1998.
4. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Occam's Razor. Information Processing Letters, 24(6):377-380, 1987.
5. M. Boddy and T. L. Dean. Deliberation scheduling for problem solving in time constrained environments. Artificial Intelligence, 67(2):245-285, 1994.
6. J. Bradford, C. Kunz, R. Kohavi, C. Brunk, and C. Brodley. Pruning decision trees with misclassification costs. In ECML, 1998.
7. L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and Regression Trees. Wadsworth and Brooks, Monterey, CA, 1984.
8. J. Demsar. Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7:1-30, 2006. (Pubitemid 43022939)
9. P. Domingos. Metacost: A generalmethod formaking classifiers cost-sensitive. In KDD, 1999.
10. C. Elkan. The foundations of cost-sensitive learning. In IJCAI, 2001.
11. S. Esmeir and S.Markovitch. Anytime learning of decision trees. Journal of Machine Learning Research, 8, 2007.
12. R. Greiner, A. J. Grove, and D. Roth. Learning cost-sensitive active classifiers. Artificial Intelligence, 139(2):137-174, 2002. (Pubitemid 34802160)
13. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning: Data Mining, Inference, and Prediction. New York: Springer-Verlag, 2001.
14. D. Margineantu. Active cost-sensitive learning. In IJCAI, 2005.
15. P. Melville, M. Saar-Tsechansky, F. Provost, and R. J. Mooney. Active feature acquisition for classifier induction. In ICDM, 2004.
16. S. W. Norton. Generating better decision trees. In IJCAI, 1989.
17. M. Nunez. The use of background knowledge in decision tree induction. Machine Learning, 6:231-250, 1991. (Pubitemid 21737707)
18. F. Provost and B. Buchanan. Inductive policy: The pragmatics of bias selection. Machine Learning, 20(1-2):35-61, 1995.
19. Z. Qin, S. Zhang, and C. Zhang. Cost-sensitive decision trees with multiple cost scales. Lecture Notes in Computer Science, AI, Volume 3339/2004:380-390, 2004. (Pubitemid 41050369)
20. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993.
21. S. Sheng, C. X. Ling, A. Ni, and S. Zhang. Cost-sensitive test strategies. In AAAI, 2006.
22. M. Tan and J. C. Schlimmer. Cost-sensitive concept learning of sensor use in approach and recognition. In Proceedings of the 6th international workshop on Machine Learning, 1989.
23. P. Turney. Types of cost in inductive concept learning. InWorkshop on Cost-Sensitive Learning at ICML, 2000.
24. P. D. Turney. Cost-sensitive classification: Empirical evaluation of a hybrid genetic decision tree induction algorithm. Journal of Artificial Intelligence Research, 2:369-409, 1995.