Close category search window
 

Approximating discrete probability distributions with dependence trees

Full text access may be available

To access full text, please use your member or institutional sign in.


This paper appears in:
Information Theory, IEEE Transactions on
Date of Publication: May 1968
Author(s): Chow, C.
Liu, C.
Volume: 14 , Issue: 3
Page(s): 462 - 467
Product Type: Journals & Magazines

Available Formats Non-Member Price Member Price
US$31.00 US$10.00
Learn how you can qualify for the best price for the item!
  • Email
  • Print
  • Rights And Permissions

Abstract

A method is presented to approximate optimally ann-dimensional discrete probability distribution by a product of second-order distributions, or the distribution of the first-order tree dependence. The problem is to find an optimum set ofn - 1first order dependence relationship among thenvariables. It is shown that the procedure derived in this paper yields an approximation of a minimum difference in information. It is further shown that when this procedure is applied to empirical observations from an unknown distribution of tree dependence, the procedure is the maximum-likelihood estimate of the distribution.

Index Terms

Index Terms are available to subscribers and IEEE members.

 





Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A non-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2012 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.