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

Community Detection Based on Density Peak Clustering Model and Multiple Attribute Decision-Making Strategy TOPSIS

Author

Listed:
  • Jianjun Cheng
  • Xu Wang
  • Wenshuang Gong
  • Jun Li
  • Nuo Chen
  • Xiaoyun Chen
  • Giacomo Fiumara

Abstract

Community detection is one of the key research directions in complex network studies. We propose a community detection algorithm based on a density peak clustering model and multiple attribute decision-making strategy, TOPSIS (Technique for Order Preference by Similarity to an Ideal Solution). First, the two-dimensional dataset, which is transformed from the network by taking the density and distance as the attributes of nodes, is clustered by using the DBSCAN algorithm, and outliers are determined and taken as the key nodes. Then, the initial community frameworks are formed and expanded by adding the most similar node of the community as its new member. In this process, we use TOPSIS to cohesively integrate four kinds of similarities to calculate an index, and use it as a criterion to select the most similar node. Then, we allocate the nonkey nodes that are not covered in the expanded communities. Finally, some communities are merged to obtain a stable partition in two ways. This paper designs some experiments for the algorithm on some real networks and some synthetic networks, and the proposed method is compared with some popular algorithms. The experimental results testify for the effectiveness and show the accuracy of our algorithm.

Suggested Citation

  • Jianjun Cheng & Xu Wang & Wenshuang Gong & Jun Li & Nuo Chen & Xiaoyun Chen & Giacomo Fiumara, 2021. "Community Detection Based on Density Peak Clustering Model and Multiple Attribute Decision-Making Strategy TOPSIS," Complexity, Hindawi, vol. 2021, pages 1-18, December.
  • Handle: RePEc:hin:complx:1772407
    DOI: 10.1155/2021/1772407
    as

    Download full text from publisher

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

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

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