GEP Automatic Clustering Algorithm with Dynamic Penalty Factors

Authors

Chen Yan, College of Mathematics and Informatics, South China Agricultural University, Guangzhou 510642, China;
Kangshun Li, College of Mathematics and Informatics, South China Agricultural University, Guangzhou 510642, China;
Yang Lei, College of Mathematics and Informatics, South China Agricultural University, Guangzhou 510642, China;

Abstract

Abstract: Various problems such as sensitive selection of initial clustering center, easily falling into local optimal solution, and determining numbers of clusters, still exist in the traditional clustering algorithm. A GEP automatic clustering algorithm with dynamic penalty factors was proposed. This algorithm combines penalty factors and GEP clustering algorithm, and doesn't rely on any priori knowledge of the data set. And a dynamic algorithm was proposed to generate the penalty factors according to the distribution characteristics of different data sets, which is a better solution for the impact of isolated points and noise points. According to four dataset, penalty factors' effect was tested. Base on the result, a formula to generate penalty factors was proposed. The penalty factor calculated from the formula was used in clustering of the standard data set Iris. The experimental result shows that the efficiency and accuracy of the algorithm are good.

Recommended Citation

Yan, Chen; Li, Kangshun; and Lei, Yang (2020) "GEP Automatic Clustering Algorithm with Dynamic Penalty Factors," Journal of System Simulation: Vol. 28: Iss. 4, Article 6.
Available at: https://dc-china-simulation.researchcommons.org/journal/vol28/iss4/6

First Page

806

Revised Date

2015-05-29

DOI Link

https://doi.org/

Last Page

814

CLC

TP311

Recommended Citation

Chen Yan, Li Kangshun, Yang Lei. GEP Automatic Clustering Algorithm with Dynamic Penalty Factors[J]. Journal of System Simulation, 2016, 28(4): 806-814.