Sciweavers

22 search results - page 1 / 5
» Loopy Substructural Local Search for the Bayesian Optimizati...
Sort
View
SLS
2009
Springer
227views Algorithms» more  SLS 2009»
13 years 11 months ago
Loopy Substructural Local Search for the Bayesian Optimization Algorithm
Cláudio F. Lima, Martin Pelikan, Fernando G...
GECCO
2004
Springer
125views Optimization» more  GECCO 2004»
13 years 10 months ago
Population-Based Iterated Local Search: Restricting Neighborhood Search by Crossover
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...
Dirk Thierens
UAI
2003
13 years 6 months ago
On Local Optima in Learning Bayesian Networks
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
Jens D. Nielsen, Tomás Kocka, José M...
NN
2002
Springer
136views Neural Networks» more  NN 2002»
13 years 4 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
ML
2006
ACM
142views Machine Learning» more  ML 2006»
13 years 4 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....