Graph-Based Semi-Supervised Learning and Spectral Kernel Design
From MaRDI portal
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
Cited in
(27)- Semi-supervised graph clustering: a kernel approach
- Generalization performance of graph-based semi-supervised classification
- Transfer kernel common spatial patterns for motor imagery brain-computer interface classification
- Semi-supervised learning based on high density region estimation
- Generalization errors of Laplacian regularized least squares regression
- Learning to rank on graphs
- An efficient algorithm for learning to rank from preference graphs
- Efficient learning of supervised kernels with a graph-based loss function
- Semi-supervised inference: general theory and estimation of means
- Error bounds of multi-graph regularized semi-supervised classification
- On the choice of kernel and labelled data in semi-supervised learning methods
- On the effectiveness of Laplacian normalization for graph semi-supervised learning
- Gaussian processes classification combined with semi-supervised kernels
- 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
- Convergence rate of the semi-supervised greedy algorithm
- Contextual explanation networks
- A Comparative Study of Pairwise Learning Methods Based on Kernel Ridge Regression
- Semi-Supervised Linear Regression
- Semi-supervised inference for case-control binary data under possibly mis-specified logistic models
- A General M-estimation Theory in Semi-Supervised Framework
- Supervised neighborhood graph construction for semi-supervised classification
- Solving the missing at random problem in semi-supervised learning: an inverse probability weighting method
- Efficient semiparametric estimation in two-sample comparison via semisupervised learning
- Smoothed estimation on optimal treatment regime under semisupervised setting in randomized trials
- Empirical stationary correlations for semi-supervised learning 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)
