International audienceIn this paper, we tackle the problem of generative learning of dynamic models from”fat” time series data (high #variables/#individuals ratio), leading to a high sensitivity of learnedmodels to the dataset noise. To overcome this problem, we propose a method computing a mixtureof many highly biased but optimal spanning arborescences obtained from many perturbed versionsof the original dataset, introducing variance to counterbalance the strong arborescence bias. Themethod is theoretically at the boundary between structure oriented Bayesian model averagingand recent work on density estimation using mixtures of poly-trees through a perturb and combineframework, transposed to a dynamic setting. In practice, preliminary resu...
We propose a new non-homogeneous dynamic Bayesian network with partially segment-wise sequentially c...
A current challenge for data management systems is to support the construction and maintenance of ma...
The rising interest around tractable Probabilistic Graphical Models is due to the guarantees on inf...
International audienceIn this paper, we tackle the problem of generative learning of dynamic models ...
Motivation: We focus on the problem of learning generative Gene Regulatory Network structures from s...
International audienceIn this work we explore the Perturb and Combine idea celebrated in supervised ...
peer reviewedWe consider randomization schemes of the Chow-Liu algorithm from weak (bagging, of quad...
International audienceIn this work we explore the Perturb and Combine idea, celebrated in supervised...
Abstract—The motivation for this paper is to apply Bayesian structure learning using Model Averaging...
In the Probabilistic Graphical Model (PGM) community there is an interest around tractable models, i...
Dyadic data are ubiquitous and arise in the fields of biology, epidemiology, sociology, and many mor...
Background: Considerable progress has been made on algorithms for learning the structure of Bayesian...
Estimating a sequence of dynamic undirected graphical models, in which adjacent graphs share similar...
A Bayesian network is a widely used probabilistic graphical model with applications in knowledge dis...
In this paper we consider the problem of performing Bayesian model-averaging over a class of discre...
We propose a new non-homogeneous dynamic Bayesian network with partially segment-wise sequentially c...
A current challenge for data management systems is to support the construction and maintenance of ma...
The rising interest around tractable Probabilistic Graphical Models is due to the guarantees on inf...
International audienceIn this paper, we tackle the problem of generative learning of dynamic models ...
Motivation: We focus on the problem of learning generative Gene Regulatory Network structures from s...
International audienceIn this work we explore the Perturb and Combine idea celebrated in supervised ...
peer reviewedWe consider randomization schemes of the Chow-Liu algorithm from weak (bagging, of quad...
International audienceIn this work we explore the Perturb and Combine idea, celebrated in supervised...
Abstract—The motivation for this paper is to apply Bayesian structure learning using Model Averaging...
In the Probabilistic Graphical Model (PGM) community there is an interest around tractable models, i...
Dyadic data are ubiquitous and arise in the fields of biology, epidemiology, sociology, and many mor...
Background: Considerable progress has been made on algorithms for learning the structure of Bayesian...
Estimating a sequence of dynamic undirected graphical models, in which adjacent graphs share similar...
A Bayesian network is a widely used probabilistic graphical model with applications in knowledge dis...
In this paper we consider the problem of performing Bayesian model-averaging over a class of discre...
We propose a new non-homogeneous dynamic Bayesian network with partially segment-wise sequentially c...
A current challenge for data management systems is to support the construction and maintenance of ma...
The rising interest around tractable Probabilistic Graphical Models is due to the guarantees on inf...