On the effectiveness of Laplacian normalization for graph semi-supervised learning
From MaRDI portal
Recommendations
- Generalization performance of graph-based semi-supervised classification
- Properly-weighted graph Laplacian for semi-supervised learning
- Semi-supervised learning with regularized Laplacian
- Error analysis for the sparse graph-based semi-supervised classification algorithm
- Graph-Based Semi-Supervised Learning and Spectral Kernel Design
Cited in
(16)- On multi-view learning with additive models
- Generalization performance of graph-based semi-supervised classification
- Minimax lower bounds for function estimation on graphs
- Semi-supervised learning based on high density region estimation
- Generalization errors of Laplacian regularized least squares regression
- Graph signal interpolation with positive definite graph basis functions
- Error bounds of multi-graph regularized semi-supervised classification
- Exploiting Cluster-Structure to Predict the Labeling of a Graph
- On the regularized Laplacian eigenmaps
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- Convergence rate of the semi-supervised greedy algorithm
- Quadratic decomposable submodular function minimization: theory and practice
- scientific article; zbMATH DE number 7370577 (Why is no real title available?)
- Consistent semi-supervised graph regularization for high dimensional data
- Generalization analysis of Fredholm kernel regularized classifiers
- Locally supported, quasi-interpolatory bases for the approximation of functions on graphs
This page was built for publication: On the effectiveness of Laplacian normalization for graph semi-supervised learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174127)
