Log In Sign Up

Semi-supervised evidential label propagation algorithm for graph data

by   Kuang Zhou, et al.

In the task of community detection, there often exists some useful prior information. In this paper, a Semi-supervised clustering approach using a new Evidential Label Propagation strategy (SELP) is proposed to incorporate the domain knowledge into the community detection model. The main advantage of SELP is that it can take limited supervised knowledge to guide the detection process. The prior information of community labels is expressed in the form of mass functions initially. Then a new evidential label propagation rule is adopted to propagate the labels from labeled data to unlabeled ones. The outliers can be identified to be in a special class. The experimental results demonstrate the effectiveness of SELP.


page 1

page 2

page 3

page 4


Evidential Label Propagation Algorithm for Graphs

Community detection has attracted considerable attention crossing many a...

SMACD: Semi-supervised Multi-Aspect Community Detection

Community detection in real-world graphs has been shown to benefit from ...

ArcAid: Analysis of Archaeological Artifacts using Drawings

Archaeology is an intriguing domain for computer vision. It suffers not ...

Selecting a suitable Parallel Label-propagation based algorithm for Disjoint Community Detection

Community detection is an essential task in network analysis as it helps...

Semi-Supervised Clustering of Sparse Graphs: Crossing the Information-Theoretic Threshold

The stochastic block model is a canonical random graph model for cluster...

Label Propagation for Learning with Label Proportions

Learning with Label Proportions (LLP) is the problem of recovering the u...

Active Community Detection: A Maximum Likelihood Approach

We propose novel semi-supervised and active learning algorithms for the ...