Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Recursive Conditioning). Showing records 1 – 2 of 2 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Saskatchewan

1. Grant, Kevin John. Conditioning graphs: practical structures for inference in bayesian networks.

Degree: 2007, University of Saskatchewan

Probability is a useful tool for reasoning when faced with uncertainty. Bayesian networks offer a compact representation of a probabilistic problem, exploiting independence amongst variables that allows a factorization of the joint probability into much smaller local probability distributions.The standard approach to probabilistic inference in Bayesian networks is to compile the graph into a join­tree, and perform computation over this secondary structure. While join­trees are among the most time­efficient methods of inference in Bayesian networks, they are not always appropriate for certain applications. The memory requirements of join­tree can be prohibitively large. The algorithms for computing over join­trees are large and involved, making them difficult to port to other systems or be understood by general programmers without Bayesian network expertise. This thesis proposes a different method for probabilistic inference in Bayesian networks. We present a data structure called a conditioning graph, which is a run­time representation of Bayesian network inference. The structure mitigates many of the problems of join­tree inference. For example, conditioning graphs require much less space to store and compute over. The algorithm for calculating probabilities from a conditioning graph is small and basic, making it portable to virtually any architecture. And the details of Bayesian network inference are compiled away during the construction of the conditioning graph, leaving an intuitive structure that is easy to understand and implement without any Bayesian network expertise. In addition to the conditioning graph architecture, we present several improvements to the model, that maintain its small and simplistic style while reducing the runtime required for computing over it. We present two heuristics for choosing variable orderings that result in shallower elimination trees, reducing the overall complexity of computing over conditioning graphs. We also demonstrate several compile and runtime extensions to the algorithm, that can produce substantial speedup to the algorithm while adding a small space constant to the implementation. We also show how to cache intermediate values in conditioning graphs during probabilistic computation, that allows conditioning graphs to perform at the same speed as standard methods by avoiding duplicate computation, at the price of more memory. The methods presented also conform to the basic style of the original algorithm. We demonstrate a novel technique for reducing the amount of required memory for caching. We demonstrate empirically the compactness, portability, and ease of use of conditioning graphs. We also show that the optimizations of conditioning graphs allow competitive behaviour with standard methods in many circumstances, while still preserving its small and simple style. Finally, we show that the memory required under caching can be quite modest, meaning that conditioning graphs can be competitive with standard methods in terms of time, using a fraction of the memory. Advisors/Committee Members: Horsch, Michael C., Santos, Eugene Jr., Neufeld, Eric, Keil, J. Mark, Grassmann, Winfried K., Bickis, Mikelis G..

Subjects/Keywords: Graphical Models; Recursive Conditioning; Bayesian Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Grant, K. J. (2007). Conditioning graphs: practical structures for inference in bayesian networks. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/etd-01152007-161104

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Grant, Kevin John. “Conditioning graphs: practical structures for inference in bayesian networks.” 2007. Thesis, University of Saskatchewan. Accessed April 19, 2019. http://hdl.handle.net/10388/etd-01152007-161104.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Grant, Kevin John. “Conditioning graphs: practical structures for inference in bayesian networks.” 2007. Web. 19 Apr 2019.

Vancouver:

Grant KJ. Conditioning graphs: practical structures for inference in bayesian networks. [Internet] [Thesis]. University of Saskatchewan; 2007. [cited 2019 Apr 19]. Available from: http://hdl.handle.net/10388/etd-01152007-161104.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Grant KJ. Conditioning graphs: practical structures for inference in bayesian networks. [Thesis]. University of Saskatchewan; 2007. Available from: http://hdl.handle.net/10388/etd-01152007-161104

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universitat Pompeu Fabra

2. Keyder, Emil Ragip. New Heuristics for Planning with Action Costs.

Degree: Departament de Tecnologies de la Informació i les Comunicacions, 2010, Universitat Pompeu Fabra

La plani caci on cl asica es el problema que consiste en hallar una secuencia de acciones que lleven a un agente desde un estado inicial a un objetivo, asum- iendo resultados determin sticos e informaci on completa. La plani caci on \satis cing" busca encontrar una soluci on de bajo coste, sin garant as de op- timalidad. La b usqueda heur stica guiada por heur sticas no admisibles es el enfoque que ha tenido mas exito. Esta tesis presenta varias heur sticas de ese g enero que consideran costes en las acciones, y por lo tanto encuentran soluciones que minimizan el coste, en lugar de la longitud del plan. Adem as, demostramos que el problema de plani caci on con \soft goals", u objetivos opcionales, se puede reducir a un problema de plani caci on clasica con costes en las acciones, escenario en el que heur sticas sensibles a costes, tal como las aqu presentadas, son esenciales. Advisors/Committee Members: [email protected] (authoremail), true (authoremailshow), Geffner, Héctor (director).

Subjects/Keywords: unfolded hyperpath; STRIPS; Steiner tree; soft goal compilation; set-additive heuristic; soft goal; search; satisficing planning; relaxed plan heuristic; relaxed plan; relaxation; recursive conditioning; planning domain; planning; landmark; optimal planning; oversubscription; independence; independence assumption; inference; landmark heuristic; hypergraph; heuristic; heuristic search; graph; dtree; delete relaxation; cost; constraint satisfaction; conjunctive landmark; classical planning; complexity; choice variable; Bayesian network; additive heuristic; algorithm; AND/OR graph; action cost; 62

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Keyder, E. R. (2010). New Heuristics for Planning with Action Costs. (Thesis). Universitat Pompeu Fabra. Retrieved from http://hdl.handle.net/10803/7570

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Keyder, Emil Ragip. “New Heuristics for Planning with Action Costs.” 2010. Thesis, Universitat Pompeu Fabra. Accessed April 19, 2019. http://hdl.handle.net/10803/7570.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Keyder, Emil Ragip. “New Heuristics for Planning with Action Costs.” 2010. Web. 19 Apr 2019.

Vancouver:

Keyder ER. New Heuristics for Planning with Action Costs. [Internet] [Thesis]. Universitat Pompeu Fabra; 2010. [cited 2019 Apr 19]. Available from: http://hdl.handle.net/10803/7570.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Keyder ER. New Heuristics for Planning with Action Costs. [Thesis]. Universitat Pompeu Fabra; 2010. Available from: http://hdl.handle.net/10803/7570

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.