期刊
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
卷 34, 期 10, 页码 5051-5055出版社
IEEE COMPUTER SOC
DOI: 10.1109/TKDE.2020.3047224
关键词
Signed graph; k-core; balanced triangle
类别
资金
- ZJNSF [LQ20F020007]
- [NSFC61802345]
This paper addresses the problem of community detection in social networks, specifically considering signed graphs. The proposed stable k-core model measures the stability of a community by considering both user engagement and eliminating unstable structures. The paper also introduces novel pruning strategies and searching methods to handle large graphs.
Community detection is one of the most fundamental problems in social network analysis, while most existing research focuses on unsigned graphs. In real applications, social networks involve not only positive relationships but also negative ones. It is important to exploit the signed information to identify more stable communities. In this paper, we propose a novel model, named stable k-core, to measure the stability of a community in signed graphs. The stable k-core model not only emphasizes user engagement, but also eliminates unstable structures. We show that the problem of finding the maximum stable k-core is NP-hard. To scale for large graphs, novel pruning strategies and searching methods are proposed. We conduct extensive experiments on 6 real-world signed networks to verify the efficiency and effectiveness of proposed model and techniques.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据