Graph-Based Semi-Supervised Learning and Spectral Kernel Design
DOI10.1109/TIT.2007.911294zbMATH Open1304.68147OpenAlexW2147454001MaRDI QIDQ3604414FDOQ3604414
Authors: Rie Johnson, Tong Zhang 
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2007.911294
Recommendations
- Semi-supervised graph clustering: a kernel approach
- Semi-supervised learning with regularized Laplacian
- Generalization performance of graph-based semi-supervised classification
- On the choice of kernel and labelled data in semi-supervised learning methods
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
Nonparametric regression and quantile regression (62G08) Learning and adaptive systems in artificial intelligence (68T05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational learning theory (68Q32)
Cited In (24)
- A General M-estimation Theory in Semi-Supervised Framework
- Semi-supervised inference for case-control binary data under possibly mis-specified logistic models
- Transfer kernel common spatial patterns for motor imagery brain-computer interface classification
- On the regularized Laplacian eigenmaps
- Semi-Supervised Linear Regression
- Gaussian processes classification combined with semi-supervised kernels
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- Error bounds for \(l^p\)-norm multiple kernel learning with least square loss
- Title not available (Why is that?)
- On the effectiveness of Laplacian normalization for graph semi-supervised learning
- Convergence rate of the semi-supervised greedy algorithm
- Semi-supervised graph clustering: a kernel approach
- Generalization errors of Laplacian regularized least squares regression
- Efficient learning of supervised kernels with a graph-based loss function
- On the choice of kernel and labelled data in semi-supervised learning methods
- Empirical stationary correlations for semi-supervised learning on graphs
- Generalization performance of graph-based semi-supervised classification
- Semi-supervised inference: general theory and estimation of means
- Semi-supervised learning based on high density region estimation
- An efficient algorithm for learning to rank from preference graphs
- A Comparative Study of Pairwise Learning Methods Based on Kernel Ridge Regression
- Supervised neighborhood graph construction for semi-supervised classification
- Error bounds of multi-graph regularized semi-supervised classification
- Learning to rank on graphs
This page was built for publication: Graph-Based Semi-Supervised Learning and Spectral Kernel Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604414)
