Abstract
Extreme learning machine (ELM) performs more effectively than other learning algorithm in many cases, it has fast learning speed, good generalization performance and simple setting. However, how to select and cluster the candidate are still the most important issues. In this paper, KGA-ARPSOELM, an improved ensemble of ELMs based on K-means, tournament-selection and attractive and repulsive particle swarm optimization (ARPSO) strategy is proposed to obtain better candidates of the ensemble system. To improve classification and selection ability in the ensemble system, K-means is applied to cluster the ELMs efficiently while tournament- selection is used to choose the optimal base ELMs with higher fitness value in proposed method. Moreover, experiment results verify that the proposed method has the advantage of being more convenient to get better convergence performance than the traditional algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Huang, G.B., Zhu, Q.Y., Siew, C.K.: Extreme learning machine: a new learning scheme of feedforward neural networks. In: IEEE International Joint Conference on Neural Networks, vol. 2, pp. 985–990. IEEE Press (2004)
Huang, G.B., Zhu, Q.Y., Siew, C.K.: Extreme learning machine: theory and applications. Neurocomputing 70(1), 489–501 (2006)
Xu, Y., Shu, Y.: Evolutionary extreme learning machine – based on particle swarm optimization. In: Wang, J., Yi, Z., Żurada, J.M., Lu, B.-L., Yin, H. (eds.) ISNN 2006. LNCS, vol. 3971, pp. 644–652. Springer, Heidelberg (2006)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International of First Conference on Neural Networks (1995)
Riget, J., Vesterstrøm, J.S.: A diversity-guided particle swarm optimizer-the ARPSO. Department of Computer, Technical report (2002)
Yang, D., Han, F.: An improved ensemble of extreme learning machine based on attractive and repulsive particle swarm optimization. In: Huang, D.-S., Bevilacqua, V., Premaratne, P. (eds.) ICIC 2014. LNCS, vol. 8588, pp. 213–220. Springer, Heidelberg (2014)
Anil, K.J.: Data clustering: 50 years beyond K-means. Pattern Recogn. Lett. 31(8), 651–666 (2010)
Huang, G.B.: Learning capability and storage capacity of two-hidden-layer feedforward networks. IEEE Trans. Neural Netw. 14(2), 274–281 (2003)
Han, F., Zhu, J.S.: Improved particle swarm optimization combined with backpropagation for feedforward neural networks. Int. J. Intell. Syst. 28(3), 271–288 (2013)
Zeng, J.C., Jie, J., Cui, Z.H.: Particle Swarm Optimization. Science Press, Beijing (2004)
Frühwirth, T.: Parallelizing union-find in constraint handling rules using confluence analysis. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 113–127. Springer, Heidelberg (2005)
Wang, D., Alhamdoosh, M.: Evolutionary extreme learning machine ensembles with size control. Neurocomputing 102(2), 98–110 (2013)
Soria Olivas, E., Gómez Sanchis, J., MartÃn, J.D., Vila Francés, J., MartÃnez, M., et al.: BELM: Bayesian extreme learning machine. IEEE Trans. Neural Netw. 22, 505–509 (2011)
Acknowledgements
This work was supported by the National Natural Science Foundation of China (Nos. 61271385, 61572241) and the Initial Foundation of Science Research of Jiangsu University (No. 07JDG033).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Wu, YQ., Han, F., Ling, QH. (2016). An Improved Ensemble Extreme Learning Machine Based on ARPSO and Tournament-Selection. In: Tan, Y., Shi, Y., Li, L. (eds) Advances in Swarm Intelligence. ICSI 2016. Lecture Notes in Computer Science(), vol 9713. Springer, Cham. https://doi.org/10.1007/978-3-319-41009-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-41009-8_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-41008-1
Online ISBN: 978-3-319-41009-8
eBook Packages: Computer ScienceComputer Science (R0)