d-Separation: From Theorems to Algorithms
An efficient algorithm is developed that identifies all independencies implied by the topology of a Bayesian network. Its correctness and maximality stems from the soundness and completeness of d-separation with respect to probability theory. The algorithm runs in time O (l E l) where E is the number of edges in the network.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Stochastic Separation Theorems
The problem of non-iterative one-shot and non-destructive correction of unavoidable mistakes arises in all Artificial Intelligence applications in the real world. Its solution requires robust separation of samples with e…
Linear and Fisher Separability of Random Points in the d-dimensional Spherical Layer
Stochastic separation theorems play important role in high-dimensional data analysis and machine learning. It turns out that in high dimension any point of a random set of points can be separated from other points by a h…
Augmented Artificial Intelligence: a Conceptual Framework
All artificial Intelligence (AI) systems make errors. These errors are unexpected, and differ often from the typical human mistakes ("non-human" errors). The AI errors should be corrected without damage of existing skill…
Learning zero-cost portfolio selection with pattern matching
We consider and extend the adversarial agent-based learning approach of Gy{\"o}rfi {\it et al} to the situation of zero-cost portfolio selection implemented with a quadratic approximation derived from the mutual fund sep…
Time SeriesTime Series AnalysisGeneral stochastic separation theorems with optimal bounds
Phenomenon of stochastic separability was revealed and used in machine learning to correct errors of Artificial Intelligence (AI) systems and analyze AI instabilities. In high-dimensional datasets under broad assumptions…