A semantic overlapping community detection algorithm based on field sampling

被引:31
作者
Xin, Yu [1 ]
Yang, Jing [1 ]
Xie, Zhi-Qiang [2 ]
机构
[1] Harbin Engn Univ, Coll Comp Sci & Technol, Harbin 150001, Heilongjiang, Peoples R China
[2] Harbin Univ Sci & Technol, Coll Comp Sci & Technol, Harbin 150001, Heilongjiang, Peoples R China
基金
新加坡国家研究基金会; 中国国家自然科学基金;
关键词
Semantic social network; Community detection; Overlapping communities; Semantic modularity; NETWORKS;
D O I
10.1016/j.eswa.2014.07.009
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The traditional semantic social network (SSN) community detection algorithms need to preset the number of the communities and could not detect the overlapping communities. To solve the issue of presetting the number of communities, we present a clustering algorithm for community detection based on the link-field-topic (LFT) model suggested. For the process of clustering is independent of context sampling, the number of communities is not necessary to be preset. To solve the issue of overlapping community detection, we establish the semantic link weight (SLW) depending on the analysis of LFT, to evaluate the semantic weight of links for each sampling field. The proposed clustering algorithm is based on the SLW which could separate the SSN into clustering units. As a result, the intersection on several units is the overlapping part. Finally, we establish semantic modularity (SQ) involving SQ1 and SQ2 for the evaluation of the detected semantic communities. The efficiency and feasibility of the LET model and the semantic modularity is verified by experimental analysis. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码:366 / 375
页数:10
相关论文
共 29 条
  • [1] [Anonymous], 2007, 2007 IEEE INT SEC IN
  • [2] [Anonymous], 2004, P 10 ACM SIGKDD INT
  • [3] Latent Dirichlet allocation
    Blei, DM
    Ng, AY
    Jordan, MI
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2003, 3 (4-5) : 993 - 1022
  • [4] Cha YC, 2012, SIGIR 2012: PROCEEDINGS OF THE 35TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, P565, DOI 10.1145/2348283.2348360
  • [5] Community structure in social and biological networks
    Girvan, M
    Newman, MEJ
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2002, 99 (12) : 7821 - 7826
  • [6] Henderson K., 2010, SDM, V2010, P754, DOI DOI 10.1137/1.9781611972801.66
  • [7] Henderson K., 2009, P 2009 ACM S APPL CO, P1456, DOI DOI 10.1145/1529282.1529607
  • [8] A Markov random walk under constraint for discovering overlapping communities in complex networks
    Jin, Di
    Yang, Bo
    Baquero, Carlos
    Liu, Dayou
    He, Dongxiao
    Liu, Jie
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2011,
  • [9] Kemp C., 2006, AAAI, V3, P381, DOI DOI 10.1145/1837026.1837061
  • [10] Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
    Lancichinetti, Andrea
    Fortunato, Santo
    [J]. PHYSICAL REVIEW E, 2009, 80 (01)