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

An efficient graph clustering algorithm in signed graph based on modularity maximization

Author

Listed:
  • Kefan Zhuo

    (School of Management Science and Engineering, Central University of Finance and Economics, Beijing 100081, P. R. China)

  • Zhuoxuan Yang

    (School of Economics and Management, North China Electric Power University, Beijing 102206, P. R. China)

  • Guan Yan

    (School of Management Science and Engineering, Central University of Finance and Economics, Beijing 100081, P. R. China)

  • Kai Yu

    (School of Computer Science and Engineering, Xinjiang University of Finance and Economics, Urumqi, Xinjiang 830012, P. R. China)

  • Wenqiang Guo

    (School of Computer Science and Engineering, Xinjiang University of Finance and Economics, Urumqi, Xinjiang 830012, P. R. China)

Abstract

The unsigned graphs containing positive links only, have been analyzed fruitfully. However, the physical relations behind complex networks are dissimilar. We often encounter the signed networks that have both positive and negative links as well. It is very important to study the characteristics of complex networks and predict individual attitudes by analyzing the attitudes of individuals and their neighbors, which can divide individuals into different clusters or communities. To detect the clusters in signed networks, first, a modularity function for signed networks is proposed on the basis of the combination of positive and negative part. Then, a new graph clustering algorithm for signed graphs has also been proposed based on CNM algorithm, which has high efficiency. Finally, the algorithm has been applied on both artificial and the real networks. The results show that the proposed method has been able to achieve near-perfect solution, which is suitable for multiple types real networks.

Suggested Citation

  • Kefan Zhuo & Zhuoxuan Yang & Guan Yan & Kai Yu & Wenqiang Guo, 2019. "An efficient graph clustering algorithm in signed graph based on modularity maximization," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 30(11), pages 1-15, November.
  • Handle: RePEc:wsi:ijmpcx:v:30:y:2019:i:11:n:s0129183119500955
    DOI: 10.1142/S0129183119500955
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183119500955
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0129183119500955?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:30:y:2019:i:11:n:s0129183119500955. 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.