Maximum Likelihood for Gaussians on Graphs

DOI10.1007/978-3-642-20844-7_7zbMATH Open1381.62225OpenAlexW1559936271MaRDI QIDQ3003446FDOQ3003446

Brijnesh J. Jain, Klaus Obermayer

Publication date: 27 May 2011

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20844-7_7

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Bayesian inference (62F15) Multivariate analysis (62H99) Learning and adaptive systems in artificial intelligence (68T05) Applications of graph theory (05C90)

Cited In (8)

• Title not available (Why is that?)
• Iterative maximum likelihood on networks
• First order Gaussian graphs for efficient structure classification
• Constrained likelihood for reconstructing a directed acyclic Gaussian graph
• On generating random Gaussian graphical models
• Likelihood theory for the graph Ornstein-Uhlenbeck process
• The graph matching problem
• Multiple Matrix Gaussian Graphs Estimation

This page was built for publication: Maximum Likelihood for Gaussians on Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003446)