Nonparametric Bayesian label prediction on a graph
From MaRDI portal
Abstract: An implementation of a nonparametric Bayesian approach to solving binary classification problems on graphs is described. A hierarchical Bayesian approach with a randomly scaled Gaussian prior is considered. The prior uses the graph Laplacian to take into account the underlying geometry of the graph. A method based on a theoretically optimal prior and a more flexible variant using partial conjugacy are proposed. Two simulated data examples and two examples using real data are used in order to illustrate the proposed methods.
Recommendations
- Nonparametric Bayesian label prediction on a large graph using truncated Laplacian regularization
- Nonparametric graphical models
- A Bayesian nonparametric model for multi-label learning
- Bayesian inference in nonparanormal graphical models
- Labelled Graphical Models
- Predicting the labels of an unknown graph via adaptive exploration
- Nonparametric network models for link prediction
- Bayesian structure learning in graphical models
- scientific article; zbMATH DE number 5769726
- Mathematical Foundations of Graph-Based Bayesian Semi-Supervised Learning
Cites work
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- An introduction to the theory of graph spectra
- Bayesian Analysis of Binary and Polychotomous Response Data
- Collective dynamics of `small-world' networks
- Estimating a smooth function on a large graph by Bayesian Laplacian regularisation
- Kernels and regularization on graphs.
- Learning Theory
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- Nonparametric binary regression using a Gaussian process prior
- Statistical analysis of network data. Methods and models
Cited in
(7)- Posterior consistency of semi-supervised regression on graphs
- The truncated variational model for image labeling and graph partitioning
- Predicting the labels of an unknown graph via adaptive exploration
- On the consistency of graph-based Bayesian semi-supervised learning and the scalability of sampling algorithms
- Minimax lower bounds for function estimation on graphs
- Uncertainty quantification in graph-based classification of high dimensional data
- Nonparametric Bayesian label prediction on a large graph using truncated Laplacian regularization
This page was built for publication: Nonparametric Bayesian label prediction on a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662125)
