메뉴 건너뛰기




Volumn 16, Issue , 2015, Pages 2589-2609

Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs

Author keywords

Causality; Directed acyclic graphs; Markov equivalence class; Size distribution

Indexed keywords

DIRECTED GRAPHS; FUNCTIONS; GRAPH THEORY; INFORMATION DISSEMINATION; SIZE DISTRIBUTION;

EID: 84961666299     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (64)

References (20)
  • 1
    • 0031531764 scopus 로고    scopus 로고
    • A characterization of Markov equivalence classes for acyclic digraphs
    • S. A. Andersson, D. Madigan, and M. D. Perlman. A characterization of Markov equivalence classes for acyclic digraphs. The Annals of Statistics, 25(2):505-541, 1997.
    • (1997) The Annals of Statistics , vol.25 , Issue.2 , pp. 505-541
    • Andersson, S.A.1    Madigan, D.2    Perlman, M.D.3
  • 3
    • 0042496103 scopus 로고    scopus 로고
    • Learning equivalence classes of Bayesian-network structures
    • D. M. Chickering. Learning equivalence classes of Bayesian-network structures. The Journal of Machine Learning Research, 2:445-498, 2002.
    • (2002) The Journal of Machine Learning Research , vol.2 , pp. 445-498
    • Chickering, D.M.1
  • 4
    • 84871641723 scopus 로고    scopus 로고
    • Robust graphical modeling of gene networks using classical and alternative t-distributions
    • M. Finegold and M. Drton. Robust graphical modeling of gene networks using classical and alternative t-distributions. The Annals of Applied Statistics, 5(2A):1057-1080, 2011.
    • (2011) The Annals of Applied Statistics , vol.5 , Issue.2 , pp. 1057-1080
    • Finegold, M.1    Drton, M.2
  • 5
    • 0842288337 scopus 로고    scopus 로고
    • Inferring cellular networks using probabilistic graphical models
    • N. Friedman. Inferring cellular networks using probabilistic graphical models. Science Signaling, 303(5659):799, 2004.
    • (2004) Science Signaling , vol.303 , Issue.5659 , pp. 799
    • Friedman, N.1
  • 6
    • 0036783875 scopus 로고    scopus 로고
    • The size distribution for Markov equivalence classes of acyclic digraph models
    • S.B. Gillispie and M.D. Perlman. The size distribution for Markov equivalence classes of acyclic digraph models. Artificial Intelligence, 141(1-2):137-155, 2002.
    • (2002) Artificial Intelligence , vol.141 , Issue.1-2 , pp. 137-155
    • Gillispie, S.B.1    Perlman, M.D.2
  • 7
    • 57249084023 scopus 로고    scopus 로고
    • Active learning of causal networks with intervention experiments and optimal designs
    • Yangbo He and Zhi Geng. Active learning of causal networks with intervention experiments and optimal designs. Journal of Machine Learning Research, 9:2523-2547, 2008.
    • (2008) Journal of Machine Learning Research , vol.9 , pp. 2523-2547
    • He, Y.1    Geng, Z.2
  • 8
    • 84885027886 scopus 로고    scopus 로고
    • Reversible mcmc on markov equivalence classes of sparse directed acyclic graphs
    • Yangbo He, Jinzhu Jia, and Bin Yu. Reversible mcmc on markov equivalence classes of sparse directed acyclic graphs. The Annals of Statistics, 41(4):1742-1779, 2013a.
    • (2013) The Annals of Statistics , vol.41 , Issue.4 , pp. 1742-1779
    • He, Y.1    Jia, J.2    Yu, B.3
  • 12
    • 69949166983 scopus 로고    scopus 로고
    • Estimating high-dimensional intervention effects from observational data
    • ISSN 0090-5364
    • M. H. Maathuis, M. Kalisch, and P. Bühlmann. Estimating high-dimensional intervention effects from observational data. The Annals of Statistics, 37(6A):3133-3164, 2009. ISSN 0090-5364.
    • (2009) The Annals of Statistics , vol.37 , Issue.6 , pp. 3133-3164
    • Maathuis, M.H.1    Kalisch, M.2    Bühlmann, P.3
  • 14
    • 33745620137 scopus 로고    scopus 로고
    • Learning causal Bayesian networks from observations and experiments: A decision theoretic approach
    • Springer
    • S. Meganck, P. Leray, and B. Manderick. Learning causal bayesian networks from observations and experiments: A decision theoretic approach. In Modeling Decisions for Artificial Intelligence, pages 58-69. Springer, 2006.
    • (2006) Modeling Decisions for Artificial Intelligence , pp. 58-69
    • Meganck, S.1    Leray, P.2    Manderick, B.3
  • 16
    • 84961641527 scopus 로고    scopus 로고
    • Graphical model search via essential graphs
    • M.D. Perlman. Graphical model search via essential graphs. Contemporary Mathematics, 287:255-266, 2001.
    • (2001) Contemporary Mathematics , vol.287 , pp. 255-266
    • Perlman, M.D.1
  • 18
    • 0021473698 scopus 로고
    • Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
    • R. E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13:566, 1984.
    • (1984) SIAM Journal on Computing , vol.13 , pp. 566
    • Tarjan, R.E.1    Yannakakis, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.