Abstract
A nonsingular transformation of binary-valued random vectors y equals xA which minimizes a mutual information criterion I(y) is considered. It is shown that a nonsingular A exists such that I(y) equals 0 if and only if x has a generalized binomial distribution. Computational algorithms for seeking an optimal A are developed, and dimensionality reduction is discussed briefly. This linear transformation is useful in improving the approximation of probability distributions. Numerical examples are presented.
Original language | English (US) |
---|---|
Pages (from-to) | 152-156 |
Number of pages | 5 |
Journal | IEEE Transactions on Information Theory |
Volume | 24 |
Issue number | 2 |
DOIs | |
State | Published - Mar 1978 |
Externally published | Yes |
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences