Search Constraints

Start Over
Filtering by: Creator Kapuscinski, Pearl B. Remove constraint Creator: Kapuscinski, Pearl B. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Heuristic search in symbolic probability inference

    Creator:
    Pan, Yonghong
    Abstract:
    I present a new heuristic search approach to compute approximate answers for the probability query in belief nets. This approach can compute the 'best' bounds for a query in a period of any given time (if time permitted, it will get an exact value). It inherits the essence of Symbolic...
    Resource Type:
    Capstone Project
    Full Text:
    reduction algorithm [Shachter, 1986, 1989], and Pearl's message passing algorithm [Pearl,1988]. Both of

  • Optimal inference with local expressions

    Creator:
    Borujerdi, Mohammad
    Abstract:
    Probabilistic inference using Bayesian networks is now a well-established approach for reasoning under uncertainty. Among many e ciency-driven tech- niques which have been developed, the Optimal Factoring Problem (OFP) is distinguished for presenting a combinatorial optimization point of view on the problem. The contribution of this thesis is to extend...
    Resource Type:
    Dissertation
    Full Text:
    dependence of D on A and B, following Pearl (Pearl, 1988): P (D = t) = 1� (1� cA(D))(1� cB(D)) P (D = f

  • Analytical Methods for Improving Causal Inference

    Creator:
    Sinha, Meghamala
    Abstract:
    Causal inference is an important analytical tool to bridge the gap between prediction and decision-making. However, learning a causal network solely from data is a challenging task. In this work, various techniques have been explored for a better and improved causal network learning from data. Firstly, the problem of learning...
    Resource Type:
    Dissertation
    Full Text:
    a red arrow be- tween Vi and Vj), and false negative edges (shown in (b) as blue arrows between Vi

  • A factoring approach for probabilistic inference in belief networks

    Creator:
    Li, Zhaoyu
    Abstract:
    Reasoning about any realistic domain always involves a degree of uncertainty. Probabilistic inference in belief networks is one effective way of reasoning under uncertainty. Efficiency is critical in applying this technique, and many researchers have been working on this topic. This thesis is the report of our research in this...
    Resource Type:
    Dissertation
    Full Text:
    MPE for nodes b and c. 89 10. The evaluation tree of querying p(e) given f = 1 in the simple belief

  • Object highlighting : real-time boundary detection using a Bayesian network

    Creator:
    Jia, Jin
    Abstract:
    Image segmentation continues to be a fundamental problem in computer vision and image understanding. In this thesis, we present a Bayesian network that we use for object boundary detection in which the MPE (most probable explanation) before any evidence can produce multiple non-overlapping, non-self-intersecting closed contours and the MPE with...
    Resource Type:
    Masters Thesis
    Full Text:
    ) (b) Figure 3.2: Examples of Tobogganing and weighted graph creation. (a) The original 256x256 block