Consistent Semi-Supervised Graph Regularization for High Dimensional Data - CentraleSupélec Access content directly
Journal Articles Journal of Machine Learning Research Year : 2021

Consistent Semi-Supervised Graph Regularization for High Dimensional Data

Abstract

Semi-supervised Laplacian regularization, a standard graph-based approach for learning from both labelled and unlabelled data, was recently demonstrated to have an insignificant high dimensional learning efficiency with respect to unlabelled data (Mai and Couillet, 2018), causing it to be outperformed by its unsupervised counterpart, spectral clustering, given sufficient unlabelled data. Following a detailed discussion on the origin of this inconsistency problem, a novel regularization approach involving centering operation is proposed as solution, supported by both theoretical analysis and empirical results.

Dates and versions

hal-03689888 , version 1 (07-06-2022)

Licence

Attribution

Identifiers

Cite

Xiaoyi Mai, Romain Couillet. Consistent Semi-Supervised Graph Regularization for High Dimensional Data. Journal of Machine Learning Research, 2021, 22 (1), pp.4181-4228. ⟨10.5555/3546258.3546352⟩. ⟨hal-03689888⟩
54 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More