Maximal-Margin Approach for Cost-Sensitive Learning Based on Scaled Convex Hull

1. Brefeld, U., Geibel, P., Wysotzki, F.: Support vector machines with example dependent costs. In: Lavrač, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) ECML 2003. LNCS (LNAI), vol. 2837, pp. 23–34. Springer, Heidelberg (2003); Int. Conf. Machine Learning, pp. 57–64 (2000)

   Chapter  Google Scholar 

2. Domingos, P.: MetaCost: a general method for making classifiers cost-sensitive. In: Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, pp. 155–164 (1999)

   Google Scholar 

3. Elkan, C.: The foundations of cost-senstive learning. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence, Seattle, WA, pp. 973–978 (2001)

   Google Scholar 

4. Margineantu, D.D., Dietterich, T.G.: Bootstrap methods for the cost-sensitive evaluation of classifiers. In: Proceedings of the 17th International Conference on Machine Learning, San Francisco, CA, pp. 583–590 (2000)

   Google Scholar 

5. Ting, K.M.: A comparative study of cost-sensitive boosting algorithms. In: Proceedings of the 17th International Conference on Machine Learning, San Francisco, CA, pp. 983–990 (2000)

   Google Scholar 

6. Bradford, J.P., Kuntz, C., Kohavi, R., Brunk, C., Brodley, C.E.: Pruning decision trees with misclassification costs. In: Nédellec, C., Rouveirol, C. (eds.) ECML 1998. LNCS, vol. 1398, pp. 131–136. Springer, Heidelberg (1998)

   Chapter  Google Scholar 

7. Knoll, U., Nakhaeizadeh, G., Tausend, B.: Cost-sensitive pruning of decision trees. In: Lavrač, N., Wrobel, S. (eds.) ECML 1995. LNCS, vol. 912, pp. 383–386. Springer, Heidelberg (1995)

   Google Scholar 

8. Ting, K.M.: An instance-weighting method to induce cost-sensitive trees. IEEE Transactions on Knowledge and Data Engineering 14(3), 659–665 (2002)

   Article  Google Scholar 

9. Kukar, M., Kononenko, I.: Cost-sensitive learning with neural networks. In: Proceedings of the 13th European Conference on Artificial Intelligence, Brighton, UK, pp. 445–449 (1998)

   Google Scholar 

10. Lawrence, S., Burns, I., Back, A., Tsoi, A.C., Giles, C.L.: Neural network classification and prior class probabilities. In: Orr, G.B., Müller, K.-R. (eds.) NIPS-WS 1996. LNCS, vol. 1524, pp. 299–313. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

11. Cortes, C., Vapnik, V.N.: Support Vector Networks. Mach. Learn. 20(3), 273–297 (1995)

    MATH  Google Scholar 

12. Bennett, K.P., Bredensteiner, E.J.: Duality and Geometry in SVM classifiers. In: Proc. 17th Int. Conf. Machine Learning, pp. 57–64 (2000)

    Google Scholar 

13. Tao, Q., Wu, G.W., Wang, J.: A general soft method for learning SVM classifiers with L1-norm penalty. Pattern Recognit. 41(3), 939–948 (2008)

    Article  MATH  Google Scholar 

14. Keerthi, S., Shevade, S., Bhattacharyya, C., Murthy, K.: Improvements to Platt’s SMO algorithm for SVM classifier design, Dept of CSA, IISc, Bangalore, India, Tech. Rep. (1999)

    Google Scholar 

Download references