메뉴 건너뛰기




Volumn 15, Issue , 2001, Pages 383-389

Finding a path is harder than finding a tree

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MAXIMUM LIKELIHOOD ESTIMATION; POLYNOMIALS; PROBLEM SOLVING;

EID: 1142266735     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.914     Document Type: Article
Times cited : (29)

References (12)
  • 1
    • 0026321407 scopus 로고
    • Statistical methods for multipoint radiation hybrid mapping
    • Boehnke, M., Lange, K., & Cox, D. (1991). Statistical methods for multipoint radiation hybrid mapping. American Journal of Human Genetics, 49, 1174-1188.
    • (1991) American Journal of Human Genetics , vol.49 , pp. 1174-1188
    • Boehnke, M.1    Lange, K.2    Cox, D.3
  • 2
    • 0001019707 scopus 로고    scopus 로고
    • Learning Bayesian networks is NP-complete
    • Fisher, D., & Lenz, H. (Eds.), Springer-Verlag
    • Chickering, D. (1996). Learning Bayesian networks is NP-complete. In Fisher, D., & Lenz, H. (Eds.), Learning from Data, pp. 121-130. Springer-Verlag.
    • (1996) Learning from Data , pp. 121-130
    • Chickering, D.1
  • 3
    • 84933530882 scopus 로고
    • Approximating discrete probability distributions with dependence trees
    • Chow, C., & Liu, C. (1968). Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14, 462-467.
    • (1968) IEEE Transactions on Information Theory , vol.14 , pp. 462-467
    • Chow, C.1    Liu, C.2
  • 4
    • 34249832377 scopus 로고
    • A Bayesian method for the induction of probabilistic networks from data
    • Cooper, G., & Herskovits, E. (1992). A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9, 309-347.
    • (1992) Machine Learning , vol.9 , pp. 309-347
    • Cooper, G.1    Herskovits, E.2
  • 6
    • 0001228487 scopus 로고
    • Optimum branching
    • Edmonds, J. (1967). Optimum branching. J. Res. NBS, 71B, 233-240.
    • (1967) J. Res. NBS , vol.71 B , pp. 233-240
    • Edmonds, J.1
  • 8
    • 0002370418 scopus 로고    scopus 로고
    • A tutorial on learning with Bayesian networks
    • Jordan, M. (Ed.), Kluwer Academic Publishers
    • Heckerman, D. (1998). A tutorial on learning with Bayesian networks. In Jordan, M. (Ed.), Learning in Graphical Models, pp. 301-354. Kluwer Academic Publishers.
    • (1998) Learning in Graphical Models , pp. 301-354
    • Heckerman, D.1
  • 9
    • 34249761849 scopus 로고
    • Learning Bayesian networks: The combination of knowledge and statistical data
    • Heckerman, D., Geiger, D., & Chickering, D. (1995). Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20, 197-243.
    • (1995) Machine Learning , vol.20 , pp. 197-243
    • Heckerman, D.1    Geiger, D.2    Chickering, D.3
  • 10
    • 34250461535 scopus 로고
    • The traveling-salesman problem and minimum spanning trees: Part ii
    • Karp, R., & Held, M. (1971). The traveling-salesman problem and minimum spanning trees: Part ii. Mathematical Programming, 1, 6-25.
    • (1971) Mathematical Programming , vol.1 , pp. 6-25
    • Karp, R.1    Held, M.2


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