On Classification with Empirically Observed Statistics and Universal Data Compression

IEEE Transactions on Information Theory

Volumn 34, Issue 2, 1988, Pages 278-286

  Ziv, Jacob ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY; STATISTICAL METHODS;

FINITE ALPHABET SOURCES; FINITE-STATE PROBABILITY MEASURES; UNIVERSAL DATA COMPRESSION;

INFORMATION THEORY;

EID: 0023979656     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.2636     Document Type: Article

References (10)

1. D. J. Hand, Discrimination and Classification. New York: Wiley, 1981.
2. H. Chemoff, #x201C;A measure of asymptotic efficiency for tests of a hypothesis based on a sum of observations,#x201D; Annals Math. Stat., vol. 23, pp. 493-507,1952.
3. I. M. Csiszar and J. K#x00F6;raer, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
4. J. Ziv and A. Lempel, #x201C;Compression of individual sequences via variable-rate coding,#x201D; IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, Sept. 1978.
5. L. D. Davisson, #x201C;Universal noiseless coding,#x201D; IEEE Trans. Inform. Theory, vol. IT-19, pp. 783-796, Nov. 1973.
6. R. G. Gallager, Information Theory and Reliable Communications. New York: Wiley, 1968.
7. S. D. Gupta, #x201C;Theories and methods in classification: A review,#x201D; in Discriminant Analysis and Applications, T. Cacoullos, Ed. New York: Academic, 1973, 77-136.
8. J. Rissanen, #x201C;Universal coding, information, prediction, and estimation,#x201D; IEEE Trans. Inform. Theory, 629-636, July 1984.
9. J. Ziv, #x201C; Universal decoding for finite-state channels,#x201D; IEEE Trans. Inform. Theory, vol. IT-31, pp. 453-460, July 1985.
10. M. Gutman, #x201C;Asymptotically optimal classification for Markov sources with empirically observed statistics,#x201D; in preparation.