TY - GEN
T1 - Inducing codes from examples
AU - Leung, Wai Hong
AU - Skiena, Steven S.
N1 - Publisher Copyright:
© 1991 IEEE.
PY - 1991
Y1 - 1991
N2 - We propose a data compression algorithm which automatically analyzes a collection of examples to identify the set of strings which would be most useful to encode the examples. There is considerable subtlety in identifying the most useful strings, since the problem is NP-complete, but we have developed analysis and encoding/decoding heuristics which construct excellent codes. In this paper, we describe our algorithm and experimental results on four different special domains: mailing addresses, Fortran programs, weather radar images, and UNIX manual pages. In each of these domains, our method significantly outperformed such standard compression algorithms as Huffman codes and LZW.
AB - We propose a data compression algorithm which automatically analyzes a collection of examples to identify the set of strings which would be most useful to encode the examples. There is considerable subtlety in identifying the most useful strings, since the problem is NP-complete, but we have developed analysis and encoding/decoding heuristics which construct excellent codes. In this paper, we describe our algorithm and experimental results on four different special domains: mailing addresses, Fortran programs, weather radar images, and UNIX manual pages. In each of these domains, our method significantly outperformed such standard compression algorithms as Huffman codes and LZW.
UR - https://www.scopus.com/pages/publications/85068420156
U2 - 10.1109/DCC.1991.213354
DO - 10.1109/DCC.1991.213354
M3 - Conference contribution
AN - SCOPUS:85068420156
T3 - Data Compression Conference Proceedings
SP - 267
EP - 276
BT - Data Compression Conference 1991
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1991 Data Compression Conference, DCC 1991
Y2 - 8 April 1991 through 11 April 1991
ER -