Grant: Discovery Grants Program - Individual
University of Lethbridge
$15,000.00
Practical bayesian network inference
FY 2008-09
Summary
Bayesian networks are a means of exploiting conditional independence information in a joint probability distribution to facilitate both a more compact representation of the distribution, and faster inference from the 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 diagnosis. 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. Furthermore, many algorithms for computing over Bayesian networks use very sophisticated data structures and runtime libraries, which require further memory
and sophisticated algorithms. Such implementations are not appropriate for simple architectures (e.g. portable devices), real-time systems (e.g. games) or memory-limited applications.
In our proposed research program, we intend to continue development of streamlined data structures for computing probabilities from a Bayesian network at runtime. This approach will move much of the probabilistic computation offline, where the cost of computation is typically ignored, and minimizes costly runtime computation. The computation to be done at runtime will be packaged into a compiled version of the Bayesian network that makes reasonable demands on its host architecture, performing the required computation within the time and space constraints of the application.
Program
Discovery Grants Program - Individual
Recipient
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
356052-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
15000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
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
5
Application title
Practical bayesian network inference
Keyword
NA
Application summary
Bayesian networks are a means of exploiting conditional independence information in a joint probability distribution to facilitate both a more compact representation of the distribution, and faster inference from the 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 diagnosis. 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. Furthermore, many algorithms for computing over Bayesian networks use very sophisticated data structures and runtime libraries, which require further memory
and sophisticated algorithms. Such implementations are not appropriate for simple architectures (e.g. portable devices), real-time systems (e.g. games) or memory-limited applications.
In our proposed research program, we intend to continue development of streamlined data structures for computing probabilities from a Bayesian network at runtime. This approach will move much of the probabilistic computation offline, where the cost of computation is typically ignored, and minimizes costly runtime computation. The computation to be done at runtime will be packaged into a compiled version of the Bayesian network that makes reasonable demands on its host architecture, performing the required computation within the time and space constraints of the application.