SELP: Semi-supervised evidential label propagation algorithm for graph data clustering

Abstract : With the increasing size of social networks in the real world, community detection approaches should be fast and accurate. The label propagation algorithm is known to be one of the near-linear solutions which is easy to implement. However, it is not stable and it cannot take advantage of the prior information about the network structure which is very common in real applications. In this paper, a new Semi-supervised clustering approach based on an Evidential Label Propagation strategy (SELP) is proposed to incorporate limited domain knowledge into the community detection model. The main advantage of SELP is that it can effectively use limited supervised information to guide the detection process. The prior information about the labels of nodes in the graph, including the labeled nodes and the unlabeled ones, is initially expressed in the form of mass functions. Then the evidential label propagation rule is designed to propagate the labels from the labeled nodes to the unlabeled ones. The communities of each node can be identified after the propagation process becomes stable. The outliers can be identified to be in a special class. Experimental results demonstrate the effectiveness of SELP on both graphs and classical data sets.
Type de document :
Article dans une revue
International Journal of Approximate Reasoning, Elsevier, 2018, 92, pp.139-154. 〈10.1016/j.ijar.2017.09.008〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01668379
Contributeur : Kuang Zhou <>
Soumis le : mercredi 20 décembre 2017 - 16:02:55
Dernière modification le : mardi 24 avril 2018 - 13:29:20