IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v523y2019icp279-291.html
   My bibliography  Save this article

Community detection method based on robust semi-supervised nonnegative matrix factorization

Author

Listed:
  • He, Chaobo
  • Zhang, Qiong
  • Tang, Yong
  • Liu, Shuangyin
  • Zheng, Jianhua

Abstract

Nonnegative Matrix Factorization (NMF) has been widely used to resolve the problem of community detection in complex networks. The present NMF-based methods for community detection cannot effectively integrate prior knowledge and deal with noises existing in complex networks, thus their performance still needs to be further improved. Aiming at these problems, we propose an approach for community detection based on robust semi-supervised NMF (RSSNMF). This method is able to combine must-link and cannot-link pairwise constraints based on semi-supervised NMF model and enhance the robustness from using the objective function based on ℓ2,1 norm. The community detection model of RSSNMF can be optimally solved by using the iterative update rules, of which the convergence can be strictly proved. Extensive comparative experiments have been conducted on four typical complex networks, and the results show that RSSNMF has better performance than other similar methods. Furthermore, RSSNMF is more robust and can reduce negative impacts from noises effectively on the performance of community detection.

Suggested Citation

  • He, Chaobo & Zhang, Qiong & Tang, Yong & Liu, Shuangyin & Zheng, Jianhua, 2019. "Community detection method based on robust semi-supervised nonnegative matrix factorization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 279-291.
    • Handle: RePEc:eee:phsmap:v:523:y:2019:i:c:p:279-291
    DOI: 10.1016/j.physa.2019.01.091
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437119300974
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2019.01.091?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.

    References listed on IDEAS

    as
    1. Da Kuang & Sangwoon Yun & Haesun Park, 2015. "SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering," Journal of Global Optimization, Springer, vol. 62(3), pages 545-574, July.
    2. He, Chaobo & Tang, Yong & Liu, Hai & Fei, Xiang & Li, Hanchao & Liu, Shuangyin, 2019. "A robust multi-view clustering method for community detection combining link and content information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 396-411.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Rundong Du & Barry Drake & Haesun Park, 2019. "Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization," Journal of Global Optimization, Springer, vol. 74(4), pages 861-877, August.
    2. Arnaud Vandaele & François Glineur & Nicolas Gillis, 2018. "Algorithms for positive semidefinite factorization," Computational Optimization and Applications, Springer, vol. 71(1), pages 193-219, September.
    3. Yu, Hui & Chen, LuYuan & Yao, JingTao & Wang, XingNan, 2019. "A three-way clustering method based on an improved DBSCAN algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 535(C).
    4. Radu-Alexandru Dragomir & Alexandre d’Aspremont & Jérôme Bolte, 2021. "Quartic First-Order Methods for Low-Rank Minimization," Journal of Optimization Theory and Applications, Springer, vol. 189(2), pages 341-363, May.
    5. Rundong Du & Da Kuang & Barry Drake & Haesun Park, 2017. "DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling," Journal of Global Optimization, Springer, vol. 68(4), pages 777-798, August.
    6. Xin, Xuri & Liu, Kezhong & Loughney, Sean & Wang, Jin & Li, Huanhuan & Ekere, Nduka & Yang, Zaili, 2023. "Multi-scale collision risk estimation for maritime traffic in complex port waters," Reliability Engineering and System Safety, Elsevier, vol. 240(C).
    7. Saeedmanesh, Mohammadreza & Geroliminis, Nikolas, 2016. "Clustering of heterogeneous networks with directional flows based on “Snake” similarities," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 250-269.
    8. Srinivas Eswar & Ramakrishnan Kannan & Richard Vuduc & Haesun Park, 2021. "ORCA: Outlier detection and Robust Clustering for Attributed graphs," Journal of Global Optimization, Springer, vol. 81(4), pages 967-989, December.
    9. Li Zhang & Ming Liu & Bo Wang & Bo Lang & Peng Yang, 2021. "Discovering communities based on mention distance," Scientometrics, Springer;Akadémiai Kiadó, vol. 126(3), pages 1945-1967, March.

    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:eee:phsmap:v:523:y:2019:i:c:p:279-291. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.