Survey of Density Peak Clustering Algorithm
CSTR:
Author:
Affiliation:

Clc Number:

TP391

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Density peak clustering(DPC) is a novel clustering algorithm based on density and distance. It is widely used in the field of data mining because of its simple principle, no iteration and the ability to process shape datasets. However, DPC algorithm also has some defects,including the sensitive cutoff distance parameter, nonautomatic selection of initial clustering center, the chain problem in subsequent allocation and high time complexity. This paper summarizes the research status of DPC algorithm. Firstly, it introduces the principle and process of DPC algorithm. Secondly, in view of the deficiencies of DPC algorithm, the optimization of DPC algorithm is summarized and analyzed, and the core technology, advantages and disadvantages of the optimization algorithm are pointed out. Finally, the possible challenges and development trend of DPC algorithm in the future are concluded.

    Reference
    Related
    Cited by
Get Citation

王森,邢帅杰,刘琛.密度峰值聚类算法研究综述[J].华东交通大学学报英文版,2023,40(1):106-116.
Wang Sen, Xing Shuaijie, Liu Chen. Survey of Density Peak Clustering Algorithm[J]. JOURNAL OF EAST CHINA JIAOTONG UNIVERSTTY,2023,40(1):106-116

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: February 23,2023
  • Published:
Article QR Code