1. 采用类心密度策略的多目标微分自动聚类算法.
- Author
-
申晓宁, 孙 毅, 薛云勇, and 孙 帅
- Subjects
- *
DIFFERENTIAL evolution , *ALGORITHMS , *DENSITY , *KERNEL (Mathematics) , *DISTANCES - Abstract
In the process of clustering, for the reason that the randomness of the class-center selection may lead to the phenomenon that the selected class-center deviates from the data set, or the class-center is too centralized, the proposed algorithm selected the class-center for two times: it screened out the class-centers which have too small density or have small distances between pairs of class-centers, and the algorithm did not allow them to participate in clustering. Then the algorithm continued to cluster the remaining class-centers. In order to make the algorithm get the optimal class-center quickly, it proposed an improved clustering criterion function to penalize the number of clusters dynamically. In order to evaluate the performance of the proposed algorithm on clustering problems, it carried out experiments on two types of data sets. Compared with the other three existing automatic clustering algorithms, simulation experiments show that the proposed algorithm can obtain better clustering results, which validates the effectiveness of the proposed strategies. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF