Learning in high dimensions: modular mixture models
暂无分享,去创建一个
We present a new approach to learning probabilistic models for high dimensional data. This approach divides the data dimensions into low dimensional subspaces, and learns a separate mixture model for each subspace. The models combine in a principled manner to form a flexible modular network that produces a total density estimate. We derive and demonstrate an iterative learning algorithm that uses only local information.
[1] Hagai Attias. Learning a Hierarchical Belief Network of Independent Factor Analyzers , 1998, NIPS.
[2] Hagai Attias,et al. A Variational Bayesian Framework for Graphical Models , 1999 .
[3] Michael I. Jordan,et al. Learning with Mixtures of Trees , 2001, J. Mach. Learn. Res..
[4] David Maxwell Chickering,et al. Fast Learning from Sparse Data , 1999, UAI.
[5] Andrew W. Moore,et al. Very Fast EM-Based Mixture Model Clustering Using Multiresolution Kd-Trees , 1998, NIPS.