Partial example acquisition in cost-sensitive learning

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2007, Pages 638-646

  Sheng, Victor S ^a   Ling, Charles X ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Active cost sensitive learning; Active learning; Cost sensitive learning; Data acquisition; Data mining; Induction; Interactive and online data mining; Machine learning

Indexed keywords

DATA ACQUISITION; DATA MINING; DATA STRUCTURES; ONLINE SYSTEMS; REAL TIME SYSTEMS;

ACTIVE LEARNING; COST-SENSITIVE LEARNING; DATASETS; PARTIAL EXAMPLE ACQUISITION (PAS);

LEARNING SYSTEMS;

EID: 36849044683     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281192.1281261     Document Type: Conference Paper

References (24)

1. Baram, Y., El-Yaniv, R., and Luz, K. 2004. Online Choice of Active Learning Algorithms. Journal of Machine Learning Research, 5:255-291.
2. Blake, C.L., and Merz, C.J. 1998. UCI Repository of machine learning databases (website). Irvine, CA: University of California, Department of Information and Computer Science.
3. Cestnik, B. 1990. Estimating probabilities: A crucial task in machine learning. In Proceedings of the 9th European Conference on Artificial Intelligence, 147-149, Sweden.
4. Chai, X., Deng, L., Yang, Q., and Ling,C.X., 2004. Test-Cost Sensitive Naïve Bayesian Classification. In Proceedings of the Fourth IEEE International Conference on Data Mining. UK: IEEE Computer Society Press.
5. Domingos, P. 1999. MetaCost: A General Method for Making Classifiers Cost-Sensitive. In Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining, 155-164. San Diego, CA: ACM Press.
6. Elkan, C. 2001. The Foundations of Cost-Sensitive Learning. In Proceedings of the Seventeenth International Joint Conference of Artificial Intelligence, 973-978. Seattle, Washington: Morgan Kaufmann.
7. Fayyad, U.M., and Irani, K.B. 1993. Multi-interval discretization of continuous-valued attributes for classification learning. In Proceedings of the 13th International Joint Conference on Artificial Intelligence, 1022-1027. France: Morgan Kaufmann.
8. Good, I.J. 1965. The estimation of probabilities: An essay on modern Bayesian methods. M.I.T. Press, Cambridge, Mass.
9. Kapoor, A., and Greiner, R. 2005. Learning and Classifying under Hard Budgets. In Proceedings of the 16th European Conference on Machine Learning (Porto, Portugal), Springer, 170-181.
10. Lizotte, D., Madani, O., and Greiner R. 2003. Budgeted Learning of Naive-Bayes Classifiers. In Proceeding of the Conference on Uncertainty in Artificial Intelligence, Acapulco, Mexico, August 2003.
11. Ling, C.X., Yang, Q., Wang, J., and Zhang, S. 2004. Decision Trees with Minimal Costs. In Proceedings of the Twenty-First International Conference on Machine Learning. Banff, Alberta. Morgan Kaufmann.
12. Margineantu, D.D. 2005. Active Cost-Sensitive Learning. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Edinburgh, Scotland.
13. Melville, P., Saar-Tsechansky, M., Provost, F., and Mooney, RJ. 2004. Active Feature Acquisition for Classifier Induction. In Proceedings of the Fourth International Conference on Data Mining. Brighton, UK.
14. Melville, P., Saar-Tsechansky, M., Provost, F., and Mooney, R.J. 2005. Economical Active Feature-value Acquisition through Expected Utility Estimation. UBDM Workshop, KDD 2005.
15. Quinlan, J.R. 1993. C4.5: Programs for Machine Learning. San Mateo, CA: Morgan Kaufmann.
16. Roy, N., and McCallum, A. 2001. Toward optimal active learning through sampling estimation of error reduction. In Proceedings of the 18th International Conference on Machine Learning, 441-448.
17. Saar-Tsechansky, M. and Provost, F. 2004. Active sampling for class probability estimation and ranking. Machine Learning, 54(2): 153-178.
18. Ting, K.M. 1998. Inducing Cost-Sensitive Trees via Instance Weighting. In Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery, 23-26. Springer-Verlag.
19. Tong, S., and Koller, D. 2001. Support vector machine active learning with applications to text classification. Journal of Machine Learning Research, 2:45-66.
20. Turney, P.D. 2000. Types of cost in inductive concept learning. In Proceedings of the Workshop on Cost-Sensitive Learning at the Seventeenth International Conference on Machine Learning, Stanford University, California.
21. Turney, P.D. 1995. Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm. Journal of Artificial Intelligence Research 2:369-409.
22. Zhang, T., and Oles, F. 2000. A probability analysis on the value of unlabeled data for classification problems. In the International Joint Conference on Machine Learning, 1191-1198.
23. Zhu, X. and Wu, X. 2005. Cost-constrained Data Acquisition for Intelligent Data Preparation. IEEE Transactions on Knowledge and Data Engineering, Vol. 17, No. 11. November.
24. Zubek, V.B. and Dietterich, T. 2002. Pruning improves heuristic search for cost-sensitive learning. In Proceedings of the Nineteenth International Conference of Machine Learning, 27-35, Sydney, Australia: Morgan Kaufmann.