Maximum likelihood for gaussians on graphs

  • Authors:
  • Brijnesh J. Jain;Klaus Obermayer

  • Affiliations:
  • Berlin Institute of Technology, Germany;Berlin Institute of Technology, Germany

  • Venue:
  • GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show that extending the Gaussian distribution to the domain of graphs corresponds to truncated Gaussian distributions in Euclidean spaces. Based on this observation, we derive a maximum likelihood method for estimating the parameters of the Gaussian on graphs. In conjunction with a naive Bayes classifier, we applied the proposed approach to image classification.