Consistency of semi-supervised learning algorithms on graphs: probit and one-hot methods
From MaRDI portal
Recommendations
- On the consistency of graph-based Bayesian semi-supervised learning and the scalability of sampling algorithms
- Large data and zero noise limits of graph-based semi-supervised learning algorithms
- Generalization performance of graph-based semi-supervised classification
- Posterior consistency of semi-supervised regression on graphs
- Learning Theory
Cites work
- A modern maximum-likelihood theory for high-dimensional logistic regression
- A variational approach to the consistency of spectral clustering
- An explicit link between Gaussian fields and Gaussian Markov random fields: the stochastic partial differential equation approach
- Analysis of p-Laplacian regularization in semisupervised learning
- Analysis of support vector machine classification
- Consistency of spectral clustering
- Consistency of spectral clustering in stochastic block models
- Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
- Differentiable measures and the Malliavin calculus
- Diffuse Interface Models on Graphs for Classification of High Dimensional Data
- Diffusion maps
- Gaussian processes for machine learning.
- scientific article; zbMATH DE number 3720679 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Introduction to algorithms.
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Large data and zero noise limits of graph-based semi-supervised learning algorithms
- Learning Theory
- Log-concave probability and its applications
- Log-concavity and strong log-concavity: a review
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- On a kernel-based method for pattern recognition, regression, approximation, and operator inversion
- On the consistency of multiclass classification methods
- On the influence of the kernel on the consistency of support vector machines
- Robustness and regularization of support vector machines
- Spectral partitioning works: planar graphs and finite element meshes
- The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression
- Uncertainty quantification in graph-based classification of high dimensional data
Cited in
(6)- Spectral analysis of weighted Laplacians arising in data clustering
- The one-inclusion graph algorithm is near-optimal for the prediction model of learning
- Posterior consistency of semi-supervised regression on graphs
- Consistency of semi-supervised learning algorithms on graphs: Probit and one-hot methods
- Model change active learning in graph-based semi-supervised learning
- Graph Laplacian-based Bayesian multi-fidelity modeling
This page was built for publication: Consistency of semi-supervised learning algorithms on graphs: probit and one-hot methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148978)
