(Enter summary)
Abstract: Algorithms for learning Bayesian networks from data have two components: a scoring metric and a
search procedure. The scoring metric computes a score reflecting the goodness-of-fit of the structure
to the data. The search procedure tries to identify network structures with high scores. Heckerman
et al. (1995) introduce a Bayesian metric, called the BDe metric, that computes the relative posterior
probability of a network structure given data. In this paper, we show that the search problem of... (Update)
Cited by: More
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 52, NO. 8.. - Stationary Time Series
(Correct)
Increasing Feasibility of Optimal Gene Network Estimation - Hansen, Ott, Koentges (2004)
(Correct)
Inference of Gene Regulatory Networks by Means of Dynamic.. - Sugimoto, Iba (2004)
(Correct)
Similar documents (at the sentence level):
54.8%: Learning Bayesian Networks is NP-Hard - Chickering, Geiger, Heckerman (1994)
(Correct)
Active bibliography (related documents): More All
0.5: Learning Equivalence Classes Of Bayesian Network Structures - Chickering (1996)
(Correct)
0.2: Learning Bayesian Networks - Heckerman, Geiger (1995)
(Correct)
0.2: Graphs, Causality, And Structural Equation Models - Pearl (1998)
(Correct)
Similar documents based on text: More All
0.2: INOH: A Textual Knowledge Based Pathway Database - Yamamoto, Kushida, Ono.. (2003)
(Correct)
0.1: Optimal Structure Identification with Greedy Search - Chickering (2002)
(Correct)
0.1: Learning the Structure of Dynamic Probabilistic Networks - Nir Friedman (1998)
(Correct)
Related documents from co-citation: More All
24: Learning Bayesian networks: The combination of knowledge and statistical data
- Heckerman, Geiger et al. - 1995
21: A Bayesian method for the induction of probabilistic networks from data (context) - Cooper, Herskovits - 1992
14: Approximating Discrete Probability Distributions with Dependence Trees (context) - Chow, Liu - 1968
BibTeX entry: (Update)
D.M. Chickering, "Learning bayesian networks is np-complete", Submitted to Proceedings of AI and Statistics, 1995. http://citeseer.ist.psu.edu/article/chickering96learning.html More
@misc{ chickering95learning,
author = "D. Chickering",
title = "Learning bayesian networks is np-complete",
text = "D.M. Chickering, Learning bayesian networks is np-complete, Submitted to
Proceedings of AI and Statistics, 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/article/chickering96learning.html" }
Citations (may not include all citations):
4212
Computers and intractability: A guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
416
A Bayesian method for the induction of probabilistic network.. (context) - Cooper, Herskovits - 1992
12
Learning and robust learning of product distributions (context) - Hoffgen - 1993
4
A Transformational characterization of Bayesian network stru.. (context) - Chickering - 1995
4
Learning discrete Bayesian networks (context) - Heckerman, Geiger et al. - 1995
2
Some NP-complete problems on graphs (context) - Garvil - 1977
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.vuse.vanderbilt.edu/~dfisher/ai-stat-book/contents.html): More
A Comparative Evaluation of Sequential Feature Selection.. - Aha, Bankert (1995)
(Correct)
Heuristic Search for Model Structure: the Benefits of.. - Elder, IV (1996)
(Correct)
A Causal Calculus for Statistical Research - Pearl (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC