Logarithmic-time updates and queries in probabilistic networks

Journal of Artificial Intelligence Research

Volumn 4, Issue , 1996, Pages 37-59

  Delcher, Arthur L ^a   Grove, Adam J ^b   Kasif, Simon ^c   Pearl, Judea ^d  

^a LOYOLA UNIVERSITY MARYLAND   (United States)

^b NEC LABORATORIES AMERICA   (United States)

^c Johns Hopkins University   (United States)

^d Engineering IV   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DATABASE SYSTEMS; NEURAL NETWORKS; PROBABILITY; REAL TIME SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

BAYESIAN NETWORKS; COMPUTATIONAL BIOLOGY; DYNAMIC REASONING; UPDATE PROCEDURE;

ARTIFICIAL INTELLIGENCE;

EID: 0029678859     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.238     Document Type: Article

References (24)

1. Berger, T., & Ye, Z. (1990). Entropic aspects of random fields on trees. IEEE Trans, on Information Theory, 36(5), 1006-1018.
2. Chelberg, D. M. (1990). Uncertainty in interpretation of range imagery. In Proc. Intern. Conference on Computer Vision, pp. 654-657.
3. Cohen, R. F., & Tamassia, R. (1991). Dynamic trees and their applications. In Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms, pp. 52-61.
4. Cooper, G. (1990). The computational complexity of probabilistic inference using bayes belief networks. Artificial Intelligence, 42, 393-405.
5. Delcher, A., & Kasif, S. (1992). Improved decision making in game trees: Recovering from pathology. In Proceedings of the 1992 National Conference on Artificial Intelligence.
6. Delcher, A. L., Kasif, S., Goldberg, H. R., & Hsu, B. (1993). Probabilistic prediction of protein secondary structure using causal networks. In Proceedings of 1993 International Conference on Intelligent Systems for Computational Biology, pp. 316-321.
7. Duda, R., & Hart, P. (1973). Pattern Classification and Scene Analysis. Wiley, New York.
8. Feldman, J. A., & Ballard, D. (1982). Connectionist models and their properties. Cognitive Science, 6, 205-254.
9. Frederickson, G. N. (1993). A data structure for dynamically maintaining rooted trees. In Proc. 4th Annual Symposium on Discrete Algorithms, pp. 175-184.
10. Hel-Or, Y., & Werman, M. (1992). Absolute orientation from uncertain data: A unified approach. In Proc. Intern. Conference on Computer Vision and Pattern Recognition, pp. 77-82.
11. Karp, R. M., & Ramachandran, V. (1990). Parallel algorithms for shared-memory machines. In Van Leeuwen, J. (Ed.), Handbook of Theoretical Computer Science, pp. 869-941. North-Holland.
12. Kasif, S. (1990). On the parallel complexity of discrete relaxation in constraint networks. Artificial Intelligence, 45, 275-286.
13. Kasif, S., & Delcher, A. (1994). Analysis of local consistency in parallel constraint networks. Artificial Intelligence, 69.
14. Kosaraju, S. R., & Delcher, A. L. (1988). Optimal parallel evaluation of tree-structured computations by raking. In Reif, J. H. (Ed.), VLSI Algorithms and Architectures: Proceedings of 1988 Aegean Workshop on Computing, pp. 101-110. Springer Verlag. LNCS 319.
15. Lauritzen, S., & Spiegelhalter, D. (1988). Local computations with probabilities on graphical structures and their applications to expert systems. J. Royal Statistical Soc. Ser. B, 50, 157-224.
16. Mani, D., & Shastri, L. (1994). Massively parallel reasoning with very large knowledge bases. Tech. rep., Intern. Computer Science Institute.
17. Miller, G. L., & Reif, J. (1985). Parallel tree contraction and its application. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pp. 478-489.
18. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann.
19. Peot, M. A., & Shachter, R. D. (1991). Fusion and propagation with multiple observations in belief networks. Artificial Intelligence, 48, 299-318.
20. Rachlin, J., Kasif, S., Salzberg, S., & Aha, D. (1994). Towards a better understanding of memory-based and bayesian classifiers. In Proceedings of the Eleventh International Conference on Machine Learning, pp. 242-250 New Brunswick, NJ.
21. Shastri, L. (1993). A computational model of tractable reasoning: Taking inspiration from cognition. In Proceeding of the 1993 Intern. Joint Conference on Artificial Intelligence. AAAI.
22. Spiegelhalter, D., Dawid, A., Lauritzen, S., & Cowell, R. (1993). Bayesian analysis in expert systems. Statistical Science, 8(3), 219-283.
23. Stanfill, C., & Waltz, D. (1986). Toward memory-based reasoning. Communications of the ACM, 29(12), 1213-1228.
24. Wilsky, A. (1993). Multiscale representation of markov random fields. IEEE Trans. Signal Processing, 41, 3377-3395.