Sciweavers

22 search results - page 2 / 5
» Loopy Substructural Local Search for the Bayesian Optimizati...
Sort
View
AUSAI
2004
Springer
13 years 11 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
JMLR
2002
102views more  JMLR 2002»
13 years 5 months ago
Optimal Structure Identification With Greedy Search
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
David Maxwell Chickering
ICPR
2008
IEEE
14 years 6 months ago
Exploiting qualitative domain knowledge for learning Bayesian network parameters with incomplete data
When a large amount of data are missing, or when multiple hidden nodes exist, learning parameters in Bayesian networks (BNs) becomes extremely difficult. This paper presents a lea...
Qiang Ji, Wenhui Liao
UAI
2000
13 years 6 months ago
Exploiting Qualitative Knowledge in the Learning of Conditional Probabilities of Bayesian Networks
Algorithms for learning the conditional probabilities of Bayesian networks with hidden variables typically operate within a high-dimensional search space and yield only locally op...
Frank Wittig, Anthony Jameson
ICIP
2005
IEEE
13 years 11 months ago
Robust face alignment based on local texture classifiers
We propose a robust face alignment algorithm with a novel discriminative local texture model. Different from the conventional descriptive PCA local texture model in ASM, classifie...
Li Zhang, Haizhou Ai, Shengjun Xin, Chang Huang, S...