Abstract
The K-harmonic means is a center based clustering algorithm, which is suffering from falling into local optima easily. To solve this problem, a hybrid K-harmonic means algorithm using enhanced firefly algorithm is proposed. Combining with parallel chaotic optimization, a novel chaotic local search method which has the capability of full dimensional and part dimensional searching is used to enhance the original firefly algorithm. Then this enhanced version of firefly algorithm is integrated into K-harmonic means algorithm to take full advantage of merits of both algorithms. The proposed method is compared with KHM and other two hybrid algorithms on four data sets, and the experiment results show the superiority of it that can escape from local optima effectively.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Jain, A.K.: Data clustering: 50 years beyond K-means. PRL 31(8), 651–666 (2010)
Zhang B, Meichun Hsu, Umeshwar Dayal.: K-Harmonic Means-a Data Clustering Algorithm. Technical report HPL-1999-124, Hewlett-Packard Labs (1999)
Hamerly G, Elkan C.: Alternatives to the k-means algorithm that find better clusterings. In: Proceedings of the Eleventh International Conference on Information and knowledge Management, ACM, 600–607(2002)
Güngör, Z., Ünler, A.: K-harmonic means data clustering with simulated annealing heuristic. Appl. Math. Comput. 184(2), 199–209 (2007)
Güngör, Z., Ünler, A.: K-Harmonic means data clustering with tabu-search method. Appl. Math. Model. 32(6), 1115–1125 (2008)
Yang, F.Q., Sun, T.E.L., Zhang, C.H.: An efficient hybrid data clustering method based on K-harmonic means and Particle Swarm Optimization. Expert Syst. Appl. 36(6), 9847–9852 (2009)
Jiang, H., Yi, S., Li, J., et al.: Ant clustering algorithm with K-harmonic means clustering. Expert Syst. Appl. 37(12), 8679–8684 (2010)
Alguwaizani, A., Hansen, P., Mladenović, N., et al.: Variable neighborhood search for harmonic means clustering. Appl. Math. Model. 35(6), 2688–2694 (2011)
Yin, M., Hu, Y., Yang, F., et al.: A novel hybrid K-harmonic means and gravitational search algorithm approach for clustering. Expert Syst. Appl. 38(8), 9319–9324 (2011)
Hung, C.-H., Chiou, H.-M., Yang, W.-N.: Candidate groups search for K-harmonic means data clustering. Appl. Math. Model. 37(24), 10123–10128 (2013)
Abdeyazdan, M.: Data clustering based on hybrid K-harmonic means and modifier imperialist competitive algorithm. J. Supercomput. 68(2), 574–598 (2014)
Yang, X.-S.: Nature-Inspired Metaheuristic Algorithms. Luniver press, Bristol (2010)
Senthilnath, J., Omkar, S., Mani, V.: Clustering using firefly algorithm: performance study. Swarm Evol. Comput. 1(3), 164–171 (2011)
Adaniya, M.H.: Anomaly detection using met heuristic firefly harmonic clustering. J. Netw. 8(1), 82–91 (2013)
Yuan, X., Zhao, J., Yang, Y., et al.: Hybrid parallel chaos optimization algorithm with harmony search algorithm. Appl. Soft Comput. 17, 12–22 (2014)
He, Y., Yang, S., Xu, Q.: Short-term cascaded hydroelectric system scheduling based on chaotic particle swarm optimization using improved logistic map. Commun. Nonlinear Sci. Numer. Simul. 18(7), 1746–1756 (2013)
He, Y., Xu, Q., Yang, S., et al.: A novel chaotic differential evolution algorithm for short-term cascaded hydroelectric system scheduling. Int. J. Electr. Power Energy Syst. 61, 455–462 (2014)
Acknowledgment
This research was supported by the Cooperative Industry-Academy-Research Innovation Foundation of Jiangsu Province (BY2013015-33).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhou, Z., Zhu, S., Zhang, D. (2015). A Novel K-harmonic Means Clustering Based on Enhanced Firefly Algorithm. In: He, X., et al. Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques. IScIDE 2015. Lecture Notes in Computer Science(), vol 9243. Springer, Cham. https://doi.org/10.1007/978-3-319-23862-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-23862-3_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23861-6
Online ISBN: 978-3-319-23862-3
eBook Packages: Computer ScienceComputer Science (R0)