Sciweavers

106 search results - page 1 / 22
» The max-min hill-climbing Bayesian network structure learnin...
Sort
View
ML
2006
ACM
142views Machine Learning» more  ML 2006»
13 years 5 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....
IPL
2008
172views more  IPL 2008»
13 years 5 months ago
Approximation algorithms for restricted Bayesian network structures
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k. Key words: approximation algorithm,...
Valentin Ziegler
JMLR
2010
113views more  JMLR 2010»
13 years 8 days ago
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
Kaname Kojima, Eric Perrier, Seiya Imoto, Satoru M...
UAI
1998
13 years 6 months ago
The Bayesian Structural EM Algorithm
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
Nir Friedman
ITRE
2005
IEEE
13 years 11 months ago
Structure learning of Bayesian networks using a semantic genetic algorithm-based approach
A Bayesian network model is a popular technique for data mining due to its intuitive interpretation. This paper presents a semantic genetic algorithm (SGA) to learn a complete qual...
Sachin Shetty, Min Song