Nonparametric Bayesian label prediction on a graph

Jarno Hartog, Harry van Zanten*

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

28 Downloads (Pure)

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.

Original languageEnglish
Pages (from-to)111-131
Number of pages21
JournalComputational Statistics and Data Analysis
Volume120
Early online date6 Dec 2017
DOIs
Publication statusPublished - Apr 2018

Keywords

  • Bayesian nonparametrics
  • Binary classification
  • Graph

Fingerprint

Dive into the research topics of 'Nonparametric Bayesian label prediction on a graph'. Together they form a unique fingerprint.

Cite this