IDEAS home Printed from https://ideas.repec.org/a/hin/complx/5232543.html
   My bibliography  Save this article

A Data-Driven Parameter Adaptive Clustering Algorithm Based on Density Peak

Author

Listed:
  • Tao Du
  • Shouning Qu
  • Qin Wang

Abstract

Clustering is an important unsupervised machine learning method which can efficiently partition points without training data set. However, most of the existing clustering algorithms need to set parameters artificially, and the results of clustering are much influenced by these parameters, so optimizing clustering parameters is a key factor of improving clustering performance. In this paper, we propose a parameter adaptive clustering algorithm DDPA-DP which is based on density-peak algorithm. In DDPA-DP, all parameters can be adaptively adjusted based on the data-driven thought, and then the accuracy of clustering is highly improved, and the time complexity is not increased obviously. To prove the performance of DDPA-DP, a series of experiments are designed with some artificial data sets and a real application data set, and the clustering results of DDPA-DP are compared with some typical algorithms by these experiments. Based on these results, the accuracy of DDPA-DP has obvious advantage of all, and its time complexity is close to classical DP-Clust.

Suggested Citation

  • Tao Du & Shouning Qu & Qin Wang, 2018. "A Data-Driven Parameter Adaptive Clustering Algorithm Based on Density Peak," Complexity, Hindawi, vol. 2018, pages 1-14, October.
  • Handle: RePEc:hin:complx:5232543
    DOI: 10.1155/2018/5232543
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2018/5232543.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2018/5232543.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2018/5232543?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:5232543. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.