Abstract
This study proposes an improved differential evolution (DE) algorithm to solve an automatic clustering problem. Automatic clustering is a clustering technique in data mining which can automatically define the best number of clusters, as well as construct those clusters. In order to overcome the weakness of the DE algorithm for automatic clustering, some improvement scenarios are proposed. They include the best solution effect, saturated solution, acceleration and handling downhill scenarios. The best solution effect and acceleration factor are proposed to boost the convergence of the DE algorithm. The saturated solution helps the algorithm maintain the diversity of the population. The handling downhill scenario allows chromosomes to move to a worse solution, since it might later lead to a better solution. The proposed algorithm is evaluated using four well-known datasets. The computational results indicate that the proposed improvements can enhance the DE algorithm’s performance. In addition, the proposed method is also applied to cluster customers for a ladies’ office wear clothing franchise. The results can be used to plan a marketing strategy for the case company.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Awad NH, Ali MZ, Mallipeddi R, Suganthan PN (2018) An improved differential evolution algorithm using efficient adapted surrogate model for numerical optimization. Inf Sci 451–452:326–347. https://doi.org/10.1016/j.ins.2018.04.024
Bult JR, Wansbeek T (1995) Optimal selection for direct mail. Mark Sci 14:378–394
Chang D-X, Zhang X-D, Zheng C-W, Zhang D-M (2010) A robust dynamic niching genetic algorithm with niche migration for automatic clustering problem. Pattern Recogn 43:1346–1360. https://doi.org/10.1016/j.patcog.2009.10.020
Chiou J-P, Wang F-S (1998) A hybrid method of differential evolution with application to optimal control problems of a bioprocess system. In: The 1998 IEEE international conference on evolutionary computation proceedings. IEEE world congress on computational intelligence, 4–9 May 1998, pp 627–632. https://doi.org/10.1109/icec.1998.700101
Das S, Abraham A, Konar A (2008) Automatic clustering using an improved differential evolution algorithm systems. IEEE Trans Man Cybern Part A Syst Hum 38:218–237. https://doi.org/10.1109/tsmca.2007.909595
Das S, Chowdhury A, Abraham A (2009) A bacterial evolutionary algorithm for automatic data clustering. Paper presented at the proceedings of the eleventh conference on congress on evolutionary computation, Trondheim, Norway
Gautam Garai BBC (2004) A novel genetic algorithm for automatic clustering. Pattern Recogn Lett 25:173–187
Hao Z-F, Guo G-H, Huang H (2007) A particle swarm optimization algorithm with differential evolution. In: 2007 international conference on machine learning and cybernetics, 19–22 Aug 2007, pp 1031–1035. https://doi.org/10.1109/icmlc.2007.4370294
Ho-Huu V, Nguyen-Thoi T, Truong-Khac T, Le-Anh L, Vo-Duy T (2018) An improved differential evolution based on roulette wheel selection for shape and size optimization of truss structures with frequency constraints. Neural Comput Appl 29:167–185. https://doi.org/10.1007/s00521-016-2426-1
Jain AK (2010) Data clustering: 50 years beyond K-means. Pattern Recogn Lett 31:651–666. https://doi.org/10.1016/j.patrec.2009.09.011
Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680
Kuo RJ, Zulvia FE (2018) Automatic clustering using an improved artificial bee colony optimization for customer segmentation. Knowl Inf Syst. https://doi.org/10.1007/s10115-018-1162-5
Kuo RJ, Liao JL, Tu C (2005) Integration of ART2 neural network and genetic K-means algorithm for analyzing web browsing path in electronic commerce. Decis Support Syst 40:355–374
Kuo RJ, Syu YJ, Chen Z-Y, Tien FC (2012a) Integration of particle swarm optimization and genetic algorithm for dynamic clustering. Inf Sci 195:124–140. https://doi.org/10.1016/j.ins.2012.01.021
Kuo RJ, Syu YJ, Chen ZY, Tien FC (2012b) Integration of particle swarm optimization and genetic algorithm for dynamic clustering. Inf Sci 39:124–140
Liu Y, Wu X, Shen Y (2011) Automatic clustering using genetic algorithms. Appl Math Comput 218:1267–1279
Murthy CA, Chowdhury N (1996) In search of optimal clusters using genetic algorithms. Pattern Recogn Lett 17:825–832. https://doi.org/10.1016/0167-8655(96)00043-8
Pan S-M, Cheng K-S (2007) Evolution-based tabu search approach to automatic clustering systems. IEEE Trans Man Cybern Part C Appl Rev 37:827–838. https://doi.org/10.1109/tsmcc.2007.900666
Paterlini S, Krink T (2006) Differential evolution and particle swarm optimisation in partitional clustering. Comput Stat Data Anal 50:1220–1247. https://doi.org/10.1016/j.csda.2004.12.004
Price KV, Stron RM, Lampinen JA (2005) Differential evolution. A practical approach to global optimization. Springer, Berlin
Sanghamitra Bandyopadhyay UM (2002) Genetic clustering for automatic evolution of cluster and application to image classification. Pattern Recogn 35:1197–1208
Song L, Dong Y (2018) An improved differential evolution algorithm with local search for capacitated vehicle routing problem. In: 2018 tenth international conference on advanced computational intelligence (ICACI), 29–31 March 2018, pp 801–806. https://doi.org/10.1109/icaci.2018.8377563
Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341–359. https://doi.org/10.1023/a:1008202821328
Swagatam Das AA, Konar A (2008) Automatic clustering using improved differential evolution algorithm. IEEE Trans Syst Man Cybern Part A 38(1):218–237
Tan P-N, Steinbach M, Kumar V (2006) Introduction to data mining. Pearson Education, Inc., Boston
Tian M, Gao X, Dai C (2017) Differential evolution with improved individual-based parameter setting and selection strategy. Appl Soft Comput 56:286–297. https://doi.org/10.1016/j.asoc.2017.03.010
Turi RH (2001) Clustering-based colour image segmentation. Monash
Yasid A (2014) A two-stage automatic cluster analysis using differential evolution algorithm and K-means algorithm. National Taiwan University of Science and Technology
Acknowledgements
This study is partially supported by the Ministry of Science and Technology of the Taiwanese Government under Contract NSC102-2221-E-011-146-MY3. This support is much appreciated. In addition, the assistance of the case company in providing the experiment data is also greatly appreciated.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
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
Kuo, R.J., Zulvia, F.E. An improved differential evolution with cluster decomposition algorithm for automatic clustering. Soft Comput 23, 8957–8973 (2019). https://doi.org/10.1007/s00500-018-3496-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-018-3496-z