Sciweavers

70 search results - page 9 / 14
» Bottom-Up Learning of Markov Network Structure
Sort
View
JMLR
2006
118views more  JMLR 2006»
13 years 7 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
ECAI
2010
Springer
13 years 5 months ago
Feature Selection by Approximating the Markov Blanket in a Kernel-Induced Space
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
Qiang Lou, Zoran Obradovic
ICDM
2008
IEEE
230views Data Mining» more  ICDM 2008»
14 years 2 months ago
Evolutionary Clustering by Hierarchical Dirichlet Process with Hidden Markov State
This paper studies evolutionary clustering, which is a recently hot topic with many important applications, noticeably in social network analysis. In this paper, based on the rece...
Tianbing Xu, Zhongfei (Mark) Zhang, Philip S. Yu, ...
IJCAI
2007
13 years 9 months ago
Recursive Random Fields
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
Daniel Lowd, Pedro Domingos
NN
1997
Springer
174views Neural Networks» more  NN 1997»
13 years 12 months ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani