Algorithms for Discovery of Multiple Markov Boundaries¶
Statnikov, A., Lytkin, N. I., Lemeire, J., & Aliferis, C. F. (2013). Algorithms for Discovery of Multiple Markov Boundaries.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Bayesian Network Markov Blanket Extraction
- Given a Bayesian network — a directed graph over the variables — the Markov blanket of the target node is exactly its parents, its children, and its children's other parents (its "spouses"), and conditioned on that set the target is independent of every other node in the graph.
This sourceDefines a Bayesian network as a directed acyclic graph and the target node’s Markov blanket as its parents, children, and spouses, which renders it conditionally independent of all remaining variables.
- Given a Bayesian network — a directed graph over the variables — the Markov blanket of the target node is exactly its parents, its children, and its children's other parents (its "spouses"), and conditioned on that set the target is independent of every other node in the graph.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:19a6067c0836 · see in the full table