IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v32y2021i02ns0129183121500273.html
   My bibliography  Save this article

SAWEG: A new algorithm for network clustering

Author

Listed:
  • Chun Gui

    (Key Laboratory of China’s Ethnic Languages and Information Technology of Ministry of Education, Northwest Minzu University, Lanzhou City, Gansu Province, 730000, P. R. China2College of Mathematics and Computer Science, Northwest Minzu University, Lanzhou City, Gansu Province, 730000, P. R. China)

Abstract

The relationship between nodes in the network is reflected by edges. It is novel to study the network from the perspective of edges rather than nodes. Following the idea of edge graph clustering which provides an unorthodox approach to represent the topology of the systems, we propose a new clustering method called Spectral Analysis based on Weighted edge graphs to find the overlapping clusters. According to the incidence matrix of the original network, we obtain the corresponding edge graph. The first two nontrivial eigenvectors dimensional spaces are built with the Laplacian Matrix, and we get edge dendrogram of the network. Then cut the edge dendrogram by using the improved partition density to get the optimal community structure. The proposed algorithm successfully finds the common nodes between clusters. Experiments on five real-world networks show that the proposed SAWEG algorithm performs better than the other three benchmarking clustering algorithms.

Suggested Citation

  • Chun Gui, 2021. "SAWEG: A new algorithm for network clustering," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 32(02), pages 1-16, February.
    • Handle: RePEc:wsi:ijmpcx:v:32:y:2021:i:02:n:s0129183121500273
    DOI: 10.1142/S0129183121500273
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183121500273
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183121500273?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:wsi:ijmpcx:v:32:y:2021:i:02:n:s0129183121500273. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.