Toward a decision-theoretic framework for affect recognition and user assistance
International Journal of Human-Computer Studies - Human-computer interaction research in the managemant information systems discipline
Modeling Causal Reinforcement and Undermining for Efficient CPT Elicitation
IEEE Transactions on Knowledge and Data Engineering
RAID '08 Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection
A socio-technical approach to business process simulation
Decision Support Systems
Expert Systems with Applications: An International Journal
Enumerating Unlabeled and Root Labeled Trees for Causal Model Acquisition
Canadian AI '09 Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence
Towards Effective Elicitation of NIN-AND Tree Causal Models
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Using probabilistic confidence models for trust inference in Web-based social networks
ACM Transactions on Internet Technology (TOIT)
Assessing critical success factors for military decision support
Expert Systems with Applications: An International Journal
Indirect elicitation of NIN-AND trees in causal model acquisition
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Agent-Based parsimonious decision support paradigm employing bayesian belief networks
DAMAS'05 Proceedings of the 2005 international conference on Defence Applications of Multi-Agent Systems
Modeling causal reinforcement and undermining with Noisy-AND trees
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Non-impeding noisy-AND tree causal models over multi-valued variables
International Journal of Approximate Reasoning
Hi-index | 0.00 |
This paper focuses on approaches that address the intractability of knowledge acquisition of conditional probability tables in causal or Bayesian belief networks. We state a rule that we term the "recursive noisy OR" (RNOR) which allows combinations of dependent causes to be entered and later used for estimating the probability of an effect. In the development of this paper, we investigate the axiomatic correctness and semantic meaning of this rule and show that the recursive noisy OR is a generalization of the well-known noisy OR. We introduce the concept of positive causality and demonstrate its utility in axiomatic correctness of the RNOR. We also introduce concepts describing the ways in which dependent causes can work together as being either "synergistic" or "interfering." We provide a formalization to quantify these concepts and show that they are preserved by the RNOR. Finally, we present a method for the determination of Conditional Probability Tables from this causal theory.