Skip to main content

On-Line Ensemble-Teacher Learning through a Perceptron Rule with a Margin

  • Conference paper
Artificial Neural Networks – ICANN 2010 (ICANN 2010)

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

Included in the following conference series:

Abstract

Ensemble learning improves the performance of a learning machine by using a majority vote of many weak-learners. As an alternative, Miyoshi and Okada proposed ensemble-teacher learning. In this method, the student learns from many quasi-optimal teachers and performs better than the quasi-optimal teachers when a linear perceptron is used. When a non-linear perceptron is used, a Hebbian rule is effective; however, a perceptron rule is not effective in this case and the student cannot perform better than the quasi-optimal teachers. In this paper, we analyze ensemble-teacher learning and explain why a perceptron rule is not effective in ensemble-teacher learning. We propose a method to overcome this problem.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Breiman, L.: Bagging predictors. Machine Learning 24, 123 (1996)

    MATH  MathSciNet  Google Scholar 

  2. Freund, Y., Shapire, R.E.: J. Comput. Syst. Sci. 55, 119 (1997)

    Google Scholar 

  3. Murata, N., Takenouchi, T., Kanamori, T., Eguchi, S.: Information Geometry of U-Boost and Bregman Divergence. Neural Computation 16(7), 1437–1481 (2004)

    Article  MATH  Google Scholar 

  4. Miyoshi, S., Okada, M.: Statistical mechanics of online learning for ensemble-teachers. Journal of the Physical Society of Japan 75(4), 044002 (6 pages) (2006)

    Google Scholar 

  5. Utsumi, H., Miyoshi, S., Okada, M.: Statistical Mechanics of Nonlinear On-line Learning for ensemble-teachers. J. Phys. Soc. Jpn. 76, 114001 (2007)

    Article  Google Scholar 

  6. Okada, M., Hara, K., Miyoshi, S.: Quasi-supervised learning and ensemble learning. Meeting abstracts of the Physical Society of Japan (2007) (in Japanese)

    Google Scholar 

  7. Hara, K., Okada, M.: On-line learning through simple perceptron with a margin. Neural Networks 17, 215–223 (2004)

    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

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hara, K., Ono, K., Miyoshi, S. (2010). On-Line Ensemble-Teacher Learning through a Perceptron Rule with a Margin. 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_45

Download citation

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

  • 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