An Accelerated Chow and Liu Algorithm: Fitting Tree Distributions to High Dimensional Sparse Data
Chow and Liu introduced an algorithm for fitting a multivariate distribution with a tree (i.e. a density model that assumes that there are only pairwise dependencies between variables) and that the graph of these dependencies is a spanning tree. The original algorithm is quadratic in the dimesion of...
Main Author: | Meila, Marina |
---|---|
Language: | en_US |
Published: |
2004
|
Online Access: | http://hdl.handle.net/1721.1/6676 |
Similar Items
-
Learning with mistures of trees
by: Meilă-Predoviciu, Marina, 1962-
Published: (2013) -
Vale Professor Xiaoxian Liu
by: Xu, Fenglian, et al.
Published: (2020) -
Restructuring Sparse High Dimensional Data for Effective Retrieval
by: Isbell, Charles, et al.
Published: (2004) -
GAMMA: Leveraging Gustavson's Algorithm to Accelerate Sparse Matrix Multiplication
by: Zhang, Guowei, et al.
Published: (2022) -
Sparse high-dimensional regression: Exact scalable algorithms and phase transitions
by: Bertsimas, Dimitris, et al.
Published: (2021)