Learning max-weight discriminative forests
Lists
Only you see this
Abstract
We present a method for sequential learning of increasingly complex graphical models for discriminating between two hypotheses. We generate forests for each hypothesis, each with no more edges than a spanning tree, which optimize an information-theoretic criteria. The method relies on a straightforward extension of the efficient max-weight spanning tree (MWST) algorithm by incorporating multivalued edge-weights. Each iteration produces nested forests with increasing number of edges; each provably optimal as compared to alternative forests. Empirical results demonstrate superior probability of error as compared to generative approaches.
BibTeX
@inproceedings{tan2008learning,
author = {Vincent Y. F. Tan and John W. Fisher III and Alan S. Willsky},
title = {{Learning max-weight discriminative forests}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2008},
doi = {10.1109/icassp.2008.4518000},
}Loading related content...