Deplump for streaming data
We present a general-purpose, loss less compressor for streaming data. This compressor is based on the deplump probabilistic compressor for batch data. Approximations to the inference procedure used in the probabilistic model underpinning deplump are introduced that yield the computational asyptotic...
Main Authors: | , |
---|---|
Format: | Conference item |
Published: |
IEEE
2011
|
_version_ | 1826257951337218048 |
---|---|
author | Bartlett, N Wood, F |
author_facet | Bartlett, N Wood, F |
author_sort | Bartlett, N |
collection | OXFORD |
description | We present a general-purpose, loss less compressor for streaming data. This compressor is based on the deplump probabilistic compressor for batch data. Approximations to the inference procedure used in the probabilistic model underpinning deplump are introduced that yield the computational asyptotics necessary for stream compression. We demonstrate the performance of this streaming deplump variant relative to the batch compressor on a benchmark corpus and find that it performs equivalently well despite these approximations. We also explore the performance of the streaming variant on corpora that are too large to be compressed by batch deplump and demonstrate excellent compression performance. |
first_indexed | 2024-03-06T18:26:20Z |
format | Conference item |
id | oxford-uuid:0815eb9e-1237-42fa-a4ec-1345fbd419fd |
institution | University of Oxford |
last_indexed | 2024-03-06T18:26:20Z |
publishDate | 2011 |
publisher | IEEE |
record_format | dspace |
spelling | oxford-uuid:0815eb9e-1237-42fa-a4ec-1345fbd419fd2022-03-26T09:11:04ZDeplump for streaming dataConference itemhttp://purl.org/coar/resource_type/c_5794uuid:0815eb9e-1237-42fa-a4ec-1345fbd419fdSymplectic Elements at OxfordIEEE2011Bartlett, NWood, FWe present a general-purpose, loss less compressor for streaming data. This compressor is based on the deplump probabilistic compressor for batch data. Approximations to the inference procedure used in the probabilistic model underpinning deplump are introduced that yield the computational asyptotics necessary for stream compression. We demonstrate the performance of this streaming deplump variant relative to the batch compressor on a benchmark corpus and find that it performs equivalently well despite these approximations. We also explore the performance of the streaming variant on corpora that are too large to be compressed by batch deplump and demonstrate excellent compression performance. |
spellingShingle | Bartlett, N Wood, F Deplump for streaming data |
title | Deplump for streaming data |
title_full | Deplump for streaming data |
title_fullStr | Deplump for streaming data |
title_full_unstemmed | Deplump for streaming data |
title_short | Deplump for streaming data |
title_sort | deplump for streaming data |
work_keys_str_mv | AT bartlettn deplumpforstreamingdata AT woodf deplumpforstreamingdata |