Support Vector Machines with Example Dependent Costs

  • Ulf Brefeld
  • Peter Geibel
  • Fritz Wysotzki
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2837)


Classical learning algorithms from the fields of artificial neural networks and machine learning, typically, do not take any costs into account or allow only costs depending on the classes of the examples that are used for learning. As an extension of class dependent costs, we consider costs that are example, i.e. feature and class dependent. We present a natural cost-sensitive extension of the support vector machine (SVM) and discuss its relation to the Bayes rule. We also derive an approach for including example dependent costs into an arbitrary cost-insensitive learning algorithm by sampling according to modified probability distributions.


Support Vector Machine Cost Matrix Soft Margin Support Vector Machine Learning Dependent Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Bishop, C.M.: Neural Networks for Pattern Recognition. Oxford University Press, Oxford (1995)Google Scholar
  2. 2.
    Burges, C.J.C.: A Tutorial on Support Vector Machines for Pattern Recognition. Knowledge Discovery and Data Mining 2(2) (1998)Google Scholar
  3. 3.
    Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines (and Other Kernel-Based Learning Methods). Cambridge University Press, Cambridge (2000)Google Scholar
  4. 4.
    Elkan, C.: The foundations of Cost-Sensitive learning. In: Nebel, B. (ed.) Proceedings of the seventeenth International Conference on Artificial Intelligence (IJCAI 2001), San Francisco, CA, August 4-10, pp. 973–978. Morgan Kaufmann Publishers, Inc., San Francisco (2001)Google Scholar
  5. 5.
    Kukar, M., Kononenko, I.: Cost-sensitive learning with neural networks. In: Prade, H. (ed.) Proceedings of the 13th European Conference on Artificial Intelligence (ECAI 1998), Chichester, pp. 445–449. John Wiley & Sons, Chichester (1998)Google Scholar
  6. 6.
    Lenarcik, A., Piasta, Z.: Rough classifiers sensitive to costs varying from object to object. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 222–230. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  7. 7.
    Lin, Y.: Support vector machines and the bayes rule in classification. Data Mining and Knowledge Discovery 6(3), 259–275 (2002)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Lin, Y., Lee, Y., Wahba, G.: Support vector machines for classification in nonstandard situations. Machine Learning 46(1-3), 191–202 (2002)zbMATHCrossRefGoogle Scholar
  9. 9.
    Margineantu, D.D., Dietterich, T.G.: Bootstrap methods for the costsensitive evaluation of classifiers. In: Proc. 17th International Conf. on Machine Learning, pp. 583–590. Morgan Kaufmann, San Francisco (2000)Google Scholar
  10. 10.
    Saitta, L. (ed.): Machine Learning – A Technological Roadmap. University of Amsterdam (2000) ISBN: 90-5470-096-3Google Scholar
  11. 11.
    Vapnik, V.N.: The Nature of Statistical Learning Theory. Springer, New York (1995)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Ulf Brefeld
    • 1
  • Peter Geibel
    • 1
  • Fritz Wysotzki
    • 1
  1. 1.Fak. IV, ISTI, AI Group, Sekr. FR5-8TU BerlinBerlinGermany

Personalised recommendations