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

An Improved Integrated Clustering Learning Strategy Based on Three-Stage Affinity Propagation Algorithm with Density Peak Optimization Theory

Author

Listed:
  • Limin Wang
  • Wenjing Sun
  • Xuming Han
  • Zhiyuan Hao
  • Ruihong Zhou
  • Jinglin Yu
  • Milan Parmar
  • Abd E.I.-Baset Hassanien

Abstract

To better reflect the precise clustering results of the data samples with different shapes and densities for affinity propagation clustering algorithm (AP), an improved integrated clustering learning strategy based on three-stage affinity propagation algorithm with density peak optimization theory (DPKT-AP) was proposed in this paper. DPKT-AP combined the ideology of integrated clustering with the AP algorithm, by introducing the density peak theory and k-means algorithm to carry on the three-stage clustering process. In the first stage, the clustering center point was selected by density peak clustering. Because the clustering center was surrounded by the nearest neighbor point with lower local density and had a relatively large distance from other points with higher density, it could help the k-means algorithm in the second stage avoiding the local optimal situation. In the second stage, the k-means algorithm was used to cluster the data samples to form several relatively small spherical subgroups, and each of subgroups had a local density maximum point, which is called the center point of the subgroup. In the third stage, DPKT-AP used the AP algorithm to merge and cluster the spherical subgroups. Experiments on UCI data sets and synthetic data sets showed that DPKT-AP improved the clustering performance and accuracy for the algorithm.

Suggested Citation

  • Limin Wang & Wenjing Sun & Xuming Han & Zhiyuan Hao & Ruihong Zhou & Jinglin Yu & Milan Parmar & Abd E.I.-Baset Hassanien, 2021. "An Improved Integrated Clustering Learning Strategy Based on Three-Stage Affinity Propagation Algorithm with Density Peak Optimization Theory," Complexity, Hindawi, vol. 2021, pages 1-12, January.
  • Handle: RePEc:hin:complx:6666619
    DOI: 10.1155/2021/6666619
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6666619.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6666619.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/6666619?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:6666619. 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.