A novel hybrid clustering approach based on K-harmonic means using robust design

The K-harmonic means (KHM) algorithm has been proposed for solving the initialization problem of K-means recently. However, the KHM still suffers from being trapped into local optima. In order to solve this problem, this paper presents a novel hybrid algorithm named RMSSOKHM based on KHM and a modified simplified swarm optimization. The proposed RMSSOKHM adopts the rapid centralized strategy (RCS) to increase the convergence speed and the minimum movement strategy (MMS) to effectively and efficiently search better solutions without trapping in local optima. In addition, the parameter settings of the proposed approach were optimized by using the Taguchi method. The performance of the proposed RMSSOKHM was examined and compared with the existing-known methods using eight benchmark datasets. The experimental results indicated that the proposed RMSSOKHM is superior to its competitors in terms of the quality of solutions and the efficiency of performance.

[1]  Harun Resit Yazgan,et al.  Genetic algorithm parameter optimisation using Taguchi method for a flexible manufacturing system scheduling problem , 2015 .

[2]  Manoj Kumar Tiwari,et al.  A Hybrid Taguchi-Immune approach to optimize an integrated supply chain design problem with multiple shipping , 2010, Eur. J. Oper. Res..

[3]  Jing Li,et al.  Ant clustering algorithm with K-harmonic means clustering , 2010, Expert Syst. Appl..

[4]  Gillian Dobbie,et al.  Research on particle swarm optimization based clustering: A systematic review of literature and techniques , 2014, Swarm Evol. Comput..

[5]  Umeshwar Dayal,et al.  K-Harmonic Means - A Data Clustering Algorithm , 1999 .

[6]  Angelo Dalli Adaptation of the F-measure to Cluster Based Lexicon Quality Evaluation , 2003 .

[7]  Ujjwal Maulik,et al.  An evolutionary technique based on K-Means algorithm for optimal clustering in RN , 2002, Inf. Sci..

[8]  Mostafa Zandieh,et al.  Scheduling the truck holdover recurrent dock cross-dock problem using robust meta-heuristics , 2010 .

[9]  Wei-Chang Yeh,et al.  A two-stage discrete particle swarm optimization for the problem of multiple multi-level redundancy allocation in series systems , 2009, Expert Syst. Appl..

[10]  Janez Demsar,et al.  Statistical Comparisons of Classifiers over Multiple Data Sets , 2006, J. Mach. Learn. Res..

[11]  Maghsud Solimanpur,et al.  Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing , 2013, Math. Comput. Model..

[12]  Bor-Wen Cheng,et al.  A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm , 2007, Expert Syst. Appl..

[13]  Lei Zhang,et al.  A novel ant-based clustering algorithm using the kernel method , 2011, Inf. Sci..

[14]  Noorhaniza Wahid,et al.  A hybrid network intrusion detection system using simplified swarm optimization (SSO) , 2012, Appl. Soft Comput..

[15]  Xiangtao Li,et al.  A novel hybrid K-harmonic means and gravitational search algorithm approach for clustering , 2011, Expert Syst. Appl..

[16]  Tung-Kuan Liu,et al.  Tuning the structure and parameters of a neural network by using hybrid Taguchi-genetic algorithm , 2006, IEEE Trans. Neural Networks.

[17]  Greg Hamerly,et al.  Alternatives to the k-means algorithm that find better clusterings , 2002, CIKM '02.

[18]  C. Wang,et al.  Optimizing multiple quality characteristics via Taguchi method-based Grey analysis , 2007 .

[19]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.

[20]  Ali Riza Yildiz,et al.  A new design optimization framework based on immune algorithm and Taguchi's method , 2009, Comput. Ind..

[21]  Tieli Sun,et al.  An efficient hybrid data clustering method based on K-harmonic means and Particle Swarm Optimization , 2009, Expert Syst. Appl..

[22]  Peter Willett,et al.  Recent trends in hierarchic document clustering: A critical review , 1988, Inf. Process. Manag..

[23]  R. Sridharan,et al.  Taguchi method for parameter design in ACO algorithm for distribution–allocation in a two-stage supply chain , 2013 .

[24]  田口 玄一,et al.  Introduction to quality engineering : designing quality into products and processes , 1986 .

[25]  Shokri Z. Selim,et al.  K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[26]  Zülal Güngör,et al.  K-harmonic means data clustering with simulated annealing heuristic , 2007, Appl. Math. Comput..

[27]  Mineichi Kudo,et al.  Comparison of algorithms that select features for pattern classifiers , 2000, Pattern Recognit..

[28]  D.M. Mount,et al.  An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[29]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

[30]  Zülal Güngör,et al.  K-Harmonic means data clustering with tabu-search method , 2008 .

[31]  Vera Chung,et al.  Forecasting wind power in the Mai Liao Wind Farm based on the multi-layer perceptron artificial neural network model with improved simplified swarm optimization , 2014 .

[32]  A. Asuncion,et al.  UCI Machine Learning Repository, University of California, Irvine, School of Information and Computer Sciences , 2007 .

[33]  Wei-Chang Yeh,et al.  A new simplified swarm optimization (SSO) using exchange local search scheme , 2012 .

[34]  Stan Matwin,et al.  A review on particle swarm optimization algorithm and its variants to clustering high-dimensional data , 2013, Artificial Intelligence Review.

[35]  Rasoul Azizipanah-Abarghooee,et al.  A new hybrid bacterial foraging and simplified swarm optimization algorithm for practical optimal dynamic load dispatch , 2013 .