Error analysis for the sparse graph-based semi-supervised classification algorithm
From MaRDI portal
Recommendations
- Generalization performance of graph-based semi-supervised classification
- Error bounds of multi-graph regularized semi-supervised classification
- Generalization errors of Laplacian regularized least squares regression
- Convergence rate of the semi-supervised greedy algorithm
- Performance analysis of the LapRSSLG algorithm in learning theory
Cites work
- A neurocomputing model for the elastoplasticity
- ANALYSIS OF CLASSIFICATION WITH A REJECT OPTION
- Error bounds of multi-graph regularized semi-supervised classification
- Generalization errors of Laplacian regularized least squares regression
- Generalization performance of graph-based semi-supervised classification
- Generalization performance of multi-category kernel machines
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- Learning rates of least-square regularized regression
- Learning Theory
- On the rate of convergence for multi-category classification based on convex losses
Cited in
(8)- Generalization performance of graph-based semi-supervised classification
- Noise-robust semi-supervised learning via fast sparse coding
- Error bounds of multi-graph regularized semi-supervised classification
- The convergence rate of semi-supervised regression with quadratic loss
- The performance of semi-supervised Laplacian regularized regression with the least square loss
- Research on semi-supervised learning via non-symmetric sparse graph
- On the effectiveness of Laplacian normalization for graph semi-supervised learning
- Convergence rate of the semi-supervised greedy algorithm
This page was built for publication: Error analysis for the sparse graph-based semi-supervised classification algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867970)