Decomposition of structural learning about directed acyclic graphs

Authors:
Xianchao Xie;Zhi Geng;Qiang Zhao
Affiliations:
School of Mathematical Sciences, LMAM, Peking University, Beijing 100871, China;School of Mathematical Sciences, LMAM, Peking University, Beijing 100871, China;School of Mathematical Sciences, LMAM, Peking University, Beijing 100871, China and Institute of Population Research, Peking University, Beijing 100871, China
Venue:
Artificial Intelligence
Year:
2006

Citing 15
Cited 2

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
Statistical analysis with missing data

Statistical analysis with missing data
Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
A tutorial on learning with Bayesian networks

Proceedings of the NATO Advanced Study Institute on Learning in graphical models
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
A sufficiently fast algorithm for finding close to optimal clique trees

Artificial Intelligence
Probabilistic Networks and Expert Systems

Probabilistic Networks and Expert Systems
Equivalence and synthesis of causal models

UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
Learning the Causal Structure of Overlapping Variable Sets

DS '02 Proceedings of the 5th International Conference on Discovery Science
Time and sample efficient discovery of Markov blankets and direct causal relations

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Decomposition of search for v-structures in DAGs

Journal of Multivariate Analysis
Constructor: a system for the induction of probabilistic models

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Causal inference and causal explanation with background knowledge

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Optimal junction trees

UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence

A note on minimal d-separation trees for structural learning

Artificial Intelligence
Structural learning about independence graphs from multiple databases

PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining

Quantified Score

Hi-index	0.01

Visualization

Abstract

Rarely planning domains are fully observable. For this reason, the ability to deal with partial observability is one of the most important challenges in planning. In this paper, we tackle the problem of strong planning under partial observability in ...