A K-Means Clustering Algorithm Based on Enhanced Differential Evolution

2011 ◽  
Vol 339 ◽  
pp. 71-75 ◽  
Author(s):  
Li Mao ◽  
Huai Jin Gong ◽  
Xing Yang Liu
Keyword(s):  
Differential Evolution ◽  
Numerical Experiments ◽  
Clustering Algorithm ◽  
Global Search ◽  
Convergence Speed ◽  
Mutation Operator ◽  
Local Optima ◽  
Initial Cluster ◽  
Crossover Probability ◽  
Probability Operator

The conventional k-means algorithms are sensitive to the initial cluster centers, and tend to be trapped by local optima. To resolve these problems, a novel k-means clustering algorithm using enhanced differential evolution technique is proposed in this paper. This algorithm improves the global search ability by applying Laplace mutation operator and exponentially increasing crossover probability operator. Numerical experiments show that this algorithm overcomes the disadvantages of the conventional k-means algorithms, and improves search ability with higher accuracy, faster convergence speed and better robustness.

Research on Chaos Theory Improved Evolutionary Algorithm

2014 ◽  
Vol 926-930 ◽  
pp. 3463-3466
Author(s):  
Shu Qun Liu ◽  
Yang Zhou ◽  
Wei Ping Yan
Keyword(s):  
Evolutionary Algorithm ◽  
Chaos Theory ◽  
Global Search ◽  
Convergence Speed ◽  
Mutation Operator ◽  
Running Time ◽  
Algorithm Convergence ◽  
The Relationship

Because the basic evolutionary algorithm convergence speed is slow, prone to stagnation, the algorithm running time is too long, so according to chaos theory about the relationship between evolution and chaos, this paper design an improved evolutionary algorithm with chaotic mutation operator, the optimization of the contraction policy can improve the global search ability of effective, significantly improved the performance of the proposed algorithm.

scholarly journals Data Clustering based on Modified Differential Evolution and Quasi-Opposition-based Learning

2020 ◽  
Vol 13 (6) ◽  
pp. 168-178
Author(s):  
Pyae Cho ◽  
◽  
Thi Nyunt ◽  
Keyword(s):  
Differential Evolution ◽  
Heuristic Search ◽  
Clustering Algorithm ◽  
Population Based ◽  
Initial Population ◽  
Local Optima ◽  
Opposition Based Learning ◽  
De Algorithm ◽  
Mutation Strategy

Differential Evolution (DE) has become an advanced, robust, and proficient alternative technique for clustering on account of their population-based stochastic and heuristic search manners. Balancing better the exploitation and exploration power of the DE algorithm is important because this ability influences the performance of the algorithm. Besides, keeping superior solutions for the initial population raises the probability of finding better solutions and the rate of convergence. In this paper, an enhanced DE algorithm is introduced for clustering to offer better cluster solutions with faster convergence. The proposed algorithm performs a modified mutation strategy to improve the DE’s search behavior and exploits Quasi-Opposition-based Learning (QBL) to choose fitter initial solutions. This mutation strategy that uses the best solution as a target solution and applies three differentials contributes to avoiding local optima trap and slow convergence. The QBL based initialization method also contributes to increasing the quality of the clustering results and convergence rate. The experimental analysis was conducted on seven real datasets from the UCI repository to evaluate the performance of the proposed clustering algorithm. The obtained results showed that the proposed algorithm achieves more compact clusters and stable solutions than the competing conventional DE variants. Moreover, the performance of the proposed algorithm was compared with the existing state of the art clustering techniques based on DE. The corresponding results also pointed out that the proposed algorithm is comparable to other DE based clustering approaches in terms of the value of the objective functions. Therefore, the proposed algorithm can be regarded as an efficient clustering tool.

scholarly journals Adaptive Initialization Method for K-Means Algorithm

2021 ◽  
Vol 4 ◽  
Author(s):  
Jie Yang ◽  
Yu-Kai Wang ◽  
Xin Yao ◽  
Chin-Teng Lin
Keyword(s):  
Time Complexity ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Real Life ◽  
Superior Performance ◽  
Local Optima ◽  
Initial Cluster ◽  
Higher Dimensional ◽  
Real World Datasets ◽  
Random Method

The K-means algorithm is a widely used clustering algorithm that offers simplicity and efficiency. However, the traditional K-means algorithm uses a random method to determine the initial cluster centers, which make clustering results prone to local optima and then result in worse clustering performance. In this research, we propose an adaptive initialization method for the K-means algorithm (AIMK) which can adapt to the various characteristics in different datasets and obtain better clustering performance with stable results. For larger or higher-dimensional datasets, we even leverage random sampling in AIMK (name as AIMK-RS) to reduce the time complexity. 22 real-world datasets were applied for performance comparisons. The experimental results show AIMK and AIMK-RS outperform the current initialization methods and several well-known clustering algorithms. Specifically, AIMK-RS can significantly reduce the time complexity to O (n). Moreover, we exploit AIMK to initialize K-medoids and spectral clustering, and better performance is also explored. The above results demonstrate superior performance and good scalability by AIMK or AIMK-RS. In the future, we would like to apply AIMK to more partition-based clustering algorithms to solve real-life practical problems.

scholarly journals Penerapan Algoritma Invasive Weed Optimnization untuk Penentuan Titik Pusat Klaster pada K-Means

2015 ◽  
Vol 9 (1) ◽  
pp. 65 ◽  
Author(s):  
I Putu Adi Pratama ◽  
Agus Harjoko
Keyword(s):  
Clustering Algorithm ◽  
Search Algorithm ◽  
Mean Value ◽  
Global Search ◽  
Cluster Center ◽  
Invasive Weed Optimization ◽  
Invasive Weed ◽  
Local Optima ◽  
Center Point ◽  
Result Show

AbstrakK-means merupakan salah satu algoritmaclustering yang paling populer. Salah satu alasan dari kepopuleran K-means adalah karena mudah dan sederhana ketika diimplementasikan. Namun hasil klaster dari K-means sangat sensitif terhadap pemilihan titik pusat awalnya. K-means seringkali terjebak pada solusi lokal optima. Hasil klaster yang lebih baik seringkali baru bisa didapatkan setelah dilakukan beberapa kali percobaan. Penyebab lain seringnya K-means terjebak pada solusi lokal optima adalah karena cara penentuan titik pusat baru untuk setiap iterasi dalam K-means dilakukan dengan menggunakan nilai mean dari data-data yang ada pada klaster bersangkutan. Hal tersebut menyebabkan K-means hanya akan melakukan pencarian calon titik pusat baru disekitar titik pusat awal. Untuk mengatasi permasalahan tersebut, penerapan metode yang memiliki kemampuan untuk melakukan pencarian global akan mampu membantu K-means untuk dapat menemukan titik pusat klaster yang lebih baik. Invasive Weed Optimization merupakan algoritma pencarian global yang terinspirasi oleh proses kolonisasi rumput liar. Pada penelitian ini diusulkan sebuah metode yang merupakan hasil hibridasi dari metode K-means dan algoritma Invasive Weed Optimization (IWOKM). Kinerja dari metode IWOKM telah dicobakan pada data bunga Iris kemudian hasilnya dibandingkan dengan K-means. Dari pengujian yang dilakukan, didapat hasil bahwa metode IWOKM mampu menghasilkan hasil klaster yang lebih baik dari K-means. Kata kunci—K-means, IWO, IWOKM, analisa klaster  AbstractK-means is one of the most popular clustering algorithm. One reason for the popularity of K-means is it is easy and simple when implemented. However, the results of K-means is very sensitive to the selection of initial centroid. The results are often better after several experiment. Another reason why K-means stuck in local optima is due to the method of determining the new center point for each iteration that is performed using the mean value of the data that exist on the cluster. This causes the algorithm will do search for the centroid candidates around the center point. To overcome this, implement a method that is able to do a global search to determine the center point on K-means may be able to assist K-means in finding better cluster center. Invasive Weed Optimization (IWO) is a global search algorithm inspired by weed colonization process. In this study proposed a method which is the result of hybridization of K-means and IWO (IWOKM). Performance of the method has been tested on flower Iris dataset. The results are then compared with the result from K-means. The result show that IWOKM able to produce better cluster center than K-means. Keywords—K-means, IWO, IWOKM, cluster analysis

scholarly journals A Novel Tournament Selection Based Differential Evolution Variant for Continuous Optimization Problems

2015 ◽  
Vol 2015 ◽  
pp. 1-21 ◽  
Author(s):  
Qamar Abbas ◽  
Jamil Ahmad ◽  
Hajira Jabeen
Keyword(s):  
Differential Evolution ◽  
Optimization Problems ◽  
Continuous Optimization ◽  
Convergence Speed ◽  
Local Optima ◽  
De Algorithm ◽  
Parent Selection ◽  
Tournament Selection ◽  
Overall Performance ◽  
Continuous Optimization Problems

Differential evolution (DE) is a powerful global optimization algorithm which has been studied intensively by many researchers in the recent years. A number of variants have been established for the algorithm that makes DE more applicable. However, most of the variants are suffering from the problems of convergence speed and local optima. A novel tournament based parent selection variant of DE algorithm is proposed in this research. The proposed variant enhances searching capability and improves convergence speed of DE algorithm. This paper also presents a novel statistical comparison of existing DE mutation variants which categorizes these variants in terms of their overall performance. Experimental results show that the proposed DE variant has significance performance over other DE mutation variants.

scholarly journals Ranking-based hierarchical random mutation in differential evolution

PLoS ONE ◽  
2021 ◽  
Vol 16 (2) ◽  
pp. e0245887
Author(s):  
Xuxu Zhong ◽  
Meijun Duan ◽  
Peng Cheng
Keyword(s):  
Individual Differences ◽  
Differential Evolution ◽  
Control Parameter ◽  
Population Diversity ◽  
Convergence Speed ◽  
Mutation Operator ◽  
Random Mutation ◽  
Parameter Adaptation ◽  
Fitness Value ◽  
Control Parameter Adaptation

In order to improve the performance of differential evolution (DE), this paper proposes a ranking-based hierarchical random mutation in differential evolution (abbreviated as RHRMDE), in which two improvements are presented. First, RHRMDE introduces a hierarchical random mutation mechanism to apply the classic “DE/rand/1” and its variant on the non-inferior and inferior group determined by the fitness value. The non-inferior group employs the traditional mutation operator “DE/rand/1” with global and random characteristics, which increases the global exploration ability and population diversity. The inferior group uses the improved mutation operator “DE/rand/1” with elite and random characteristics, which enhances the local exploitation ability and convergence speed. Second, the control parameter adaptation of RHRMDE not only considers the complexity differences of various problems but also takes individual differences into account. The proposed RHRMDE is compared with five DE variants and five non-DE algorithms on 32 universal benchmark functions, and the results show that the RHRMDE is superior over the compared algorithms.

scholarly journals A hybrid differential evolution based on gaining‑sharing knowledge algorithm and harris hawks optimization

PLoS ONE ◽  
2021 ◽  
Vol 16 (4) ◽  
pp. e0250951
Author(s):  
Xuxu Zhong ◽  
Meijun Duan ◽  
Xiao Zhang ◽  
Peng Cheng
Keyword(s):  
Differential Evolution ◽  
Optimization Problems ◽  
Mutation Operator ◽  
Exploration And Exploitation ◽  
Two Phase ◽  
Crossover Probability ◽  
Insurance Mechanism ◽  
Hybrid Mutation Operator ◽  
Selection Of ◽  
Classical Mutation

Differential evolution (DE) is favored by scholars for its simplicity and efficiency, but its ability to balance exploration and exploitation needs to be enhanced. In this paper, a hybrid differential evolution with gaining-sharing knowledge algorithm (GSK) and harris hawks optimization (HHO) is proposed, abbreviated as DEGH. Its main contribution lies are as follows. First, a hybrid mutation operator is constructed in DEGH, in which the two-phase strategy of GSK, the classical mutation operator “rand/1” of DE and the soft besiege rule of HHO are used and improved, forming a double-insurance mechanism for the balance between exploration and exploitation. Second, a novel crossover probability self-adaption strategy is proposed to strengthen the internal relation among mutation, crossover and selection of DE. On this basis, the crossover probability and scaling factor jointly affect the evolution of each individual, thus making the proposed algorithm can better adapt to various optimization problems. In addition, DEGH is compared with eight state-of-the-art DE algorithms on 32 benchmark functions. Experimental results show that the proposed DEGH algorithm is significantly superior to the compared algorithms.

Biomedical Document Clustering Based on Accelerated Symbiotic Organisms Search Algorithm

2021 ◽  
Vol 12 (4) ◽  
pp. 169-185
Author(s):  
Saida Ishak Boushaki ◽  
Omar Bendjeghaba ◽  
Nadjet Kamel
Keyword(s):  
Clustering Algorithm ◽  
Search Algorithm ◽  
Clustering Algorithms ◽  
Document Clustering ◽  
Latent Semantic Indexing ◽  
Research Area ◽  
Semantic Indexing ◽  
Local Optima ◽  
Symbiotic Organisms Search ◽  
Symbiotic Organisms

Clustering is an important unsupervised analysis technique for big data mining. It finds its application in several domains including biomedical documents of the MEDLINE database. Document clustering algorithms based on metaheuristics is an active research area. However, these algorithms suffer from the problems of getting trapped in local optima, need many parameters to adjust, and the documents should be indexed by a high dimensionality matrix using the traditional vector space model. In order to overcome these limitations, in this paper a new documents clustering algorithm (ASOS-LSI) with no parameters is proposed. It is based on the recent symbiotic organisms search metaheuristic (SOS) and enhanced by an acceleration technique. Furthermore, the documents are represented by semantic indexing based on the famous latent semantic indexing (LSI). Conducted experiments on well-known biomedical documents datasets show the significant superiority of ASOS-LSI over five famous algorithms in terms of compactness, f-measure, purity, misclassified documents, entropy, and runtime.

Sign in / Sign up

Export Citation Format

Share Document