Skip to main content

Weighted Learning Vector Quantization to Cost-Sensitive Learning

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6354))

Abstract

The importance of cost-sensitive learning becomes crucial when the costs of misclassifications are quite different. Many evidences have demonstrated that a cost-sensitive predictive model is more desirable in practical applications than a traditional one without taking the cost into consideration. In this paper, we propose two approaches which incorporate the cost matrix into original learning vector quantization by means of instance weighting. Empirical results show that the proposed algorithms are effective on both binary-class data and multi-class data.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Turney, P.D.: Types of Cost in Inductive Concept Leaning. In: Workshop on Cost-Sensitive Learning at 7th International Conference on Machine Learning, California, pp. 15–21 (2000)

    Google Scholar 

  2. Hammer, B., Villmann, T.: Generalized Relevance Learning Vector Quantization. Neural Networks 15, 1059–1068 (2002)

    Article  Google Scholar 

  3. Qin, A., Suganthan, P.: Initialization Insensitive LVQ Algorithm based on Cost-Function Adaptation. Pattern Recognition 38(5), 773–776 (2005)

    Article  MATH  Google Scholar 

  4. Pedreira, C.E.: Learning Vector Quantization with Training Data Selection. IEEE Transaction on Pattern Analysis and Machine Intelligence 28(1), 157–162 (2006)

    Article  Google Scholar 

  5. Chen, N., Vieira, A., Duarte, J.: Cost-sensitive LVQ for Bankruptcy Prediction: An Empirical Study. In: Li, W., Zhou, J. (eds.) 2nd IEEE International Conference on Computer Science and Information Technology, Beijing, pp. 115–119 (2009)

    Google Scholar 

  6. Chen, N., Vieira, A., Duarte, J., Ribeiro, B., Neves, J.C.: Cost-sensitive Learning Vector Quantization for Financial Distress Prediction. In: Lopes, L.S., Lau, N., Mariano, P., Rocha, L.M., et al. (eds.) EPIA 2009. LNCS (LNAI), vol. 5816, pp. 374–385. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. 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 

  8. Kohonen, T.: Self-Organizing Maps, 3rd edn. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  9. UCI Machine Learning Repository, http://www.ics.uci.edu/~mlearn/MLRepository.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, N., Ribeiro, B., Vieira, A., Duarte, J., Neves, J. (2010). Weighted Learning Vector Quantization to Cost-Sensitive Learning. In: Diamantaras, K., Duch, W., Iliadis, L.S. (eds) Artificial Neural Networks – ICANN 2010. ICANN 2010. Lecture Notes in Computer Science, vol 6354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15825-4_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15825-4_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15824-7

  • Online ISBN: 978-3-642-15825-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics