Abstract
This paper proposes a new clustering algorithm which employs an improved stochastic competitive Hopfield network in order to organize data patterns into natural groups, or clusters, in an unsupervised manner. This Hopfield network uses an entropy based energy function to overcome the problem of insufficient understanding of the data and to obtain the optimal parameters for clustering. Additionally, a chaotic variable is introduced in order to escape from the local minima and gain a better clustering. By minimizing the entropy of each cluster using Hopfield network, we achieve a superior accuracy to that of the best existing algorithms such as optimal competitive Hopfield model, stochastic optimal competitive Hopfield network, k-means and genetic algorithm. The experimental results demonstrate the scalability and robustness of our algorithm over large datasets.
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
McQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297 (1967).
Bezdek, J. C., Ehrlich, R., & Full, W.: Fcm: The fuzzy c-means clustering algorithm. J. Computers & Geosciences, 10 (2-3), pp. 191–203 (1984).
Sarafis, I., Zalzala, A. M., Trinder, P. W.: A genetic rule-based data clustering toolkit. In: Proceedings of the Evolutionary Computation (CEC '02), pp. 1238-1243. IEEE Computer Society, Washington, DC (2002).
Barbara, D., Couto, J., Li, Y.: COOLCAT An entropy based algorithm for categorical clustering. In: Proceedings of the eleventh international conference on Information and knowledge management. ACM Press (2002).
Galán-Marín, G., Mérida-Casermeiro, E., and Muñoz-Pérez.: Modeling competitive Hopfield networks for the maximum clique problem. J. Comput. Oper. Res. 30, pp. 603–624 (2003).
Wang, J. and Zhou, Y.: Stochastic optimal competitive Hopfield network for partitional clustering. J. Expert Syst. Appl. 36, pp. 2072–2080 (2009).
Azamimi, A., Uwate, Y., Nishio, Y.: An Improvement in Pattern Recognition Problem Using Chaotic BP Learning Algorithm. In: Proceedings of RISP International Workshop on Nonlinear Circuits and Signal Processing, pp. 213–216 (2009).
Krink, T., Paterlini, S.: Differential Evolution and Particle Swarm Optimization in Partitional Clustering. J. Computational Statistics and Data Analysis. 50, pp. 1220–1247 (2006).
Jarboui, B., Cheikh, M., Siarry, P., & Rebai, A.: Combinatorial particle swarm optimization (CPSO) for partitional clustering problem. J. Applied Mathematics and Computation. 192(2), pp. 337–345 (2007).
Frank, A. & Asuncion, A. (2010). UCI Machine Learning Repository [http://archive.ics.uci.edu/ml]. Irvine, CA: University of California, School of Information and Computer Science.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this paper
Cite this paper
Abrishami, V., Sabzevari, M., Yaghobi, M. (2011). A New Approach for Partitional Clustering Using Entropy Notation and Hopfield Network. In: Bramer, M., Petridis, M., Hopgood, A. (eds) Research and Development in Intelligent Systems XXVII. SGAI 2010. Springer, London. https://doi.org/10.1007/978-0-85729-130-1_11
Download citation
DOI: https://doi.org/10.1007/978-0-85729-130-1_11
Published:
Publisher Name: Springer, London
Print ISBN: 978-0-85729-129-5
Online ISBN: 978-0-85729-130-1
eBook Packages: Computer ScienceComputer Science (R0)