Abstract
The Big Bang–Big Crunch (BB–BC) algorithm is a new optimization method that is based on one of the theories of the evolution of the universe namely the Big Bang and Big Crunch theory. According to this method, in the Big Bang phase some candidate solutions to the optimization problem are randomly generated and spread all over the search space. In the Big Crunch phase, randomly distributed candidate solutions are drawn into a single representative point via a center of population or minimal cost approach. This paper presents BB-BC based novel approach for data clustering. The simulation results indicate the applicability and potential of this algorithm on data clustering.
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
Erol, O.K., Eksin, I.: A new optimization method: Big Bang-Big Crunch. Advances in Engineering Software 37, 106–111 (2006)
Kaveh, A., Talatahari, S.: Optimal design of Schwedler and ribbed domes via hybrid Big Bang-Big Crunch algorithm. Journal of Constructional Steel Research 66, 412–419
Kaveh, A., Talatahari, S.: Size optimization of space trusses using Big Bang-Big Crunch algorithm. Computers & Structures 87, 1129–1140 (2009)
Kumbasar, T., Eksin, I., Guzelkaya, M., Yesil, E.: Adaptive fuzzy model based inverse controller design using BB-BC optimization algorithm. Expert Systems with Applications (2011)
Tang, H., Zhou, J., Xue, S., Xie, L.: Big Bang-Big Crunch optimization for parameter estimation in structural systems. Mechanical Systems and Signal Processing 24, 2888–2897
Han, J.: Data Mining: Concepts and Techniques. Academic Press (2001)
Fan, J., Han, M., Wang, J.: Single point iterative weighted fuzzy C-means clustering algorithm for remote sensing image segmentation. Pattern Recognition 42, 2527–2540 (2009)
Kerr, G., Ruskin, H.J., Crane, M., Doolan, P.: Techniques for clustering gene expression data. Computers in Biology and Medicine 38, 283–293 (2008)
Kim, K.-J., Ahn, H.: A recommender system using GA K-means clustering in an online shopping market. Expert Systems with Applications 34, 1200–1209 (2008)
Liao, L., Lin, T., Li, B.: MRI brain image segmentation and bias field correction based on fast spatially constrained kernel clustering approach. Pattern Recognition Letters 29, 1580–1588 (2008)
Mahdavi, M., Chehreghani, M.H., Abolhassani, H., Forsati, R.: Novel meta-heuristic algorithms for clustering web documents. Applied Mathematics and Computation 201, 441–451 (2008)
Moshtaghi, M., Havens, T.C., Bezdek, J.C., Park, L., Leckie, C., Rajasegarar, S., Keller, J.M., Palaniswami, M.: Clustering ellipses for anomaly detection. Pattern Recognition 44, 55–69 (2011)
Blake, C.L.: UCI repository of machine learning databases, http://www.ics.uci.edu/-mlearn/MLRepository.html
Forgy, E.W.: Cluster analysis of multivariate data: efficiency versus interpretability of classifications. Biometrics 21, 2 (1965)
Cowgill, M.C., Harvey, R.J., Watson, L.T.: A genetic algorithm approach to cluster analysis. Computers & Mathematics with Applications 37, 99–108 (1999)
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)
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., Hatamlou, M. (2011). Data Clustering Using Big Bang–Big Crunch Algorithm. In: Pichappan, P., Ahmadi, H., Ariwa, E. (eds) Innovative Computing Technology. INCT 2011. Communications in Computer and Information Science, vol 241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27337-7_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-27337-7_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27336-0
Online ISBN: 978-3-642-27337-7
eBook Packages: Computer ScienceComputer Science (R0)