Text compression via alphabet re-representation

Neural Networks

Volumn 12, Issue 4-5, 1999, Pages 755-765

  Long, P M ^a   Natsev, A I ^b   Vitter, J S ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b Duke University   (United States)

Author keywords

Alphabet re representation; Machine learning; Neural networks; Over fitting; Text compression

Indexed keywords

ALGORITHMS; LEARNING SYSTEMS; NEURAL NETWORKS; TEXT PROCESSING; UNIX;

ALPHABET RE-REPRESENTATION; TEXT COMPRESSION;

DATA COMPRESSION;

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; AUTOMATION; COMPRESSION; COMPUTER PROGRAM; INFORMATION PROCESSING; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL;

EID: 0032795251     PISSN: 08936080     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-6080(99)00022-2     Document Type: Article

References (21)

1. Bell T.C., Cleary J.G., Witten I.H. Text compression. 1990;Prentice Hall, New York.
2. Chauvin Y., Rumelhart D.E. Backpropagation: theory, architectures, and applications. 1995;Lawrence Erlbaum, London.
3. Cleary J.G., Witten I.H. Data compression using adaptive coding and partial string matching. IEEE Transactions on Communication. 32:1984;396-402.
4. Cottrell G.W., Munro P., Zipser D. Image compression by backpropagation: an example of extensional programming. Sharkey N.E. Models of cognition: a review of cognition science. 1989;Ablex, Norwood, NJ.
5. Faloutsos, C., & Lin, K.-I. (1995). Fastmap: a fast algorithm for indexing, data-mining, and visualization of traditional and multimedia datasets. Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data (SIGMOD'95), pp. 163-174.
6. Gallagher R. Information theory and reliable communication. 1968;Wiley, New York.
7. Hochreiter S., Schmidhuber J. Flat minima. Neural Computation. 9:(1):1997;1-43.
8. Lawler E.L., Lenstra J.K., Rinnooy A.H.G., Shmoys D.B. The traveling salesman problem. 1985;Wiley, New York.
9. Moffat, A., Neal, R., and Witten, I. (1995). Arithmetic coding revisited. Proceedings of IEEE Data Compression Conference.
10. Murtagh F. A survey of recent advances in hierarchical clustering algorithms. The Computer Journal. 26:(4):1983;354-359.
11. Natsev, A. (1997). Text compression via alphabet re-representation. Master's thesis, Duke University, Durham, NC.
12. Rumelhart D., Hinton D., Williams R. Parallel Distributed Processing, Explorations in the microstructure of cognition. Foundations. 1:1986;MIT Press, Cambridge, MA.
13. Schalcoff R. Pattern recognition. 1992;Wiley, New York.
14. Schmidhuber J., Heil S. Sequential neural text compression. IEEE Transactions on Neural Networks. 7:(1):1996;142-146.
15. Thodberg H.H. Improving generalization of neural networks through pruning. International Journal of Neural Systems. 1:(4):1991;317-326.
16. Weigend A.S., Rumelhart D.E., Huberman B.A. Generalization by weight-elimination with application to forecasting. Advances in Neural Information Processing. 3:1991;875-882.
17. Welch T.A. A technique for high performance data compression. Computer. 00:1984;8-19.
18. Werbos, P. J. (1974). Beyond regression: new tools for prediction and analysis in the behavioral sciences. PhD thesis, Harvard University.
19. Wheeler, D., & Burrows, M. (1994). A block-sorting lossless data compression algorithm. Technical report SRC 124, DEC Corporation.
20. Ziv J., Lempel A. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory. 23:1977;337-343.
21. Ziv J., Lempel A. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory. 24:1978;530-536.