Approximating Discrete Probability Distributions with Dependence Trees¶
Chow, C. K., & Liu, C. N. (1968). Approximating Discrete Probability Distributions with Dependence Trees. IEEE Transactions on Information Theory, 14(3), 462-467.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Chow–Liu Tree
- The distinctive choice rule is to weight every candidate edge by the pairwise mutual information of its two variables and select a maximum-total-weight spanning tree.
This sourceDirect binary/screenshot access failed after text crawl; mathematical glyphs were checked against prose and the Stanford lecture source.
- The distinctive choice rule is to weight every candidate edge by the pairwise mutual information of its two variables and select a maximum-total-weight spanning tree.
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:fa13d5356421 · see in the full table