Grant: Research Tools and Instruments - Category 1 (<$150,000)
University of Lethbridge
$14,811.00
Developing runtime structures for Bayesian network inference
EF 2008-09
Résumé
Bayesian networks are a means of exploiting conditional independence information in joint probability distributions to facilitate both a compact representation of a joint distribution, and faster inferences from that distribution, without sacrificing the integrity of the original information. This is crucial for probabilistic decision-making in settings where variables interact in complex ways, such as medical decision making. It also facilitates and improves the accuracy of classification, forecasting, and fault diagnosis. Any software that improves the efficiency of decision-making, without sacrificing accuracy, makes deployment on consumer hardware more feasible.
One of the major criticisms of using Bayesian networks in application is that their computational demands are often very high, both in terms of runtime and memory. In our proposed research program, we intend to develop streamlined data structures for computing over Bayesian networks at runtime. These data structures will be constructed according to application constraints on resources such as time and memory.
Finding the optimal runtime structure for a particular set of resource constraints is a problem in combinatorial optimization, with a very large search space. Evaluating the results of our optimizations will often require an exhaustive search over all possible representations, which is very time and space expensive. To assist us in this research, we are proposing the purchase of a high-performance computer that will allow us to evaluate our optimization methods as efficiently as possible.
Programme
Research Tools and Instruments - Category 1 (<$150,000)
Bénéficiaire
Emplacement
Alberta, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
359099-2008
Name nom
Grant, Kevin
Department département
Mathematics and Computer Science
Organization id
12
Institution établissement
University of Lethbridge
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2008
Award amount
14811
Program id
EQPEQ
Program nane en
Research Tools and Instruments - Category 1 (<$150,000)
Program name fr
Outils et instruments de recherche - catégorie 1 (<150 000$)
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2803
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Knowledge representation
Research subject fr
Répresentation des connaissances
Partie
1
Nb partie
1
Application title
Developing runtime structures for Bayesian network inference
Keyword
NA
Application summary
Bayesian networks are a means of exploiting conditional independence information in joint probability distributions to facilitate both a compact representation of a joint distribution, and faster inferences from that distribution, without sacrificing the integrity of the original information. This is crucial for probabilistic decision-making in settings where variables interact in complex ways, such as medical decision making. It also facilitates and improves the accuracy of classification, forecasting, and fault diagnosis. Any software that improves the efficiency of decision-making, without sacrificing accuracy, makes deployment on consumer hardware more feasible.
One of the major criticisms of using Bayesian networks in application is that their computational demands are often very high, both in terms of runtime and memory. In our proposed research program, we intend to develop streamlined data structures for computing over Bayesian networks at runtime. These data structures will be constructed according to application constraints on resources such as time and memory.
Finding the optimal runtime structure for a particular set of resource constraints is a problem in combinatorial optimization, with a very large search space. Evaluating the results of our optimizations will often require an exhaustive search over all possible representations, which is very time and space expensive. To assist us in this research, we are proposing the purchase of a high-performance computer that will allow us to evaluate our optimization methods as efficiently as possible.