Consistent semi-supervised graph regularization for high dimensional data
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7008335
- Semi-supervised learning with regularized Laplacian
- Generalization performance of graph-based semi-supervised classification
- On the effectiveness of Laplacian normalization for graph semi-supervised learning
- The performance of semi-supervised Laplacian regularized regression with the least square loss
Cites work
- scientific article; zbMATH DE number 1022658 (Why is no real title available?)
- scientific article; zbMATH DE number 2080487 (Why is no real title available?)
- scientific article; zbMATH DE number 7008335 (Why is no real title available?)
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
- Consistency of spectral clustering
- Kernel spectral clustering of large dimensional data
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- On the behavior of intrinsically high-dimensional spaces: distances, direct and reverse nearest neighbors, and hubness
- On the effectiveness of Laplacian normalization for graph semi-supervised learning
- Random matrix methods for wireless communications.
- Spectral analysis of the Gram matrix of mixture models
- Weighted nonlocal Laplacian on interpolation from sparse data
This page was built for publication: Consistent semi-supervised graph regularization for high dimensional data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999023)