Semi-supervised Learning with Regularized Laplacian

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.
Complete list of metadatas

Cited literature [38 references]  Display  Hide  Download

https://hal.inria.fr/hal-01648135
Contributor : Konstantin Avrachenkov <>
Submitted on : Friday, November 24, 2017 - 6:30:30 PM
Last modification on : Friday, January 12, 2018 - 5:55:11 PM

File

RegLap9.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

147

Files downloads

402