Abstract
A novel competitive Hopfield network with periodic stochastic dynamics is proposed for the NP-hard partitional clustering problem in this paper. Clustering technique has been applied to a wide range of problems, such as pattern recognition and machine learning. The aim of partitional clustering is to obtain a specified number of data sets from the original data according to certain criteria. The proposed algorithm introduces periodic stochastic dynamics, which helps the neural network escape from local minima and search a possible better solution based on the solution which is obtained in the latest period. The performance is evaluated through several benchmark data sets. The simulation results show that the proposed algorithm outperforms previous approaches, such as k -means, genetic algorithm, particle swarm optimization, differential evolution, combinatorial particle swarm optimization and tabu search.
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
Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys 31(3), 264–323 (1999)
Forgy, E.: Cluster analysis of multivariate data: efficiency versus interpretability of classification. Biometrics 21, 768–769 (1965)
Bhuyan, J.N., Raghavan, V.V., Venkatesh, K.E.: Genetic Algorithm for Clustering with an Ordered Representation. In: Proc. Fourth Int’l Conf. Genetic Algorithms, pp. 408–415 (1991)
Krishna, K., Murty, M.N.: Genetic k-means algorithm. IEEE Trans. on Systems, Man, and Cybernetics-Part B: Cybernetic 29(3), 433–439 (1999)
Paterlini, S., Krink, T.: Differential evolution and particle swarm optimization in partitional clustering. Computational Statistics & Data Analysis 50, 1220–1247 (2006)
Jarboui, B., Cheikh, M., Siarry, P., Rebai, A.: Combinatorial particle swarm optimization (CPSO) for partitional clustering problem. Applied Mathematics and Computation 192(2), 337–345 (2007)
Liu, Y.G., Zhang, Y., Wu, H., Mao, Y., Chen, K.F.: A tabu search approach for the minimum sum-of-squares clustering problem. Information Sciences 178, 2680–2704 (2008)
Hopfield, J.J., Tank, D.W.: “neural” computation of decisions in optimization problems. Bio. Cybern. (52), 142–152 (1985)
Galán-Marín, G., Mérida-Casermeiro, E., Muñoz-Pérez, J.: Modelling competitive Hopfield networks for the maximum clique problem. Computer & Operations Research 30(4), 603–624 (2003)
Merz, C., Murphy, P., Aha, D.: UCI repository of machine learning databases. Department of Information and Computer Science, University of California, Irvine (1997), http://mlearn.ics.uci.edu/MLRepository.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuang, Z., Bi, W., Wang, J. (2008). Competitive Hopfield Neural Network with Periodic Stochastic Dynamics for Partitional Clustering. In: Kang, L., Cai, Z., Yan, X., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2008. Lecture Notes in Computer Science, vol 5370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92137-0_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-92137-0_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92136-3
Online ISBN: 978-3-540-92137-0
eBook Packages: Computer ScienceComputer Science (R0)