SICA : Simulated Iterative Classification - A new larning method for graph labelling - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

SICA : Simulated Iterative Classification - A new larning method for graph labelling

Résumé

Collective classification refers to the classification of interlinked and relational objects described as nodes in a graph. The Iterative Classification Algorithm (ICA) is a simple, efficient and widely used method to solve this problem. It is representative of a family of methods for which inference proceeds as an iterative process: at each step, nodes of the graph are classified according to the current predicted labels of their neighbors. We show that learning in this class of models suffers from a training bias. We propose a new family of methods, called Simulated ICA, which helps reducing this training bias by simulating inference during learning. Several variants of the method are introduced. They are both simple, efficient and scale well. Experiments performed on a series of 7 datasets show that the proposed methods outperform representative state-of-the-art algorithms while keeping a low complexity.

Dates et versions

hal-01298020 , version 1 (05-04-2016)

Identifiants

Citer

Francis Maes, Stephane Peters, Ludovic Denoyer, Patrick Gallinari. SICA : Simulated Iterative Classification - A new larning method for graph labelling. ECML PKDD 2009, Sep 2009, Bled, Slovenia. pp.47-62, ⟨10.1007/978-3-642-04174-7_4⟩. ⟨hal-01298020⟩
57 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More