723 search results - page 57 / 145 » Learning a Hidden Subgraph |
JMLR
2010
13 years 3 months ago
2010
We introduce a simple order-based greedy heuristic for learning discriminative structure within generative Bayesian network classifiers. We propose two methods for establishing an...
JMLR
2010
13 years 3 months ago
2010
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...
IUI
2004
ACM
14 years 2 months ago
2004
ACM
Technical support procedures are typically very complex. Users often have trouble following printed instructions describing how to perform these procedures, and these instructions...
NIPS
1998
13 years 10 months ago
1998
The Expectation Maximization EM algorithm is an iterative procedure for maximum likelihood parameter estimation from data sets with missing or hidden variables 2 . It has been app...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...