Skip to main content

Explicit Class Structure by Weighted Cooperative Learning

  • Conference paper
  • 7131 Accesses

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

Abstract

In this paper, we propose a new type of information-theoretic method called ”weighted cooperative learning.” In this method, two networks, namely, cooperative and uncooperative networks are prepared. The roles of these networks are controlled by the cooperation parameter α. As the parameter is increased, the role of cooperative networks becomes more important in learning. In addition, the importance of input units or variables is incorporated in the learning in terms of mutual information. We applied the method to the housing data from the machine learning database. Experimental results showed that weighted cooperative learning could be used to improve performance in terms of quantization and topographic errors. In addition, we could obtain much clearer class boundaries on the U-matrix by the weighted cooperative learning.

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. Kamimura, R.: Information-theoretic enhancement learning and its application to visualization of self-organizing maps. Neurocomputing 73(13-15), 2642–2664 (2010)

    Article  Google Scholar 

  2. Kiviluoto, K.: Topology preservation in self-organizing maps. In: Proceedings of the IEEE International Conference on Neural Networks, pp. 294–299 (1996)

    Google Scholar 

  3. Ultsch, A.: U*-matrix: a tool to visualize clusters in high dimensional data. Tech. Rep. 36, Department of Computer Science, University of Marburg (2003)

    Google Scholar 

  4. Vesanto, J., Himberg, J., Alhoniemi, E., Parhankangas, J.: SOM toolbox for Matlab. Tech. Rep. Laboratory of Computer and Information Science, Helsinki University of Technology (2000)

    Google Scholar 

  5. Vesanto, J.: SOM-based data visualization methods. Intelligent Data Analysis 3, 111–126 (1999)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kamimura, R. (2011). Explicit Class Structure by Weighted Cooperative Learning. In: Honkela, T., Duch, W., Girolami, M., Kaski, S. (eds) Artificial Neural Networks and Machine Learning – ICANN 2011. ICANN 2011. Lecture Notes in Computer Science, vol 6791. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21735-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21735-7_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21734-0

  • Online ISBN: 978-3-642-21735-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics