K-Means Clustering Algorithm Based on Improved Differential Evolution

Journal Title: Information Dynamics and Applications - Year 2024, Vol 3, Issue 3

Abstract

The traditional K-means clustering algorithm has unstable clustering results and low efficiency due to the random selection of initial cluster centres. To address the limitations, an improved K-means clustering algorithm based on adaptive guided differential evolution (AGDE-KM) was proposed. First, adaptive operators were designed to enhance global search capability in the early stages and accelerate convergence in later stages. Second, a multi-mutation strategy with a weighted coefficient was introduced to leverage the advantages of different mutation strategies during various evolutionary phases, balancing global and local search capabilities and expediting convergence. Third, a Gaussian perturbation crossover operation was proposed based on the best individual in the current population, providing individuals with superior evolution directions while preserving population diversity across dimensions, thereby avoiding the local optima of the algorithm. The optimal solution output at the end of the algorithm implementation was used as the initial cluster centres, replacing the cluster centres randomly selected by the traditional K-means clustering algorithm. The proposed algorithm was evaluated on public datasets from the UCI repository, including Vowel, Iris, and Glass, as well as a synthetic dataset (Jcdx). The sum of squared errors (SSE) was reduced by 5.65%, 19.59%, 13.31%, and 6.1%, respectively, compared to traditional K-means. Additionally, clustering time was decreased by 83.03%, 81.33%, 77.47%, and 92.63%, respectively. Experimental results demonstrate that the proposed improved algorithm significantly enhances convergence speed and optimisation capability, significantly improving the clustering effectiveness, efficiency, and stability.

Authors and Affiliations

Lei An, Xiaohua Sun, Yan Wang

Keywords

Related Articles

MR Image Feature Analysis for Alzheimer’s Disease Detection Using Machine Learning Approaches

Alzheimer’s disease (AD), a progressive neurological disorder, predominantly impacts cognitive functions, manifesting as memory loss and deteriorating thinking abilities. Recognized as the primary form of dementia, this...

A Comparative Review of Internet of Things Model Workload Distribution Techniques in Fog Computing Networks

In the realm of fog computing (FC), a vast array of intelligent devices collaborates within an intricate network, a synergy that, while promising, has not been without its challenges. These challenges, including data los...

Multi-Channel Scheduling for Short-Range Wireless Communication Networks Using a Q-Learning Feedback Mechanism

The traditional channel scheduling methods in short-range wireless communication networks are often constrained by fixed rules, resulting in inefficient channel resource utilization and unstable data communication. To...

An Optimized Algorithm for Peak to Average Power Ratio Reduction in Orthogonal Frequency Division Multiplexing Communication Systems: An Integrated Approach

The impact of the peak to Average Power Ratio (PAPR) on the efficiency of an Orthogonal Frequency Division Multiplexing (OFDM) communication system is significantly mitigated through an innovative Reconfigurable Integrat...

The Need to Improve DNS Security Architecture: An Adaptive Security Approach

The Domain Name System (DNS) is an essential component of the internet infrastructure. Due to its importance, securing DNS becomes a necessity for current and future networks. Various DNS security architecture have been...

Download PDF file
  • EP ID EP752899
  • DOI https://doi.org/10.56578/ida030305
  • Views 2
  • Downloads 1

How To Cite

Lei An, Xiaohua Sun, Yan Wang (2024). K-Means Clustering Algorithm Based on Improved Differential Evolution. Information Dynamics and Applications, 3(3), -. https://europub.co.uk/articles/-A-752899