.png){kind=icon}
返回
Semi-Supervised Local Community Detection
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2023.3290095.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Owing to the lack of a universal definition of communities, some semi-supervised community detection approaches learn the concept of community structures from known communities, and then dig out communities using learned concepts of communities. In some cases, users are only interested in the community containing a given node. However, communities detected by these semi-supervised approaches may not contain a given node. Besides, these methods traverse the entire network to detect many communities and cost more resources than a local algorithm. Therefore, it is necessary and meaningful to find the local community that contains a given node with prior information on the local network around the given node. We call this a Semi-supervised Local Community Detection (SLCD) problem. In this paper, prior information refers to certain known communities. To address the SLCD problem, we propose the Semi-supervised Local community detection with the Structural Similarity algorithm, called SLSS, which uses some known communities instead of all known communities. The idea of SLSS is to use the structural similarity between the known communities and the detected community, calculated by the graph kernel, to guide the expansion of the community. Experimental results show that SLSS outperforms other algorithms on six real-world datasets.
Keyword:
Community detection
local community detection
semi-supervised local community detection
structural similarity
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
.png){kind=icon}
Palladium and Molybdenum Complexes of the Heteroleptic Organostannylene [2,6-(Me2NCH2)2C6H3]SnCl
PREAI
分享收藏
查看更多内容