Switch to: Citations

Add references

You must login to add references.
  1. Heuristic greedy search algorithms for latent variable models.Peter Spirtes - unknown
    A Bayesian network consists of two distinct parts: a directed acyclic graph (DAG or belief-network structure) and a set of parameters for the DAG. The DAG in a Bayesian network can be used to represent both causal hypotheses and sets of probability distributions. Under the causal interpretation, a DAG represents the causal relations in a given population with a set of vertices V when there is an edge from A to B if and only if A is a direct cause (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Causality From Probability.Peter Spirtes, Clark Glymour & Rcihard Scheines - unknown
    Peter Spirtes, Clark Glymour and Richard Scheines. Causality From Probability.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • An Algorithm for Fast Recovery of Sparse Causal Graphs.Peter Spirtes - unknown
    Previous asymptotically correct algorithms for recovering causal structure from sample probabilities have been limited even in sparse graphs to a few variables. We describe an asymptotically correct algorithm whose complexity for fixed graph connectivity increases polynomially in the number of vertices, and may in practice recover sparse graphs with several hundred variables. From..
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Strong-Completeness and Faithfulness in Belief Networks.Christopher Meek - unknown
    Chris Meek. Strong-Completeness and Faithfulness in Belief Networks.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Learning Bayesian networks from data: An information-theory based approach.Jie Cheng, Russell Greiner, Jonathan Kelly, David Bell & Weiru Liu - 2002 - Artificial Intelligence 137 (1-2):43-90.
    Download  
     
    Export citation  
     
    Bookmark   3 citations