Skip to Main content Skip to Navigation
Journal articles

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 metadata

Cited literature [38 references]  Display  Hide  Download
Contributor : Konstantin Avrachenkov Connect in order to contact the contributor
Submitted on : Friday, November 24, 2017 - 6:30:30 PM
Last modification on : Tuesday, November 17, 2020 - 12:10:13 PM


Files produced by the author(s)




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⟩



Record views


Files downloads