Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Guelph

$20,000.00

Tractable NAT-Modeled Bayesian Networks and Privacy Sensitive Construction of Agent Organizations

FY 2017-18

Summary
(1) Rigid, simplistic rules are often used for decision making in personal and mobile devices. For example, a phone number may be placed on a black list, due to report of a spam call from it, causing future calls from the number to be filtered. The rule ignores the possibility that the report may itself be a spam, leading to undesirable actions. Bayesian Networks (BNs), knowledge based systems capable of weighing complex context information, can aid users with more intelligent decisions. Since inference in general BNs is intractable, it is necessary to identify subclasses of BNs that enable efficient inference. They include BNs of low treewidth, and BNs of high treewidth but encoding Context-Specific Independence (CSI) in local structures and being compiled into Arithmetic Circuits or Sum-Product Networks. Independence of Causal Influence (ICI) encoded in Non-impeding noisy-AND Tree (NAT) models are orthoganal to CSI and NAT models are more compact than CSI based local structures, such as Algebraic Decision Diagrams. This research will investigate how to conduct tractable inference in NAT-modeled BNs with high treewidth, how to further improve inference efficiency by exploiting both CSI and NAT-expressible ICI, and how to acquire such BNs by machine learning. Its success will broaden subclasses of tractable BNs of high treewidth, making BN inference more widely deployable. (2) Cooperative intelligent systems (called agents) are well suited for applications such as monitoring complex equipment or collaborative design in supply chains. Often, agents cooperate through an organization. The Junction Tree (JT) is one such organization and is found superior than the often used Pseudotrees. An agent may embed rich knowledge, e.g., on an equipment subsystem, that is proprietary to the subsystem vendor and needs to remain private. However, common methods to construct JT organizations suffer from breach of such privacy. As a result, vendors risk losing intellectual properties. To improve privacy in these agent systems, this research studies how to construct JT organizations without privacy loss if possible and with the minimum loss if unavoidable. Flexible JT organization construction is also developed with privacy protection to handle changes in system composition, e.g., when an agent is added due to system expansion. Feasibility of fully autonomous, privacy protecting JT construction will be studied, e.g., without using an externally specified leader agent. Successful completion of this research will close the loop hole for privacy loss in agent systems built on JT organizations. The strong privacy guarantee, coupled with other superior computational properties of JT organizations, will make these agent systems more widely applicable.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
RGPIN-2017-03715
Name nom
Xiang, Yang
Department département
Computer Science, School of - Computer 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
2017
Competition year année de concours
2017
Award amount
20000
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
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
Tractable NAT-Modeled Bayesian Networks and Privacy Sensitive Construction of Agent Organizations
Keyword
NSERC
Application summary
(1) Rigid, simplistic rules are often used for decision making in personal and mobile devices. For example, a phone number may be placed on a black list, due to report of a spam call from it, causing future calls from the number to be filtered. The rule ignores the possibility that the report may itself be a spam, leading to undesirable actions. Bayesian Networks (BNs), knowledge based systems capable of weighing complex context information, can aid users with more intelligent decisions. Since inference in general BNs is intractable, it is necessary to identify subclasses of BNs that enable efficient inference. They include BNs of low treewidth, and BNs of high treewidth but encoding Context-Specific Independence (CSI) in local structures and being compiled into Arithmetic Circuits or Sum-Product Networks. Independence of Causal Influence (ICI) encoded in Non-impeding noisy-AND Tree (NAT) models are orthoganal to CSI and NAT models are more compact than CSI based local structures, such as Algebraic Decision Diagrams. This research will investigate how to conduct tractable inference in NAT-modeled BNs with high treewidth, how to further improve inference efficiency by exploiting both CSI and NAT-expressible ICI, and how to acquire such BNs by machine learning. Its success will broaden subclasses of tractable BNs of high treewidth, making BN inference more widely deployable. (2) Cooperative intelligent systems (called agents) are well suited for applications such as monitoring complex equipment or collaborative design in supply chains. Often, agents cooperate through an organization. The Junction Tree (JT) is one such organization and is found superior than the often used Pseudotrees. An agent may embed rich knowledge, e.g., on an equipment subsystem, that is proprietary to the subsystem vendor and needs to remain private. However, common methods to construct JT organizations suffer from breach of such privacy. As a result, vendors risk losing intellectual properties. To improve privacy in these agent systems, this research studies how to construct JT organizations without privacy loss if possible and with the minimum loss if unavoidable. Flexible JT organization construction is also developed with privacy protection to handle changes in system composition, e.g., when an agent is added due to system expansion. Feasibility of fully autonomous, privacy protecting JT construction will be studied, e.g., without using an externally specified leader agent. Successful completion of this research will close the loop hole for privacy loss in agent systems built on JT organizations. The strong privacy guarantee, coupled with other superior computational properties of JT organizations, will make these agent systems more widely applicable.