| Autor: |
Jinshuai Qu, Meina Zhao, Minghu Gao, Lanlan Zhang |
| Rok vydání: |
2019 |
| Předmět: |
|
| Zdroj: |
2019 IEEE 8th Joint International Information Technology and Artificial Intelligence Conference (ITAIC). |
| DOI: |
10.1109/itaic.2019.8785550 |
| Popis: |
In view of the shortcomings of the traditional K-means method, the D-K-means algorithm is proposed in this paper. The algorithm adopts the concept of density number. The point set of high density number is extracted from the original data set as a new training set, and the point in the point set of the high density number is selected as the initial cluster center point. Then, using the method of geometric center points to update the cluster center points at high density points until convergence conditions are reached. Experiments show that the method can effectively avoid the local optimal situation of K-means clustering algorithm. On the other hand, the iterative number of iteration in the clustering process is reduced, and the stability and accuracy of clustering are improved. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
