• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Zhu Mu, Meng Fanrong, and Zhou Yong. Density-Based Link Clustering Algorithm for Overlapping Community Detection[J]. Journal of Computer Research and Development, 2013, 50(12): 2520-2530.
Citation: Zhu Mu, Meng Fanrong, and Zhou Yong. Density-Based Link Clustering Algorithm for Overlapping Community Detection[J]. Journal of Computer Research and Development, 2013, 50(12): 2520-2530.

Density-Based Link Clustering Algorithm for Overlapping Community Detection

More Information
  • Published Date: December 14, 2013
  • For detecting overlapping communities efficiently and effectively in various real-world social networks, we propose a novel density-based link clustering algorithm called DBLINK. The proposed algorithm firstly partitions the edge set of the network into disjoint link communities, which will be then transformed into the final node communities. The overlapping nodes will be linked with the edges that are assigned into different link communities. Furthermore, for obtaining the overlapping community structure with high quality and without excessive overlap, DBLINK utilizes the density-based algorithm as the clustering method for the edge set, which has the ability of identifying the isolated edges that are not satisfied with certain conditions and assigning them into no-link community. An empirical evaluation of the method using both synthetic and real datasets demonstrates that DBLINK not only has satisfying time efficiency, but also plays better performance than the state-of-the-art methods at the community detection quality aspect.
  • Related Articles

    [1]Liu Yanfang, Li Wenbin, Gao Yang. Adaptive Neighborhood Embedding Based Unsupervised Feature Selection[J]. Journal of Computer Research and Development, 2020, 57(8): 1639-1649. DOI: 10.7544/issn1000-1239.2020.20200219
    [2]Yao Sheng, Xu Feng, Zhao Peng, Ji Xia. Intuitionistic Fuzzy Entropy Feature Selection Algorithm Based on Adaptive Neighborhood Space Rough Set Model[J]. Journal of Computer Research and Development, 2018, 55(4): 802-814. DOI: 10.7544/issn1000-1239.2018.20160919
    [3]Zhang Yuanpeng, Deng Zhaohong, Chung Fu-lai, Hang Wenlong, Wang Shitong. Fast Self-Adaptive Clustering Algorithm Based on Exemplar Score Strategy[J]. Journal of Computer Research and Development, 2018, 55(1): 163-178. DOI: 10.7544/issn1000-1239.2018.20160937
    [4]Gu Lianchao, Cui Lizhen. A Scalable and Self-Adjust Multi-Tenant Data Storage Strategy Under Different SLAs[J]. Journal of Computer Research and Development, 2014, 51(9): 2058-2069. DOI: 10.7544/issn1000-1239.2014.20131339
    [5]Bi Xiaojun, Liu Guo'an, Xiao Jing. Dynamic Adaptive Differential Evolution Based on Novel Mutation Strategy[J]. Journal of Computer Research and Development, 2012, 49(6): 1288-1297.
    [6]Gong Maoguo, Cheng Gang, Jiao Licheng, and Liu Chao. Nondominated Individual Selection Strategy Based on Adaptive Partition for Evolutionary Multi-Objective Optimization[J]. Journal of Computer Research and Development, 2011, 48(4): 545-557.
    [7]Fan Xiaoqin, Jiang Changjun, Fang Xianwen, Ding Zhijun. Dynamic Web Service Selection Based on Discrete Particle Swarm Optimization[J]. Journal of Computer Research and Development, 2010, 47(1): 147-156.
    [8]Zeng Zhiqiang, Wu Qun, Liao Beishui, Zhu Shunzhi. An Improved Working Set Selection Strategy for Sequential Minimal Optimization Algorithm[J]. Journal of Computer Research and Development, 2009, 46(11): 1925-1933.
    [9]Liu Anfeng, Chen Zhigang, Long Guoping, and Zeng Zhiwen. A Resource Optimizing Scheduling Algorithm of Differentiated Service of Double Minimum Balance in Web Clusters[J]. Journal of Computer Research and Development, 2005, 42(11): 1969-1976.
    [10]Xu Mingwei, Hu Chunming, Liu Xudong, and Ma Dianfu. Research and Implementation of Web Service Differentiated QoS[J]. Journal of Computer Research and Development, 2005, 42(4): 669-675.

Catalog

    Article views (1679) PDF downloads (1195) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return