Logarithmic-Time Updates and Queries in Probabilistic Networks

@article{Delcher1995LogarithmicTimeUA,
  title={Logarithmic-Time Updates and Queries in Probabilistic Networks},
  author={Arthur L. Delcher and Adam J. Grove and Simon Kasif and Judea Pearl},
  journal={J. Artif. Intell. Res.},
  year={1995},
  volume={4},
  pages={37-59}
}
  • Arthur L. Delcher, Adam J. Grove, +1 author Judea Pearl
  • Published in UAI 1995
  • Computer Science
  • In this paper we propose a dynamic data structure that supports efficient algorithms for updating and querying singly connected Bayesian networks (causal trees and polytrees). In the conventional algorithm, new evidence is absorbed in time O(1) and queries are processed in time O(N), where N is the size of the network. We propose a practical algorithm which, after a preprocessing phase, allows us to answer queries in time O(log N) at the expense of O(log N) time per evidence absorption. The… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 25 CITATIONS

    Efficient Prediction for Tree Markov Random Fields in a Streaming Model

    VIEW 7 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Adaptive Bayesian inference

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Adaptive Exact Inference in Graphical Models

    VIEW 3 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Adaptive Inference on Probabilistic Relational Models

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Efficient algorithms for online learning over graphs

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    Learning and Exploiting Relational Structure for Efficient Inference

    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    Online Sum-Product Computation Over Trees

    VIEW 1 EXCERPT
    CITES METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 27 REFERENCES

    Absolute orientation from uncertain point data: a unified approach

    • Yacov Hel-Or, Michael Werman
    • Computer Science
    • Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
    • 1992
    VIEW 13 EXCERPTS
    HIGHLY INFLUENTIAL

    A data structure for dynamically maintaining rooted trees

    VIEW 1 EXCERPT