TY - JOUR
T1 - Robust Detection of Link Communities with Summary Description in Social Networks
AU - Jin, Di
AU - Wang, Xiaobao
AU - He, Dongxiao
AU - Dang, Jianwu
AU - Zhang, Weixiong
N1 - Funding Information:
This work was supported by the Natural Science Foundation of China (No. 61772361, 61876128) and the National Key R&D Program of China (No. 2017YFC0820106). Di Jin and Xiaobao Wang contributed equally.
Publisher Copyright:
© 1989-2012 IEEE.
PY - 2021/6
Y1 - 2021/6
N2 - Community detection has been extensively studied for various applications. Recent research has started to explore node contents to identify semantically meaningful communities. However, links in real networks typically have semantic descriptions and communities of links can better characterize community behaviors than communities of nodes. The second issue in community finding is that the most existing methods assume network topologies and descriptive contents carry the same or compatible information of node group membership, restricting them to one topic per community, which is generally violated in real networks. The third issue is that the existing methods use top ranked words or phrases to label topics when interpreting communities, which is often inadequate for comprehension. To address these issues altogether, we propose a new Bayesian probabilistic approach for modeling real networks and developing an efficient variational algorithm for model inference. Our new method explores the intrinsic correlation between communities and topics to discover link communities and extract semantically meaningful community summaries at the same time. If desired, it is able to derive more than one topical summary per community to provide rich explanations. We present experimental results to show the effectiveness of our new approach and evaluate the method by a case study.
AB - Community detection has been extensively studied for various applications. Recent research has started to explore node contents to identify semantically meaningful communities. However, links in real networks typically have semantic descriptions and communities of links can better characterize community behaviors than communities of nodes. The second issue in community finding is that the most existing methods assume network topologies and descriptive contents carry the same or compatible information of node group membership, restricting them to one topic per community, which is generally violated in real networks. The third issue is that the existing methods use top ranked words or phrases to label topics when interpreting communities, which is often inadequate for comprehension. To address these issues altogether, we propose a new Bayesian probabilistic approach for modeling real networks and developing an efficient variational algorithm for model inference. Our new method explores the intrinsic correlation between communities and topics to discover link communities and extract semantically meaningful community summaries at the same time. If desired, it is able to derive more than one topical summary per community to provide rich explanations. We present experimental results to show the effectiveness of our new approach and evaluate the method by a case study.
KW - community detection
KW - link communities
KW - Social networks
KW - topical summary
KW - variational algorithm
UR - http://www.scopus.com/inward/record.url?scp=85105889652&partnerID=8YFLogxK
U2 - 10.1109/TKDE.2019.2958806
DO - 10.1109/TKDE.2019.2958806
M3 - Article
AN - SCOPUS:85105889652
SN - 1041-4347
VL - 33
SP - 2737
EP - 2749
JO - IEEE Transactions on Knowledge and Data Engineering
JF - IEEE Transactions on Knowledge and Data Engineering
IS - 6
M1 - 8930274
ER -