메뉴 건너뛰기




Volumn 113, Issue 1, 1999, Pages 203-245

Lazy propagation: a junction tree inference algorithm based on lazy evaluation

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; EXPERT SYSTEMS; PROBABILITY DISTRIBUTIONS; SET THEORY;

EID: 0033188793     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00062-4     Document Type: Article
Times cited : (195)

References (33)
  • 2
    • 0025401005 scopus 로고
    • The computational complexity of probabilistic inference using Bayesian belief networks
    • G.F. Cooper, The computational complexity of probabilistic inference using Bayesian belief networks, Artificial Intelligence 42 (2-3) (1990) 393-405.
    • (1990) Artificial Intelligence , vol.42 , Issue.2-3 , pp. 393-405
    • Cooper, G.F.1
  • 3
    • 0001957787 scopus 로고
    • Fast retraction of evidence in a probabilistic expert system
    • R.G. Cowell, A.P. Dawid, Fast retraction of evidence in a probabilistic expert system, Statist. Comput. 2 (1992) 37-40.
    • (1992) Statist. Comput. , vol.2 , pp. 37-40
    • Cowell, R.G.1    Dawid, A.P.2
  • 5
    • 0002829353 scopus 로고
    • Local expression language for probabilistic dependence
    • B. D'Ambrosio, Local expression language for probabilistic dependence, Internat. J. Approx. Reason. 13 (1) (1995) 61-81.
    • (1995) Internat. J. Approx. Reason. , vol.13 , Issue.1 , pp. 61-81
    • D'Ambrosio, B.1
  • 7
    • 0003064380 scopus 로고
    • Applications of a general propagation algorithm for probabilistic expert systems
    • A.P. Dawid, Applications of a general propagation algorithm for probabilistic expert systems, Statist. Comput. 2 (1992) 25-36.
    • (1992) Statist. Comput. , vol.2 , pp. 25-36
    • Dawid, A.P.1
  • 9
    • 85012708436 scopus 로고
    • d-separation: From theorems to algorithms
    • M. Henrion, R.D. Shachter, L.N. Kanal, J.F. Lemmer (Eds.), Elsevier Science, Amsterdam
    • D. Geiger, T.S. Verma, J. Pearl, d-separation: From theorems to algorithms, in: M. Henrion, R.D. Shachter, L.N. Kanal, J.F. Lemmer (Eds.), Uncertainty in Artificial Intelligence 5, Elsevier Science, Amsterdam, 1990, pp. 139-148.
    • (1990) Uncertainty in Artificial Intelligence , vol.5 , pp. 139-148
    • Geiger, D.1    Verma, T.S.2    Pearl, J.3
  • 16
    • 84987047423 scopus 로고
    • An algebra of Bayesian belief universes for knowledge-based systems
    • F.V. Jensen, K.G. Olesen, S.K. Andersen, An algebra of Bayesian belief universes for knowledge-based systems, Networks 20 (1990) 637-659.
    • (1990) Networks , vol.20 , pp. 637-659
    • Jensen, F.V.1    Olesen, K.G.2    Andersen, S.K.3
  • 17
    • 4244181223 scopus 로고    scopus 로고
    • Inference in Bayesian networks using nested junction trees
    • U. Kjærulff, Inference in Bayesian networks using nested junction trees, Learning in Graphical Models 89 (1998) 51-74.
    • (1998) Learning in Graphical Models , vol.89 , pp. 51-74
    • Kjærulff, U.1
  • 18
    • 0001006209 scopus 로고
    • Local computations with probabilities on graphical structures and their application to expert systems
    • S.L. Lauritzen, D.J. Spiegelhalter, Local computations with probabilities on graphical structures and their application to expert systems, J. Roy. Statist. Soc. B. 50 (2) (1988) 157-224.
    • (1988) J. Roy. Statist. Soc. B. , vol.50 , Issue.2 , pp. 157-224
    • Lauritzen, S.L.1    Spiegelhalter, D.J.2
  • 19
    • 0028466297 scopus 로고
    • Efficient inference in Bayes networks as a combinatorial optimization problem
    • Z. Li, B. D'Ambrosio, Efficient inference in Bayes networks as a combinatorial optimization problem, Internat. J. Approx. Reason 11 (1) (1994) 55-81.
    • (1994) Internat. J. Approx. Reason , vol.11 , Issue.1 , pp. 55-81
    • Li, Z.1    D'Ambrosio, B.2
  • 20
    • 0345231638 scopus 로고    scopus 로고
    • Relevant-based sequential evidence processing in Bayesian networks
    • Y. Lin, M.J. Druzdzel, Relevant-based sequential evidence processing in Bayesian networks, in: Proc. 11th International FLAIRS Conference, 1998, pp. 446-450.
    • (1998) Proc. 11th International FLAIRS Conference , pp. 446-450
    • Li, Y.1    Druzdzel, M.J.2
  • 24
    • 0032116450 scopus 로고    scopus 로고
    • Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginals
    • T. Schmidt, P.P. Shenoy, Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginals, Artificial Intelligence 102 (2) (1998) 323-333.
    • (1998) Artificial Intelligence , vol.102 , Issue.2 , pp. 323-333
    • Schmidt, T.1    Shenoy, P.P.2
  • 25
    • 0022818911 scopus 로고
    • Evaluating influence diagrams
    • R. Shachter, Evaluating influence diagrams, Oper. Res. 34 (6) (1986) 871-882.
    • (1986) Oper. Res. , vol.34 , Issue.6 , pp. 871-882
    • Shachter, R.1
  • 26
    • 84986938578 scopus 로고
    • An ordered examination of influence diagrams
    • R.D. Shachter, An ordered examination of influence diagrams, Networks 20 (5) (1990) 535-563.
    • (1990) Networks , vol.20 , Issue.5 , pp. 535-563
    • Shachter, R.D.1
  • 28
    • 0001736479 scopus 로고    scopus 로고
    • Binary join trees for computing marginals in the Shenoy-Shafer architecture
    • P.P. Shenoy, Binary join trees for computing marginals in the Shenoy-Shafer architecture, Internat. J. Approx. Reason. 17 (2-3) (1997) 239-263.
    • (1997) Internat. J. Approx. Reason. , vol.17 , Issue.2-3 , pp. 239-263
    • Shenoy, P.P.1
  • 32
    • 0000049635 scopus 로고    scopus 로고
    • Exploiting causal independence in Bayesian network inference
    • N.L. Zhang, D. Poole, Exploiting causal independence in Bayesian network inference, J. Artificial Intelligence Res. 5 (1996) 301-328.
    • (1996) J. Artificial Intelligence Res. , vol.5 , pp. 301-328
    • Zhang, N.L.1    Poole, D.2


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