Abstract
In this paper, an ensemble of neural networks based incremental learning algorithm with weights updated voting is described. The algorithm defines the class kernel function of the training database of the component neural network in the ensemble. The voting weights are updated based on the distance between the test instance and the kernel function. This method can adaptively update the voting weights according to the classification performance of the component neural network on the test pattern and it is more optimal than the stable weights voting strategy. Experimental results show that the ensemble of neural networks based incremental learning algorithm with weights updated voting is more promising than that with stable weights voting rule.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fu, L.: Incremental Knowledge Acquisition in Supervised Learning Networks. IEEE Transactions on Systems, Man and Cybernetics-Part A: System and Humans 6, 801–809 (1996)
Zhang, B.: An Incremental Learning Algorithm That Optimizes Network Size and Sample Size in One Trial. In: Proc. IEEE International Conference on Neural Network, pp. 215–220 (1994)
Robi, P.: Learn++: an Incremental Learning Algorithm for Supervised Neural Networks. IEEE Transactions on Systems, Man, and Cybernetics-part C: Applications and Reviews 31, 497–508 (2001)
Sollich, P., Krogh, A.: Learning with Ensembles: How Overfitting Can be Useful. In: Touretzky, D., Mozer, M., Hasselmo, M. (eds.) Advances in Neural Information Processing Systems 8, pp. 190–196. MIT Press, Cambridge (1996)
Hansen, L., Salamon, P.: Neural Network Ensembles. IEEE Transactions on Pattern Analysis and Machine Intelligence 12, 993–1001 (1990)
Freund, Y., Schapire, R.: A Decision-theoretic Generalization of On-line Learning and an Application to Boosting. Journal of Computer and System Sciences 55, 119–139 (1997)
Aliasgar, G., Robi, P.: Dynamically weighted majority voting for incremental learning and comparison of three Boosting based approached. In: Proceedings of International Joint Conference on Neural Networks, Montreal, Canada, pp. 1131–1136 (2005)
Schapire, R.: The Strength of Weak Learnability. Machine Learning 5(2), 197–227 (1990)
Breiman, L.: Bagging Predictors. Machine Learning 24(2), 123–140 (1996)
Jimenez, D., Jordan, M.I., Nowlan, S.J., Hinton, G.E.: Adaptively mixtures of local experts. Neural Computation 3(1), 79–87 (1991)
Littlestone, N., Warmuth, M.: Weighted Majority Algorithm. Inform. Comput. 108, 212–261 (1994)
Fisher, R.A.: The Use of Multiple Measurements in Taxonomic Problems. Annual Eugenics, Part II 7, 179–188 (1936)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, J., Xia, S., Hu, W., Yu, W. (2009). Weights Updated Voting for Ensemble of Neural Networks Based Incremental Learning. In: Yu, W., He, H., Zhang, N. (eds) Advances in Neural Networks – ISNN 2009. ISNN 2009. Lecture Notes in Computer Science, vol 5551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01507-6_75
Download citation
DOI: https://doi.org/10.1007/978-3-642-01507-6_75
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01506-9
Online ISBN: 978-3-642-01507-6
eBook Packages: Computer ScienceComputer Science (R0)