Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6676Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Meila, Marina | - |
| dc.date | 2004-10-08T20:37:13Z | - |
| dc.date | 2004-10-08T20:37:13Z | - |
| dc.date | 1999-01-01 | - |
| dc.date.accessioned | 2013-10-09T02:46:26Z | - |
| dc.date.available | 2013-10-09T02:46:26Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-1652 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6676 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | 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 the domain, and linear in the number of data points that define the target distribution $P$. This paper shows that for sparse, discrete data, fitting a tree distribution can be done in time and memory that is jointly subquadratic in the number of variables and the size of the data set. The new algorithm, called the acCL algorithm, takes advantage of the sparsity of the data to accelerate the computation of pairwise marginals and the sorting of the resulting mutual informations, achieving speed ups of up to 2-3 orders of magnitude in the experiments. | - |
| dc.format | 1375477 bytes | - |
| dc.format | 434859 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-1652 | - |
| dc.title | An Accelerated Chow and Liu Algorithm: Fitting Tree Distributions to High Dimensional Sparse Data | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.