Error bounds of multi-graph regularized semi-supervised classification
DOI10.1016/J.INS.2009.01.007zbMATH Open1192.68509OpenAlexW2066171225MaRDI QIDQ2390331FDOQ2390331
Authors: Hong Chen, Luoqing Li, Jiangtao Peng 
Publication date: 22 July 2009
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2009.01.007
Recommendations
- Generalization performance of graph-based semi-supervised classification
- Error analysis for the sparse graph-based semi-supervised classification algorithm
- Learning Theory
- Generalization errors of Laplacian regularized least squares regression
- Generalization error bounds in semi-supervised classification under the cluster assumption
reproducing kernel Hilbert spaceTikhonov regularizationRademacher complexitysemi-supervised learninggraph Laplacian
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Cites Work
- Theory of Reproducing Kernels
- Learning Theory
- On the mathematical foundations of learning
- Title not available (Why is that?)
- Title not available (Why is that?)
- Support vector machine soft margin classifiers: error analysis
- 10.1162/153244303321897690
- Learning the kernel matrix with semidefinite programming
- Learning the kernel function via regularization
- Semi-supervised learning on Riemannian manifolds
- Open problems of Paul Erd�s in graph theory
- Multi-kernel regularized classifiers
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- On the effectiveness of Laplacian normalization for graph semi-supervised learning
- Graph-Based Semi-Supervised Learning and Spectral Kernel Design
- Learning Theory
- Stable Transductive Learning
Cited In (16)
- Error analysis for the sparse graph-based semi-supervised classification algorithm
- Learning Theory
- Adaptive multiple graph regularized semi-supervised extreme learning machine
- Regularized least square regression with spherical polynomial kernels
- DISTANCE-RATIO LEARNING FOR DATA VISUALIZATION
- Rademacher complexity bounds for a penalized multi-class semi-supervised algorithm
- Convergence rate of the semi-supervised greedy algorithm
- Hypergraph regularized semi-supervised support vector machine
- Weighted co-association rate-based Laplacian regularized label description for semi-supervised regression
- Consensus rate-based label propagation for semi-supervised classification
- On the convergence rate of kernel-based sequential greedy regression
- Generalization performance of graph-based semi-supervised classification
- Semi-supervised learning based on high density region estimation
- Graph-based semi-supervised learning by mixed label propagation with a soft constraint
- Classifier learning with a new locality regularization method
- ANALYSIS OF CLASSIFICATION WITH A REJECT OPTION
Uses Software
This page was built for publication: Error bounds of multi-graph regularized semi-supervised classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390331)
