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

Enhanced semi-supervised community detection with active node and link selection

Author

Listed:
  • Li, Yafang
  • Jia, Caiyan
  • Li, Jianqiang
  • Wang, Xiaoyang
  • Yu, Jian

Abstract

Semi-supervised community detection has gained a lot of attention by leveraging side information for better understanding network topologies. However, most of existing works select side information in a random manner. They usually require a great amount of side information to significantly improve the performance of community detection. Besides, they have to define the number of communities in advance. To address these issues, this paper proposed an active semi-supervised community detection method, called SK-rank-D. The key advantages of this framework are twofold: (1) Actively selecting a small amount of links as side information to“sharpen” the boundaries between communities and “compact” the connections within communities; (2) Automatically referring the number of communities by selecting informative nodes in communities. Empirical analysis on both synthetic and real-world networks showed the effectiveness and rationality of the newly proposed method in deciding community number. We also compared with competing semi-supervised community detection methods, the experimental results demonstrated the superior performance of our approach.

Suggested Citation

  • Li, Yafang & Jia, Caiyan & Li, Jianqiang & Wang, Xiaoyang & Yu, Jian, 2018. "Enhanced semi-supervised community detection with active node and link selection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 510(C), pages 219-232.
  • Handle: RePEc:eee:phsmap:v:510:y:2018:i:c:p:219-232
    DOI: 10.1016/j.physa.2018.06.091
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437118308161
    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.2018.06.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. Wang, Wenjun & Liu, Dong & Liu, Xiao & Pan, Lin, 2013. "Fuzzy overlapping community detection based on local random walk and multidimensional scaling," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(24), pages 6578-6586.
    2. You, Tao & Cheng, Hui-Min & Ning, Yi-Zi & Shia, Ben-Chang & Zhang, Zhong-Yuan, 2016. "Community detection in complex networks using density-based clustering algorithm and manifold learning," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 464(C), pages 221-230.
    3. Shang, Ronghua & Bai, Jing & Jiao, Licheng & Jin, Chao, 2013. "Community detection based on modularity and an improved genetic algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(5), pages 1215-1231.
    4. Jiang, Yawen & Jia, Caiyan & Yu, Jian, 2013. "An efficient community detection method based on rank centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(9), pages 2182-2194.
    5. Liu, Dong & Liu, Xiao & Wang, Wenjun & Bai, Hongyu, 2014. "Semi-supervised community detection based on discrete potential theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 416(C), pages 173-182.
    6. Ma, Xiaoke & Gao, Lin & Yong, Xuerong & Fu, Lidong, 2010. "Semi-supervised clustering algorithm for community structure detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(1), pages 187-197.
    7. Jin, Hong & Wang, Shuliang & Li, Chenyang, 2013. "Community detection in complex networks by density-based clustering," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(19), pages 4606-4618.
    8. He, Bing & Ding, Ying & Tang, Jie & Reguramalingam, Vignesh & Bollen, Johan, 2013. "Mining diversity subgraph in multidisciplinary scientific collaboration networks: A meso perspective," Journal of Informetrics, Elsevier, vol. 7(1), pages 117-128.
    9. Li, Yafang & Jia, Caiyan & Yu, Jian, 2015. "A parameter-free community detection method based on centrality and dispersion of nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 438(C), pages 321-334.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chen, Chunchun & Zhu, Wenjie & Peng, Bo, 2022. "Differentiated graph regularized non-negative matrix factorization for semi-supervised community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 604(C).

    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. Li, Yafang & Jia, Caiyan & Yu, Jian, 2015. "A parameter-free community detection method based on centrality and dispersion of nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 438(C), pages 321-334.
    2. You, Tao & Cheng, Hui-Min & Ning, Yi-Zi & Shia, Ben-Chang & Zhang, Zhong-Yuan, 2016. "Community detection in complex networks using density-based clustering algorithm and manifold learning," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 464(C), pages 221-230.
    3. Wang, Tao & Yin, Liyan & Wang, Xiaoxia, 2018. "A community detection method based on local similarity and degree clustering information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 490(C), pages 1344-1354.
    4. Nan, Dong-Yang & Yu, Wei & Liu, Xiao & Zhang, Yun-Peng & Dai, Wei-Di, 2018. "A framework of community detection based on individual labels in attribute networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 523-536.
    5. Chen, Chunchun & Zhu, Wenjie & Peng, Bo, 2022. "Differentiated graph regularized non-negative matrix factorization for semi-supervised community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 604(C).
    6. Liu, Dong & Liu, Xiao & Wang, Wenjun & Bai, Hongyu, 2014. "Semi-supervised community detection based on discrete potential theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 416(C), pages 173-182.
    7. Jing Wang & Jing Wang & Jingfeng Guo & Liya Wang & Chunying Zhang & Bin Liu, 2023. "Research Progress of Complex Network Modeling Methods Based on Uncertainty Theory," Mathematics, MDPI, vol. 11(5), pages 1-27, March.
    8. Ke Hu & Ju Xiang & Yun-Xia Yu & Liang Tang & Qin Xiang & Jian-Ming Li & Yong-Hong Tang & Yong-Jun Chen & Yan Zhang, 2020. "Significance-based multi-scale method for network community detection and its application in disease-gene prediction," PLOS ONE, Public Library of Science, vol. 15(3), pages 1-24, March.
    9. Lin, Zhen & Zheng, Xiaolin & Xin, Nan & Chen, Deren, 2014. "CK-LPA: Efficient community detection algorithm based on label propagation with community kernel," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 416(C), pages 386-399.
    10. Li, Wei & Huang, Ce & Wang, Miao & Chen, Xi, 2017. "Stepping community detection algorithm based on label propagation and similarity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 472(C), pages 145-155.
    11. Lu, Hong & Sang, Xiaoshuang & Zhao, Qinghua & Lu, Jianfeng, 2020. "Community detection algorithm based on nonnegative matrix factorization and pairwise constraints," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    12. Zhou, Xu & Liu, Yanheng & Wang, Jian & Li, Chun, 2017. "A density based link clustering algorithm for overlapping community detection in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 65-78.
    13. Shang, Ronghua & Luo, Shuang & Zhang, Weitong & Stolkin, Rustam & Jiao, Licheng, 2016. "A multiobjective evolutionary algorithm to find community structures based on affinity propagation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 453(C), pages 203-227.
    14. Huizi Gu & Xiaodong Chu, 2020. "Quantifying Topological Flexibility of Active Distribution Networks Based on Community Detection," Energies, MDPI, vol. 13(18), pages 1-21, September.
    15. Xiaofeng Wang & Gongshen Liu & Jianhua Li & Jan P Nees, 2017. "Locating Structural Centers: A Density-Based Clustering Method for Community Detection," PLOS ONE, Public Library of Science, vol. 12(1), pages 1-23, January.
    16. Dhuha Abdulhadi Abduljabbar & Siti Zaiton Mohd Hashim & Roselina Sallehuddin, 2020. "Nature-inspired optimization algorithms for community detection in complex networks: a review and future trends," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 74(2), pages 225-252, June.
    17. Cai, Biao & Wang, Yanpeng & Zeng, Lina & Hu, Yanmei & Li, Hongjun, 2020. "Edge classification based on Convolutional Neural Networks for community detection in complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 556(C).
    18. Huang, Yan & Wan, Jiansong & Huang, Xin, 2019. "Quantitative analysis of financial system fragility based on manifold curvature," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1276-1285.
    19. Seema Rani & Monica Mehrotra, 2019. "Community Detection in Social Networks: Literature Review," Journal of Information & Knowledge Management (JIKM), World Scientific Publishing Co. Pte. Ltd., vol. 18(02), pages 1-28, June.
    20. 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.

    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:510:y:2018:i:c:p:219-232. 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.