Abstract
In this paper, a clustering algorithm based on emotional preference and migratory behavior (EPMC) is proposed for data clustering. The algorithm consists of four models: the migration model, the emotional preference model, the social group model and the inertial learning model. First, the migration model calculates the probability of individuals being learned, so that individuals can learn from the superior. Second, the emotional preference model is introduced to help individuals find the most suitable neighbor for learning. Third, the social group model divides the whole population into different groups and enhances the mutual cooperation between individuals under different conditions. Finally, the inertial learning model balances the exploration and exploitation during the optimization, so that the algorithm can avoid falling into the local optimal solution. In addition, the convergence of EPMC algorithm is verified by theoretical analysis, and the algorithm is compared with four clustering algorithms. Experimental results validate the effectiveness of EPMC algorithm.
Similar content being viewed by others
References
Ali Mohamed Salamh ES (2016) Implementation of flower pollination algorithm for solving economic load dispatch and combined economic emission dispatch problems in power systems. Energy 101:506–518
Bharill N, Tiwari A, Malviya A (2016) Fuzzy based scalable clustering algorithms for handling big data using apache spark. IEEE Trans Big Data PP(99):1–1
Cai Q, Gong M, Ma L, Ruan S, Yuan F, Jiao L (2015) Greedy discrete particle swarm optimization for large-scale social network clustering. Inf Sci Int J 316(C):503–516
Cao X, Wei X, Han Y, Lin D (2015) Robust face clustering via tensor decomposition. IEEE Trans Cybern 45(11):2546
Chitara D, Niazi KR, Swarnkar A, Gupta N (2018) Cuckoo search optimization algorithm for designing of a multimachine power system stabilizer. IEEE Trans Ind Appl 54(4):1–1
Črepinšek M, Liu S-H, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv (CSUR) 45(3):35
Cuevas E, Cienfuegos M (2014) A new algorithm inspired in the behavior of the social-spider for constrained optimization. Expert Syst Appl 41(2):412–425
Deng W, Zhao H, Liu J, Yan X, Li Y, Yin L, Ding C (2015) An improved caco algorithm based on adaptive method and multi-variant strategies. Soft Comput 19(3):701–713
Deng W, Zhao H, Zou L, Li G, Yang X, Daqing W (2017a) A novel collaborative optimization algorithm in solving complex optimization problems. Soft Comput 21(15):4387–4398
Deng W, Yao R, Zhao H, Yang X, Li G (2017b) A novel intelligent diagnosis method using optimal LS-SVM with improved PSO algorithm. Soft Comput 2(C4):1–18
Deng W, Zhao H, Yang X, Xiong J, Sun M, Li B (2017c) Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment. Appl Soft Comput 59:S1568494617303472
Dowlatshahi MB, Nezamabadi-Pour H (2014) GGSA: a grouping gravitational search algorithm for data clustering. Eng Appl Artif Intell 36:114–121
Eriksson L, Trygg J, Wold S (2010) PLS-trees, a top-down clustering approach. J Chemom 23(11):569–580
Esmin AAA, Coelho RA, Matwin S (2015) A review on particle swarm optimization algorithm and its variants to clustering high-dimensional data. Kluwer Academic Publishers, Dordrecht
Feng X, Wang Y, Yu H, Luo F (2017) A novel intelligence algorithm based on the social group optimization behaviors. IEEE Trans Syst Man Cybern Syst PP(99):1–12
Gang K, Yi P, Wang G (2014) Evaluation of clustering algorithms for financial risk analysis using MCDM methods. Inf Sci 275(11):1–12
İnkaya T, Kayalıgil S, Özdemirel NE (2015) Ant colony optimization based clustering methodology. Appl Soft Comput 28:301–311
Jin W, Cao J, Li B, Lee S, Simon Sherratt R (2016) Bio-inspired ant colony optimization based clustering algorithm with mobile sinks for applications in consumer home automation networks. IEEE Trans Consum Electron 61(4):438–444
Karaboga D, Ozturk C (2011) A novel clustering approach: artificial bee colony (ABC) algorithm. Appl Soft Comput 11(1):652–657
Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Read Comput Vis 220(4598):606–615
Kou G, Peng Y, Wang G (2014) Evaluation of clustering algorithms for financial risk analysis using MCDM methods. Inf Sci 275(11):1–12
Labbi Y, Attous DB, Gabbar HA, Mahdad B, Zidan A (2016) A new rooted tree optimization algorithm for economic dispatch with valve-point effect. Int J Electr Power Energy Syst 79:298–311
Li M, Stathaki T (2008) Spatial kernel k-harmonic means clustering for multi-spectral image segmentation. IET Image Proc 1(2):156–167
Li X, Zhang J, Yin M (2014) Animal migration optimization: an optimization algorithm inspired by animal migration behavior. Neural Comput Appl 24(7–8):1867–1877
Liu CY, Yan XH, Wu H (2011) The wolf colony algorithm and its application. Chin J Electron 20(2):212–216
Liu W, Wang Z, Liu X, Zeng N, Bell D (2018) A novel particle swarm optimization approach for patient clustering from emergency departments. IEEE Trans Evol Comput PP:1–1
MacArthur RH, Wilson EO (1967) The theory of island biogeography, vol 1. Princeton Univ. Press, Princeton
Maghsoudlou H, Afshar-Nadjafi B, Niaki STA (2016) A multi-objective invasive weeds optimization algorithm for solving multi-skill multi-mode resource constrained project scheduling problem. Comput Chem Eng 88(C):157–169
Merrikh-Bayat F (2015) The runner-root algorithm: a metaheuristic for solving unimodal and multimodal optimization problems inspired by runners and roots of plants in nature. Appl Soft Comput 33:292–303
Paterlini S, Krink T (2004) High performance clustering with differential evolution. In: Congress on Evolutionary Computation, 2004. CEC2004, vol 2, pp 2004–2011
Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization. Swarm Intell 1(1):33–57
Ryosuke A, Miyamoto S, Yasunori E, Yukihiro H (2017) Hierarchical clustering algorithms with automatic estimation of the number of clusters. In: Fuzzy systems association and international conference on soft computing and intelligent systems, pp 1–5
Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702–713
Soliman OS, Saleh DA, Rashwan S (2012) A bio inspired fuzzy k-modes clustering algorithm. In: The international conference neural information processing
Tan P-N, Steinbach M, Kumar V (2016) Introduction to data mining. Data Anal Cloud 22(6):1–25
Vijaya PA, Narasimha Murty M, Subramanian DK (2006) Efficient bottom-up hybrid hierarchical clustering techniques for protein sequence classification. Pattern Recognit 39(12):2344–2355
Wang R, Purshouse RC, Fleming PJ (2013) Preference-inspired coevolutionary algorithms for many-objective optimization. IEEE Trans Evol Comput 17(4):474–494
Wang HB, Fan CC, Tu XY (2016) AFSAOCP: a novel artificial fish swarm optimization algorithm aided by ocean current power. Appl Intell 45(4):1–16
Wen X, Chen WN, Ying L, Gu T, Zhang J (2017) A maximal clique based multiobjective evolutionary algorithm for overlapping community detection. IEEE Trans Evol Comput 21(3):363–377
Wong KF (2002) A genetic algorithm-based clustering approach for database partitioning. IEEE Trans Syst Man Cybern Part C 32(3):215–230
Xiang F, Lau FCM, Yu H (2013) A novel bio-inspired approach based on the behavior of mosquitoes. Inf Sci 233(2):87–108
Xu R, Wunsch D (2005) Survey of clustering algorithms. IEEE Trans Neural Netw 16(3):645–678
Yang Q, Chen WN, Gu T, Zhang H, Deng JD, Li Y, Zhang J (2017) Segment-based predominant learning swarm optimizer for large-scale optimization. IEEE Trans Cybern 47(9):2896–2910
Yin X, Chen S, Hu E (2013) Regularized soft K-means for discriminant analysis. Neurocomputing 103:29–42
Zadegan SMR, Mirzaie M, Sadoughi F (2013) Ranked k-medoids: a fast and accurate rank-based partitioning algorithm for clustering large datasets. Knowl-Based Syst 39(2):133–143
Zhang Y, Hepner GF (2017) The dynamic-time-warping-based k-means++ clustering and its application in phenoregion delineation. Int J Remote Sens 38(6):1720–1736
Zhang XY, Zhang J, Gong Y-J, Zhan Z-H, Chen WN, Li Y (2016a) Kuhn-munkres parallel genetic algorithm for the set cover problem and its application to large-scale wireless sensor networks. IEEE Trans Evol Comput 20(5):695–710
Zhang L, Lu W, Liu X, Pedrycz W, Zhong C (2016b) Fuzzy c-means clustering of incomplete data based on probabilistic information granules of missing values. Knowl Based Syst 99(C):51–70
Zhang Y, Song XF, Gong DW (2017) A return-cost-based binary firefly algorithm for feature selection. Inf Sci 418:561–574
Zhou Y, Wang Y, Chen X, Zhang L, Kan W (2017) A novel path planning algorithm based on plant growth mechanism. Soft Comput Fusion Found Methodol Appl 21(2):435–445
Acknowledgements
This work was supported in part by the National Natural Science Foundation of China under Grant Nos. 61772200, 61772201 and 61602175, the Information Development Special Funds of Shanghai Economic and Information Commission under Grant No. 201602008.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors. Informed consent was obtained from all individual participants included in the study.
Informed consent
Informed consent was obtained from all individual participants included in the study.
Additional information
Communicated by V. Loia.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Feng, X., Zhong, D. & Yu, H. A clustering algorithm based on emotional preference and migratory behavior. Soft Comput 24, 7163–7179 (2020). https://doi.org/10.1007/s00500-019-04333-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-019-04333-4