Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

NIPS
2003

favoriteEmaildiscussreport

124views Information Technology» more NIPS 2003»

Denoising and Untangling Graphs Using Degree Priors

13 years 6 months ago

Denoising and Untangling Graphs Using Degree Priors

Download books.nips.cc

This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that includes degree-based structure priors on the hidden graphs. Exact inference in the model is intractable; we present an eﬃcient approximate inference algorithm to compute edge appearance posteriors. We evaluate our model and algorithm on a biological graph inference problem.

Quaid Morris, Brendan J. Frey

Real-time Traffic

Graph Inference Problem | Hidden Graphs | NIPS 2003 | NIPS 2007 | Untangling Hidden Graphs |

claim paper

Related Content

» A Bayesian Graph Clustering Approach Using the Prior Based on Degree Distribution

» Exact Graph Structure Estimation with Degree Priors

» Continuous graph cuts for priorbased object segmentation

» A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothnes...

» SpatioTemporal Markov Random Field for Video Denoising

» Primaldual meets local search approximating MSTs with nonuniform degree bounds

» On degrees in random triangulations of point sets

» On the minimum node degree and connectivity of a wireless multihop network

» Variational Bayesian image processing on stochastic factor graphs

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2003
Where	NIPS
Authors	Quaid Morris, Brendan J. Frey

Comments (0)