Fast Factored Density Estimation and Compression with Bayesian Networks (2002)
| Citations: | 3 - 1 self |
BibTeX
@TECHREPORT{Davies02fastfactored,
author = {Scott Davies and John Lafferty},
title = {Fast Factored Density Estimation and Compression with Bayesian Networks},
institution = {},
year = {2002}
}
OpenURL
Abstract
my family-- especially my father, Donald. iv Abstract Many important data analysis tasks can be addressed by formulating them as probability estimation problems. For example, a popular general approach to automatic classification problems is to learn a probabilistic model of each class from data in which the classes are known, and then use Bayes's rule with these models to predict the correct classes of other data for which they are not known. Anomaly detection and scientific discovery tasks can often be addressed by learning probability models over possible events and then looking for events to which these models assign low probabilities. Many data compression algorithms such as Huffman coding and arithmetic coding rely on probabilistic models of the data stream in order achieve high compression rates.







