메뉴 건너뛰기




Volumn , Issue , 2008, Pages 161-168

Almost optimal intervention sets for causal discovery

Author keywords

[No Author keywords available]

Indexed keywords

CAUSAL GRAPH; DIRECTED ACYCLIC GRAPHS; MARKOV EQUIVALENCE CLASS; OPTIMAL INTERVENTION; WORST CASE; WORST-CASE ANALYSIS;

EID: 80053288073     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (53)

References (13)
  • 1
    • 0042967741 scopus 로고    scopus 로고
    • Optimal structure identification with greedy search
    • D. M. Chickering (2002). Optimal structure identification with greedy search. Journal of Machine Learning Research, 3:507-554.
    • (2002) Journal of Machine Learning Research , vol.3 , pp. 507-554
    • Chickering, D.M.1
  • 3
    • 38049120159 scopus 로고    scopus 로고
    • On the number of experiments suficient and in the worst case necessary to identify all causal relations among N variables
    • F. Bacchus and T. Jaakkola (ed.). AUAI Press, Corvallis, Oregon
    • F. Eberhardt, C. Glymour, and R. Scheines (2005). On the number of experiments suficient and in the worst case necessary to identify all causal relations among N variables. In F. Bacchus and T. Jaakkola (ed.), Proceedings of the 21 st Conference on Uncertainty and Artificial Intelligence, 178-184. AUAI Press, Corvallis, Oregon.
    • (2005) Proceedings of the 21 St Conference on Uncertainty and Artificial Intelligence , pp. 178-184
    • Eberhardt, F.1    Glymour, C.2    Scheines, R.3
  • 4
    • 80053287825 scopus 로고    scopus 로고
    • PhD thesis, Carnegie Mellon University, Pittsburgh, PA
    • F. Eberhardt (2007). Causation and Intervention, PhD thesis, Carnegie Mellon University, Pittsburgh, PA.
    • (2007) Causation and Intervention
    • Eberhardt, F.1
  • 5
    • 0014700727 scopus 로고
    • Graphs with monochromatic complete subgraphs in every edge coloring
    • J. Folkman (1970). Graphs with monochromatic complete subgraphs in every edge coloring. SIAM Journal on Applied Mathematics, 18, No. 1:19-24.
    • (1970) SIAM Journal on Applied Mathematics , vol.18 , Issue.1 , pp. 19-24
    • Folkman, J.1
  • 6
    • 84893574327 scopus 로고
    • Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    • M. X. Goemans and D. P. Williamson (1995). Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42,6:1115-1145.
    • (1995) Journal of the ACM , vol.42 , Issue.6 , pp. 1115-1145
    • Goemans, M.X.1    Williamson, D.P.2
  • 10
    • 0004213845 scopus 로고    scopus 로고
    • Oxford University Press
    • J. Pearl (2000). Causality. Oxford University Press.
    • (2000) Causality
    • Pearl, J.1


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