Grant: Discovery Grants Program - Individual
University of Guelph
$14,000.00
Graphical models: Inference, decision and acquisition
EF 2014-15
Résumé
My research concerns intelligent systems, known as agents, that function in uncertain or constraint-based environments, either individually or cooperatively. It focuses on graphical models for knowledge representation and covers issues on knowledge acquisition, inference, and decision making. My previous research has established several classes of multiagent graphical models, known as MSBNs for probabilistic reasoning, DMSBNs for forecasting, and CDNs for design decision making. Agent communication in MSBNs and DMSBNs is initiated by one agent (the root), and its election incurs overhead. To improve flexibility, feasibility of an unrooted regime will be investigated. Multiagent planning will also be studied focusing on online planning, rather than commonly pursued offline policy making, to gain efficiency.My previous research on multiagent constraint graphical models, known as MSCNs, confirms that lessons learned from multiagent probabilistic graphical models can be usefully extended into distributed constraint satisfaction (DCSP) and optimization (DCOP). The proposed research will explore the structure embedded in lower level runtime representation of MSCNs for more efficient constraint reasoning. Motivated by certain unique, desirable computational properties of CDNs and MSCNs (relative to existing frameworks for DCOP), a multiagent graphical model for DCOP will be developed by generalizing CDNs and MSCNs. Previous research developed causal models, NIN-AND trees, for efficient acquisition of conditional probability tables (CPTs) in constructing Bayesian networks. These models extend the expressive power of existing models from reinforcing interaction to undermining and mixture of the two. The proposed research will investigate approximating an arbitrary CPT as an NIN-AND tree, algorithms to acquire these models by data mining, and direct incorporation of NIN-AND trees into inference to improve efficiency.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
155425-2011
Name nom
Xiang, Yang
Department département
Computing and Information Science, School of
Organization id
24
Institution établissement
University of Guelph
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2011
Award amount
14000
Program id
RGPIN
Program name 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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
802
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
Information systems and technology
Area of application fr
Systèmes d'information et technologie de l'information
Research subject code
2805
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Learning and inference theories
Research subject fr
Théories de l'apprentissage et l'inférence
Partie
4
Nb partie
5
Application title
Graphical models: Inference, decision and acquisition
Keyword
NSERC
Application summary
My research concerns intelligent systems, known as agents, that function in uncertain or constraint-based environments, either individually or cooperatively. It focuses on graphical models for knowledge representation and covers issues on knowledge acquisition, inference, and decision making. My previous research has established several classes of multiagent graphical models, known as MSBNs for probabilistic reasoning, DMSBNs for forecasting, and CDNs for design decision making. Agent communication in MSBNs and DMSBNs is initiated by one agent (the root), and its election incurs overhead. To improve flexibility, feasibility of an unrooted regime will be investigated. Multiagent planning will also be studied focusing on online planning, rather than commonly pursued offline policy making, to gain efficiency.My previous research on multiagent constraint graphical models, known as MSCNs, confirms that lessons learned from multiagent probabilistic graphical models can be usefully extended into distributed constraint satisfaction (DCSP) and optimization (DCOP). The proposed research will explore the structure embedded in lower level runtime representation of MSCNs for more efficient constraint reasoning. Motivated by certain unique, desirable computational properties of CDNs and MSCNs (relative to existing frameworks for DCOP), a multiagent graphical model for DCOP will be developed by generalizing CDNs and MSCNs. Previous research developed causal models, NIN-AND trees, for efficient acquisition of conditional probability tables (CPTs) in constructing Bayesian networks. These models extend the expressive power of existing models from reinforcing interaction to undermining and mixture of the two. The proposed research will investigate approximating an arbitrary CPT as an NIN-AND tree, algorithms to acquire these models by data mining, and direct incorporation of NIN-AND trees into inference to improve efficiency.