Abstract
Because most traditional search methods are unable to satisfy the current needs of data mining, finding a high performance search method for data mining has gradually become a critical issue. The spiral optimization (SO) is a promising search algorithm designed to emulate the natural phenomena, such as swirl and low pressure, to find the solutions of optimization problems within an acceptable computation time. In this paper, a novel SO is presented to solve the clustering problem. Unlike the original SO, which rotates the points around the elitist center iteratively, the proposed algorithm, called distributed spiral optimization (dSO), splits the population into several subpopulations so as to increase the diversity of search to further improve the clustering result. The k-means and oscillation methods are also used to enhance the efficacy of dSO. To evaluate the performance of the proposed algorithm, we apply it to the clustering problem and compare the results it found with those of the spiral optimization and genetic k-means algorithm. The results show that the proposed algorithm is quite promising.
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.
Similar content being viewed by others
References
Welch: Algorithmic complexity: Three NP-hard problems in computational statistics. Computation and Simulation (1982)
Xu, W., Liu, X., Gong, Y.: Document clustering based on non-negative matrix factorization. In: Proceedings of the Annual International ACM SIGIR Conference on Research and Development in Informaion Retrieval, pp. 267–273 (2003)
Zhao, W., Chellappa, R., Rosenfeld, A., Phillips, P.J.: Face recognition: A literature survey. ACM Computing Surveys, 399–458 (2000)
Watada, J., Yamashiro, K.: A data mining approach to consumer behavior. In: Proceedings of the International Conference on Innovative Computing, Information and Control, pp. 652–655 (2006)
Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: Harmony search. Simulation, 60–68 (2001)
Karaboga, D.: An idea based on Honey Bee Swarm for Numerical Optimization. Erciyes University, Tech. Rep. (2005)
Yang, X.-S.: Firefly algorithms for multimodal optimization. In: Watanabe, O., Zeugmann, T. (eds.) SAGA 2009. LNCS, vol. 5792, pp. 169–178. Springer, Heidelberg (2009)
Tamura, K., Yasuda, K.: Spiral multipoint search for global optimization. In: International Conference on Machine Learning and Applications, vol. 1, pp. 470–475 (2011)
Bandyopadhyay, S., Maulik, U.: An evolutionary technique based on k-means algorithm for optimal clustering in rn. Information Sciences, 221–237 (2002)
Krishna, K., Narasimha Murty, M.: Genetic k-means algorithm. IEEE Transactions on Systems, Man, and Cybernetics 29, 433–439 (1999)
UCI-machine learning repository, http://archive.ics.uci.edu/ml/
Ward, J.H.: Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 236–244 (1963)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsai, CW., Huang, BC., Chiang, MC. (2014). A Novel Spiral Optimization for Clustering. In: Park, J., Adeli, H., Park, N., Woungang, I. (eds) Mobile, Ubiquitous, and Intelligent Computing. Lecture Notes in Electrical Engineering, vol 274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40675-1_92
Download citation
DOI: https://doi.org/10.1007/978-3-642-40675-1_92
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40674-4
Online ISBN: 978-3-642-40675-1
eBook Packages: EngineeringEngineering (R0)