Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/45822
Title: INDUCTIVE MODELING FOR DATA COMPRESSION
Authors: Cleary, John G.
Witten, Ian H.
Keywords: Computer Science
Issue Date: 1-Jan-1987
Abstract: The modern paradigm for data compression is modeling followed by coding. Within this paradigm the problem of optimal coding with respect to a model is fully solved. Inductive modeling techniques used for compression operate despite considerable noise, employ positive examples only, and yet effectively identify sources of the kind that are encountered in practice. The problem of data compression provides an excellent test-bed for inductive modeling. It allows one to assess the merits of adaptive as opposed to non-adaptive approaches. For example, it can be shown that the penalty incurred by adaptation is less than the cost of transmitting an explicit model for the source. It also illustrates that modeling criteria such as "identification in the limit" may be inappropriate because typical sources have time-varying characteristics. In practice speed of convergence is just as important as asymptotic performance.
URI: http://hdl.handle.net/1880/45822
Appears in Collections:Cleary, John
Witten, Ian

Files in This Item:
File Description SizeFormat 
1987-254-02.pdf2.8 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.