Semi-supervised evidential label propagation algorithm for graph data
Abstract
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.
Keywords
Cite
@article{arxiv.1607.08695,
title = {Semi-supervised evidential label propagation algorithm for graph data},
author = {Kuang Zhou and Arnaud Martin and Quan Pan},
journal= {arXiv preprint arXiv:1607.08695},
year = {2016}
}
Comments
in The 4th International Conference on Belief Functions, Sep 2016, Prague, Czech Republic