Error bounds of multi-graph regularized semi-supervised classification

DOI10.1016/J.INS.2009.01.007MaRDI QIDQ2390331zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

reproducing kernel Hilbert spaceTikhonov regularizationRademacher complexitysemi-supervised learninggraph Laplacian

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

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

Cites work

• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• 10.1162/153244303321897690
• Graph-Based Semi-Supervised Learning and Spectral Kernel Design
• Learning Theory
• Learning Theory
• Learning the kernel function via regularization
• Learning the kernel matrix with semidefinite programming
• Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
• Multi-kernel regularized classifiers
• On the effectiveness of Laplacian normalization for graph semi-supervised learning
• On the mathematical foundations of learning
• Open problems of Paul Erd�s in graph theory
• Semi-supervised learning on Riemannian manifolds
• Stable Transductive Learning
• Support vector machine soft margin classifiers: error analysis
• Theory of Reproducing Kernels

Cited in

(16)

• ANALYSIS OF CLASSIFICATION WITH A REJECT OPTION
• 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

Describes a project that uses

Uses Software

• UCI

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)