arrow
Return

Active link selection for efficient semi-supervised community detection

delete2015-03-12
delete29
delete
OA
AI
L
Liang Yang
D
Di Jin *
X
Xiao Wang
X
Xiaochun Cao
DOI:10.1038/srep09039delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Several semi-supervised community detection algorithms have been proposed recently to improve the performance of traditional topology-based methods. However, most of them focus on how to integrate supervised information with topology information; few of them pay attention to which information is critical for performance improvement. This leads to large amounts of demand for supervised information, which is expensive or difficult to obtain in most fields. For this problem we propose an active link selection framework, that is we actively select the most uncertain and informative links for human labeling for the efficient utilization of the supervised information. We also disconnect the most likely inter-community edges to further improve the efficiency. Our main idea is that, by connecting uncertain nodes to their community hubs and disconnecting the inter-community edges, one can sharpen the block structure of adjacency matrix more efficiently than randomly labeling links as the existing methods did. Experiments on both synthetic and real networks demonstrate that our new approach significantly outperforms the existing methods in terms of the efficiency of using supervised information. It needs similar to 13% of the supervised information to achieve a performance similar to that of the original semi-supervised approaches.
Keywords:
NETWORKS
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Scientific Reports cover
Scientific Reports
IF:
3.9
Papers:
27.4W
Citations:
83.5W

Organization

T
Tianjin University of Commerce
Scholars:
2.5K
Papers: 1.7K
Citations: 2.5K
C
chinese academy of sciences
Scholars:
56.5W
Papers: 44.9W
Citations: 704