106 search results - page 11 / 22 » The max-min hill-climbing Bayesian network structure learnin... |
134
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
109
Voted
IWINAC
2007
Springer
15 years 9 months ago
2007
Springer
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
139
Voted
JMLR
2010
14 years 10 months ago
2010
A continuous time Bayesian network (CTBN) uses a structured representation to describe a dynamic system with a finite number of states which evolves in continuous time. Exact infe...
132
click to vote
ICMLA
2007
15 years 4 months ago
2007
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
117
Voted
UAI
2004
15 years 4 months ago
2004
In recent years, there is a growing interest in learning Bayesian networks with continuous variables. Learning the structure of such networks is a computationally expensive proced...