Semi-supervised Learning with Regularized Laplacian - Archive ouverte HAL Access content directly
Journal Articles Optimization Methods and Software Year : 2017

Semi-supervised Learning with Regularized Laplacian

(1) , (2) , (3)
1
2
3

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 robust with respect to the choice of the regularization parameter and outperforms the Laplacian-based heat kernel methods.
Fichier principal
Vignette du fichier
RegLap9.pdf (508.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01648135 , version 1 (24-11-2017)

Identifiers

Cite

Konstantin Avrachenkov, Pavel Chebotarev, Alexey Mishenin. Semi-supervised Learning with Regularized Laplacian. Optimization Methods and Software, 2017, 32 (2), pp. 222 - 236. ⟨10.1080/10556788.2016.1193176⟩. ⟨hal-01648135⟩
107 View
607 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More