TY - GEN
T1 - Improved activation schema on Automatic Clustering using Differential Evolution algorithm
AU - Tam, Hiu Hin
AU - Ng, Sin Chun
AU - Lui, Andrew K.
AU - Leung, Man Fai
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/5
Y1 - 2017/7/5
N2 - Partitional Clustering is one of the major techniques in Unsupervised Learning in which similar data are put into the same partition. Besides partitioning the unlabeled data, determining the optimal number of partitions is also another main concern in the field of data clustering. Automatic Clustering Differential Evolution (ACDE) is one of the state-of-the-art algorithms that address this concern. In ACDE, the mechanism to determine the optimal number of clusters is by encoding the activation value of each cluster centroid into the chromosome with fixed threshold value. However, it could be argued that a fixed threshold value would be seen as arbitrary, but a varying and adaptive threshold value could yield a solution that would better reflect the quality of clusters. In this paper, a new changing schema of threshold values is introduced for adaptively activating the clusters in the chromosomes, and a heuristic approach is implemented for adjusting the threshold values of each cluster according to their individual quality measurements. The results of several experiments show that the proposed algorithm performed generally better than other state-of-the-art automatic evolutionary clustering algorithms.
AB - Partitional Clustering is one of the major techniques in Unsupervised Learning in which similar data are put into the same partition. Besides partitioning the unlabeled data, determining the optimal number of partitions is also another main concern in the field of data clustering. Automatic Clustering Differential Evolution (ACDE) is one of the state-of-the-art algorithms that address this concern. In ACDE, the mechanism to determine the optimal number of clusters is by encoding the activation value of each cluster centroid into the chromosome with fixed threshold value. However, it could be argued that a fixed threshold value would be seen as arbitrary, but a varying and adaptive threshold value could yield a solution that would better reflect the quality of clusters. In this paper, a new changing schema of threshold values is introduced for adaptively activating the clusters in the chromosomes, and a heuristic approach is implemented for adjusting the threshold values of each cluster according to their individual quality measurements. The results of several experiments show that the proposed algorithm performed generally better than other state-of-the-art automatic evolutionary clustering algorithms.
KW - Automatic clustering
KW - Differential evolution (DE)
KW - Evolutionary clustering
KW - Genetic algorithm (GA)
UR - https://www.scopus.com/pages/publications/85028512996
U2 - 10.1109/CEC.2017.7969513
DO - 10.1109/CEC.2017.7969513
M3 - Conference contribution
AN - SCOPUS:85028512996
T3 - 2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings
SP - 1749
EP - 1756
BT - 2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings
T2 - 2017 IEEE Congress on Evolutionary Computation, CEC 2017
Y2 - 5 June 2017 through 8 June 2017
ER -