Abstract | ||
---|---|---|
Density peak clustering (DPC) is one of the most interesting methods in recent years. By using only one parameter, the algorithm can identify the number of clusters using peak estimation based on density and detect clusters in a single step. Although the DPC has lots of advantages, however, for some real applications, it is not easy to identify exactly the number of clusters because of the complex data distribution. In this paper, we propose a new active density peak clustering that aim to improve the clustering process for DPC. The main idea of our algorithm is adding a loop of active cluster centers selection for getting label from users. Experiments results show the effectiveness of our proposed solution. |
Year | DOI | Venue |
---|---|---|
2022 | 10.23919/ICACT53585.2022.9728857 | 2022 24TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY (ICACT): ARITIFLCIAL INTELLIGENCE TECHNOLOGIES TOWARD CYBERSECURITY |
Keywords | DocType | ISSN |
Clustering, Density peak clustering, Active Learning | Conference | 1738-9445 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
10 |
Name | Order | Citations | PageRank |
---|---|---|---|
Viet-Vu Vu | 1 | 0 | 1.69 |
Byeongnam Yoon | 2 | 0 | 1.01 |
Cuong Le | 3 | 0 | 0.68 |
Hong-Quan Do | 4 | 0 | 1.69 |
Hai-Minh Nguyen | 5 | 0 | 0.34 |
Chung Tran | 6 | 0 | 0.34 |
Viet-Thang Vu | 7 | 0 | 0.68 |
Cong-Mau Tran | 8 | 0 | 0.34 |
Doan-Vinh Tran | 9 | 0 | 1.01 |
Tien-Dung Duong | 10 | 0 | 0.68 |