Journal of Machine Learning Research, Volume 1

Leslie Pack Kaelbling, Editor

**Marina Meilammp@stat.washington.edu
Department of Statistics
University of Washington
Seattle, WA 98195-4322, USA
Michael I. Jordanjordan@cs.berkeley.edu
Division of Computer Science and Department of Statistics
University of California
Berkeley, CA 94720-1776, USA**

This paper describes the mixtures-of-trees model, a probabilistic
model for discrete multidimensional domains. Mixtures-of-trees
generalize the probabilistic trees of [Chow, Liu 1968]
in a different and complementary direction to that of Bayesian networks.
We present efficient algorithms for learning mixtures-of-trees
models in maximum likelihood and Bayesian frameworks.
We also discuss additional efficiencies that can be
obtained when data are ``sparse,'' and we present data
structures and algorithms that exploit such sparseness.
Experimental results demonstrate the performance of the
model for both density estimation and classification.
We also discuss the sense in which tree-based classifiers
perform an implicit form of feature selection, and demonstrate
a resulting insensitivity to irrelevant attributes.

- Introduction
- Tree distributions
- Mixtures of trees
- Decomposable priors and MAP estimation for mixtures of trees
- Experiments
- The accelerated tree learning algorithm
- Conclusions
- Appendix A.
- Bibliography
- About this document ...

Journal of Machine Learning Research 2000-10-19