Semi-supervised evidential label propagation algorithm for graph data

Kuang Zhou, Arnaud Martin, Quan Pan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish
Title of host publicationBelief Functions
Subtitle of host publicationTheory and Applications - 4th International Conference, BELIEF 2016, Proceedings
EditorsJiřina Vejnarová, Václav Kratochvíl
PublisherSpringer Verlag
Pages123-133
Number of pages11
ISBN (Print)9783319455587
DOIs
StatePublished - 2016
Event4th International Conference on Belief Functions: Theory and Applications, BELIEF 2016 - Prague, Czech Republic
Duration: 21 Sep 201623 Sep 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9861 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Belief Functions: Theory and Applications, BELIEF 2016
Country/TerritoryCzech Republic
CityPrague
Period21/09/1623/09/16

Keywords

  • Belief function theory
  • Community detection
  • Label propagation
  • Semi-supervised learning

Fingerprint

Dive into the research topics of 'Semi-supervised evidential label propagation algorithm for graph data'. Together they form a unique fingerprint.

Cite this