Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1983))

  • 1310 Accesses

Abstract

Observational learning algorithm is an ensemble algorithm where each network is initially trained with a bootstrapped data set and virtual data are generated from the ensemble for training. Here we propose a modular OLA approach where the original training set is partitioned into clusters and then each network is instead trained with one of the clusters. Networks are combined with different weighting factors now that are inversely proportional to the distance from the input vector to the cluster centers. Comparison with bagging and boosting shows that the proposed approach reduces generalization error with a smaller number of networks employed.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Cho, S. and Cha, K., “Evolution of neural network training set through addition of virtual samples,” International Conference on Evolutionary Computations, 685–688 (1996)

    Google Scholar 

  2. Cho, S., Jang, M. and Chang, S., “Virtual Sample Generation using a Population of Networks,” Neural Processing Letters, Vol. 5 No. 2, 83–89 (1997)

    Article  Google Scholar 

  3. Jang, M. and Cho, S., “Observational Learning Algorithm for an Ensemble of Neural Networks,” submitted (1999)

    Google Scholar 

  4. Drucker, H., “Improving Regressors using Boosting Techniques,” Machine Learning: Proceedings of the Fourteenth International Conference, 107–115 (1997)

    Google Scholar 

  5. Perrone, M. P. and Cooper, L. N., “When networks disagree: Ensemble methods for hybrid neural networks,” Artificial Neural Networks for Speech and Vision, (1993)

    Google Scholar 

  6. Platt, J., “A Resource-Allocating Network for Function Interpolation,” Neural Computation, Vol 3, 213–225 (1991)

    Article  MathSciNet  Google Scholar 

  7. Roberts, S. and Tarassenko, L., “A Probabilistic Resource Allocating Network for Novelty Detection,” Neural Computation, Vol 6, 270–284 (1994)

    Article  Google Scholar 

  8. Sebestyen, G. S., “Pattern Recognition by an Adaptive Process of Sample Set Construction,” IRE Trans. Info. Theory IT-8, 82–91 (1962)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shin, H., Lee, H., Cho, S. (2000). Observational Learning with Modular Networks. In: Leung, K.S., Chan, LW., Meng, H. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2000. Data Mining, Financial Engineering, and Intelligent Agents. IDEAL 2000. Lecture Notes in Computer Science, vol 1983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44491-2_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-44491-2_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41450-6

  • Online ISBN: 978-3-540-44491-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics