| dc.contributor.author | Long, Philip M. | |
| dc.contributor.author | Natsev, Apostol | |
| dc.contributor.author | Vitter, Jeffrey Scott | |
| dc.date.accessioned | 2011-03-21T19:10:16Z | |
| dc.date.available | 2011-03-21T19:10:16Z | |
| dc.date.issued | 1999 | |
| dc.identifier.citation | P. M. Long, A. I. Natsev, and J. S. Vitter. “Text Compression Via Alphabet Re-Representation,” Neural Networks, 12 (4–5), 1999, 755–765. An extended abstract appears in Proceedings of the 1997 IEEE Data Compression Conference (DCC ’97), Snowbird, UT, March 1997. http://dx.doi.org/10.1016/S0893-6080(99)00022-2 | |
| dc.identifier.uri | http://hdl.handle.net/1808/7215 | |
| dc.description.abstract | We consider re-representing the alphabet so that a representation of a character
re
ects its properties as a predictor of future text. This enables us to use an estimator
from a restricted class to map contexts to predictions of upcoming characters. We
describe an algorithm that uses this idea in conjunction with neural networks. The
performance of this implementation is compared to other compression methods, such
as UNIX compress, gzip, PPMC, and an alternative neural network approach. | |
| dc.language.iso | en_US | |
| dc.publisher | Elsevier | |
| dc.title | Text Compression Via Alphabet Re-Representation | |
| dc.type | Article | |
| kusw.kuauthor | Vitter, Jeffrey Scott | |
| kusw.oastatus | fullparticipation | |
| dc.identifier.doi | 10.1016/S0893-6080(99)00022-2 | |
| kusw.oaversion | Scholarly/refereed, author accepted manuscript | |
| kusw.oapolicy | This item meets KU Open Access policy criteria. | |
| dc.rights.accessrights | openAccess | |
