#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2010

2015

- This year (0)
- Last 5 years (5)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Cyril Furtlehner, Yufei Han, Jean-Marc Lasgouttes, Victorin Martin
- ArXiv
- 2012

We investigate different ways of generating approximate solutions to the pairwise Markov random field (MRF) selection problem. We focus mainly on the inverse Ising problem, but discuss also the somewhat related inverse Gaussian problem because both types of MRF are suitable for inference tasks with the belief propagation algorithm (BP) under certain… (More)

- Cyril Furtlehner, Yufei Han, Jean-Marc Lasgouttes, Victorin Martin, Fabrice Marchal, Fabien Moutarde
- 13th International IEEE Conference on Intelligent…
- 2010

We propose a set of methods aiming at extracting large scale features of road traffic, both spatial and temporal, based on local traffic indexes computed either from fixed sensors or floating car data. The approach relies on traditional data mining techniques like clustering or statistical analysis and is demonstrated on data artificially generated by the… (More)

- Victorin Martin, Jean-Marc Lasgouttes, Cyril Furtlehner
- ArXiv
- 2011

An important part of problems in statistical physics and computer science can be expressed as the computation of marginal probabilities over a Markov Random Field. The belief propagation algorithm, which is an exact procedure to compute these marginals when the underlying graph is a tree, has gained its popularity as an efficient way to approximate them in… (More)

- Victorin Martin, Jean-Marc Lasgouttes, Cyril Furtlehner
- STAIRS
- 2012

A number of problems in statistical physics and computer science can be expressed as the computation of marginal probabilities over a Markov random field. Belief propagation, an iterative message-passing algorithm, computes exactly such marginals when the underlying graph is a tree. But it has gained its popularity as an efficient way to approximate them in… (More)

- Victorin Martin, Cyril Furtlehner, Yufei Han, Jean-Marc Lasgouttes
- ECML/PKDD
- 2014

We investigate the problem of Gaussian Markov random field selection under a non-analytic constraint: the estimated models must be compatible with a fast inference algorithm, namely the Gaussian belief propagation algorithm. To address this question, we introduce the ?-IPS framework, based on iterative proportional scaling, which incrementally selects… (More)

- Victorin Martin, Jean-Marc Lasgouttes, Cyril Furtlehner
- ArXiv
- 2013

In this paper we will review some properties of the “belief propagation” iterative map used to perform Bayesian inference in a distributed way. We use this algorithm as a starting point to address the inverse problem of encoding observation data into a probabilistic model. and focus on the situation when the data have many different statistical components,… (More)

- Victorin Martin, Jean-Marc Lasgouttes, Cyril Furtlehner
- Annals of Mathematics and Artificial Intelligence
- 2015

We present a novel method for online inference of real-valued quantities on a large network from very sparse measurements. The target application is a large scale system, like e.g. a traffic network, where a small varying subset of the variables is observed, and predictions about the other variables have to be continuously updated. A key feature of our… (More)

- ‹
- 1
- ›