Semi-supervised evidential label propagation algorithm for graph data - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Semi-supervised evidential label propagation algorithm for graph data

Résumé

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.
Fichier principal
Vignette du fichier
SELP_belief2016.pdf (314.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01349851 , version 1 (29-07-2016)

Identifiants

Citer

Kuang Zhou, Arnaud Martin, Quan Pan. Semi-supervised evidential label propagation algorithm for graph data. BELIEF 2016 - The 4th International Conference on Belief Functions, Sep 2016, Prague, Czech Republic. ⟨hal-01349851⟩
250 Consultations
417 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More