Abstract
Data clustering, the process of grouping similar objects in a set of observations is one of the attractive and main tasks in data mining that is used in many areas and applications such as text clustering and information retrieval, data compaction, fraud detection, biology, computer vision, data summarization, marketing and customer analysis, etc. The well-known k-means algorithm, which widely applied to the clustering problem, has the drawbacks of depending on the initial state of centroids and may converge to the local optima rather than global optima. A data clustering algorithm based on the gravitational search algorithm (GSA) is proposed in this research. In this algorithm, some candidate solutions for clustering problem are created randomly and then interact with one another via Newton’s gravity law to search the problem space. The performance of the presented algorithm is compared with three other well-known clustering algorithms, including k-means, genetic algorithm (GA), and particle swarm optimization algorithm (PSO) on four real and standard datasets. Experimental results confirm that the GSA is a robust and viable method for data clustering.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Tan, P.-N., Steinbach, M., Kumar, V.: Introduction To Data Mining. Addison Wesley, Reading (2005)
Forgy, E.W.: Cluster analysis of multivariate data: efficiency versus interpretability of classifications. Biometrics 21, 2 (1965)
Kaufman, L., Rousseeuw, P.J.: Finding groups in data: An introduction to cluster analysis. John Wiley & Sons, New York (1990)
Ching-Yi, C., Fun, Y.: Particle swarm optimization algorithm and its application to clustering analysis. In: 2004 IEEE International Conference on Networking, Sensing and Control, vol. 2, 782, pp. 789–794 (2004)
Kao, Y.-T., Zahara, E., Kao, I.W.: A hybridized approach to data clustering. Expert Systems with Applications 34, 1754–1762 (2008)
Selim, S.Z., Ismail, M.A.: K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality, IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-6, 81–87 (1984)
Selim, S.Z., Alsultan, K.: A simulated annealing algorithm for the clustering problem. Pattern Recognition 24, 1003–1008 (1991)
Al-Sultan, K.S.: A Tabu search approach to the clustering problem. Pattern Recognition 28, 1443–1451 (1995)
Maulik, U., Bandyopadhyay, S.: Genetic algorithm-based clustering technique. Pattern Recognition 33, 1455–1465 (2000)
Shelokar, P.S., Jayaraman, V.K., Kulkarni, B.D.: An ant colony approach for clustering. Analytica Chimica Acta 509, 187–195 (2004)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4, 1944, pp. 1942–1948 (1995)
Jin, P., Zhu, Y.L., Hu, K.Y.: A clustering algorithm for data mining based on swarm intelligence. In: Proceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007, vol. 2, pp. 803–807 (2007)
Fathian, M., Amiri, B., Maroosi, A.: Application of honey-bee mating optimization algorithm on clustering. Applied Mathematics and Computation 190, 1502–1513 (2007)
Karaboga, D., Ozturk, C.: A novel clustering approach: Artificial Bee Colony (ABC) algorithm. Applied Soft Computing 11, 652–657
Rashedi, E., Nezamabadi-pour, H., Saryazdi, S.: GSA: A Gravitational Search Algorithm. dgd 179, 2232–2248 (2009)
Güngör, Z., Ünler, A.: K-harmonic means data clustering with simulated annealing heuristic. Applied Mathematics and Computation 184, 199–209 (2007)
Uci repository of machine learning databases, http://www.ics.uci.edu/~mlearn/mlrepository.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hatamlou, A., Abdullah, S., Nezamabadi-pour, H. (2011). Application of Gravitational Search Algorithm on Data Clustering. In: Yao, J., Ramanna, S., Wang, G., Suraj, Z. (eds) Rough Sets and Knowledge Technology. RSKT 2011. Lecture Notes in Computer Science(), vol 6954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24425-4_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-24425-4_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24424-7
Online ISBN: 978-3-642-24425-4
eBook Packages: Computer ScienceComputer Science (R0)