메뉴 건너뛰기




Volumn 4724 LNAI, Issue , 2007, Pages 501-511

Inference and learning in multi-dimensional Bayesian network classifiers

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MATHEMATICAL MODELS; POLYNOMIALS;

EID: 38049160416     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75256-1_45     Document Type: Conference Paper
Times cited : (56)

References (10)
  • 3
    • 0025401005 scopus 로고
    • The computational complexity of probabilistic inference using Bayesian belief networks
    • Cooper, G.F.: The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence 42, 393-405 (1990)
    • (1990) Artificial Intelligence , vol.42 , pp. 393-405
    • Cooper, G.F.1
  • 7
    • 70350674995 scopus 로고
    • On the shortest spanning subtree of a graph and the travelling salesman problem
    • Kruskal, J.B.: On the shortest spanning subtree of a graph and the travelling salesman problem. Proc. Amer. Math. Soc. 7, 48-50 (1956)
    • (1956) Proc. Amer. Math. Soc , vol.7 , pp. 48-50
    • Kruskal, J.B.1
  • 8
    • 4744353182 scopus 로고    scopus 로고
    • Restricted Bayesian network structure learning
    • Gámez, G.A, Moral, S, Salmerón, A, eds, Springer, Heidelberg
    • Lucas, P.J.F.: Restricted Bayesian network structure learning. In: Gámez, G.A., Moral, S., Salmerón, A. (eds.) Advances in Bayesian Network, Studies in Fuzziness and Soft Computing, vol. 146, pp. 217-232. Springer, Heidelberg (2004)
    • (2004) Advances in Bayesian Network, Studies in Fuzziness and Soft Computing , vol.146 , pp. 217-232
    • Lucas, P.J.F.1


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