Graph-Based Semi-Supervised Learning and Spectral Kernel Design
From MaRDI portal
Publication:3604414
DOI10.1109/TIT.2007.911294zbMath1304.68147OpenAlexW2147454001MaRDI QIDQ3604414
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
Nonparametric regression and quantile regression (62G08) Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Error bounds of multi-graph regularized semi-supervised classification ⋮ Generalization errors of Laplacian regularized least squares regression ⋮ Semi-Supervised Linear Regression ⋮ On the regularized Laplacian eigenmaps ⋮ 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 ⋮ Unnamed Item ⋮ Learning to rank on graphs ⋮ An efficient algorithm for learning to rank from preference graphs ⋮ Convergence rate of the semi-supervised greedy algorithm ⋮ Transfer kernel common spatial patterns for motor imagery brain-computer interface classification ⋮ A Comparative Study of Pairwise Learning Methods Based on Kernel Ridge Regression ⋮ Semi-supervised learning based on high density region estimation ⋮ Semi-supervised inference: general theory and estimation of means ⋮ Unnamed Item ⋮ Generalization performance of graph-based semi-supervised classification
This page was built for publication: Graph-Based Semi-Supervised Learning and Spectral Kernel Design
