Semi-supervised Learning with Regularized Laplacian - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2015

Semi-supervised Learning with Regularized Laplacian

L'Apprentissage Semi-supervise avec Laplacian Regularise

Abstract

We study a semi-supervised learning method based on the similarity graph and Regularized Laplacian. We give convenient optimization formulation of the Regularized Laplacian method and establish its various properties. In particular, we show that the kernel of the method can be interpreted in terms of discrete and continuous time random walks and possesses several important properties of proximity measures. Both optimization and linear algebra methods can be used for efficient computation of the classification functions. We demonstrate on numerical examples that the Regularized Laplacian method is competitive with respect to the other state of the art semi-supervised learning methods.
Fichier principal
Vignette du fichier
RR-8765.pdf (571.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01184812 , version 1 (17-08-2015)

Identifiers

Cite

Konstantin Avrachenkov, Pavel Chebotarev, Alexey Mishenin. Semi-supervised Learning with Regularized Laplacian. [Research Report] RR-8765, Inria Sophia Antipolis; INRIA. 2015. ⟨hal-01184812⟩
112 View
216 Download

Altmetric

Share

Gmail Facebook X LinkedIn More