Sciweavers

9 search results - page 2 / 2
» Feature Selection by Approximating the Markov Blanket in a K...
Sort
View
SARA
2005
Springer
13 years 10 months ago
Feature-Discovering Approximate Value Iteration Methods
Sets of features in Markov decision processes can play a critical role ximately representing value and in abstracting the state space. Selection of features is crucial to the succe...
Jia-Hong Wu, Robert Givan
BMCBI
2010
178views more  BMCBI 2010»
13 years 5 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
JMLR
2011
148views more  JMLR 2011»
12 years 12 months ago
Bayesian Generalized Kernel Mixed Models
We propose a fully Bayesian methodology for generalized kernel mixed models (GKMMs), which are extensions of generalized linear mixed models in the feature space induced by a repr...
Zhihua Zhang, Guang Dai, Michael I. Jordan
UAI
2000
13 years 6 months ago
Being Bayesian about Network Structure
In many domains, we are interested in analyzing the structure of the underlying distribution, e.g., whether one variable is a direct parent of the other. Bayesian model selection a...
Nir Friedman, Daphne Koller