Abstract
Wong and Poon [1] showed that Chow and Liu's tree dependence approximation can be derived by minimizing an upper bound of the Bayes error rate. Wong and Poon's result was obtained by expanding the conditional entropy H(ω X). We derive the correct expansion of H(ω X) and present its implication.
Original language | English (US) |
---|---|
Pages (from-to) | 1866-1868 |
Number of pages | 3 |
Journal | IEEE Transactions on Pattern Analysis and Machine Intelligence |
Volume | 29 |
Issue number | 10 |
DOIs | |
State | Published - 2007 |
Externally published | Yes |
Keywords
- Bayes error rate
- Classification
- Dependence tree approximation
- Entropy
- Mutual information
ASJC Scopus subject areas
- Software
- Computer Vision and Pattern Recognition
- Computational Theory and Mathematics
- Artificial Intelligence
- Applied Mathematics