Competitive Hopfield Neural Network with Periodic Stochastic Dynamics for Partitional Clustering

Authors:
Zhanghui Kuang;Wei Bi;Jiahai Wang
Affiliations:
Department of Computer Science, Sun Yat-sen University, Guangzhou, PR China 510275;Department of Computer Science, Sun Yat-sen University, Guangzhou, PR China 510275;Department of Computer Science, Sun Yat-sen University, Guangzhou, PR China 510275
Venue:
ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
Year:
2008

Citing 5
Cited 0

Data clustering: a review

ACM Computing Surveys (CSUR)
Modelling competitive Hopfield networks for the maximum clique problem

Computers and Operations Research
A tabu search approach for the minimum sum-of-squares clustering problem

Information Sciences: an International Journal
Differential evolution and particle swarm optimisation in partitional clustering

Computational Statistics & Data Analysis
Genetic K-means algorithm

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

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.