Nonparametric Bayesian label prediction on a large graph using truncated Laplacian regularization
From MaRDI portal
Publication:5086360
DOI10.1080/03610918.2019.1634202OpenAlexW2964031272WikidataQ127520366 ScholiaQ127520366MaRDI QIDQ5086360
Jarno Hartog, Harry van Zanten
Publication date: 5 July 2022
Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.07262
Related Items
Continuous-discrete smoothing of diffusions ⋮ Posterior consistency of semi-supervised regression on graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
- Full adaptation to smoothness using randomly truncated series priors with Gaussian coefficients and inverse gamma scaling
- Estimating a smooth function on a large graph by Bayesian Laplacian regularisation
- Fast simulation of truncated Gaussian distributions
- Nonparametric binary regression using a Gaussian process prior
- Statistical analysis of network data. Methods and models
- Reversible jump MCMC for nonparametric drift estimation for diffusion processes
- Nonparametric Bayesian label prediction on a graph
- Uncertainty Quantification in Graph-Based Classification of High Dimensional Data
- Handbook of Markov Chain Monte Carlo
- Learning Theory
- Bayesian Analysis of Binary and Polychotomous Response Data
- Learning Theory and Kernel Machines
- Collective dynamics of ‘small-world’ networks
