Learning max-weight discriminative forests

@article{Tan2008LearningMD,
  title={Learning max-weight discriminative forests},
  author={Vincent Y. F. Tan and John W. Fisher and Alan S. Willsky},
  journal={2008 IEEE International Conference on Acoustics, Speech and Signal Processing},
  year={2008},
  pages={1877-1880}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Approximating discrete probability distributions with dependence trees

IEEE Trans. Information Theory • 1968
View 7 Excerpts
Highly Influenced

On the shortest spanning subtree of a graph and the traveling salesman problem

J. B. Kruskal
Proceedings of the American Mathematical Society, vol. 7, no. 1, pp. 48–50, 1956. • 1956
View 4 Excerpts
Highly Influenced

Learning Graphical Models for Hypothesis Testing

2007 IEEE/SP 14th Workshop on Statistical Signal Processing • 2007
View 1 Excerpt

Distance measures for signal processing and pattern recognition

M. Basseville
Signal Processing, vol. 18, no. 4, pp. 349 – 369, 1989. 1880 Authorized licensed use limited to: MIT Libraries. Downloaded on May 04,2010 at 14:33:46 UTC from IEEE Xplore. Restrictions apply. • 1989
View 1 Excerpt

Similar Papers

Loading similar papers…