Non-centroid-based discrete differential evolution for data clustering
Tanapon Poonthong, Jeerayut Wetweerapong
Abstract
Data clustering can find similarities and hidden patterns within data. Given a predefined number of groups, most partitional clustering algorithms use representative centers to determine their corresponding clusters. These algorithms, such as K-means and optimization-based algorithms, create and update centroids to give (hyper) spherical shape clusters. This research proposes a non-centroid-based discrete differential evolution (NCDDE) algorithm to solve clustering problems and provide non-spherical shape clusters. The algorithm directs the population of discrete vectors to search for data group labels. It uses a novel discrete mutation strategy analogous to the continuous mutation in classical differential evolution. It also combines a sorting mutation to enhance convergence speed. The algorithm adaptively selects crossover rates in high and low ranges. We use the UCI datasets to compare the NCDDE with other continuous centroid-based algorithms by intra-cluster distance and clustering accuracy. The results show that NCDDE outperforms the compared algorithms overall by intra-cluster distance and achieves the best accuracy for several datasets.
Keywords
Clustering accuracy; Data clustering; Differential evolution; Discrete optimization; Intra-cluster distance; Non-spherical shape clusters
DOI:
https://doi.org/10.11591/eei.v14i1.8811
Refbacks
There are currently no refbacks.
This work is licensed under a
Creative Commons Attribution-ShareAlike 4.0 International License .
<div class="statcounter"><a title="hit counter" href="http://statcounter.com/free-hit-counter/" target="_blank"><img class="statcounter" src="http://c.statcounter.com/10241695/0/5a758c6a/0/" alt="hit counter"></a></div>
Bulletin of EEI Stats
Bulletin of Electrical Engineering and Informatics (BEEI) ISSN: 2089-3191, e-ISSN: 2302-9285 This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU) .