Abstract
Classification of finite alphabet sources with partial statistics is studied. Efficient universal discriminant functions are introduced and are shown to be closely related to universal data compression.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Ziv, J. (1987). On Classification with Partial Statistics and Universal Data Compression. In: Cover, T.M., Gopinath, B. (eds) Open Problems in Communication and Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4808-8_21
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4808-8_21
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9162-6
Online ISBN: 978-1-4612-4808-8
eBook Packages: Springer Book Archive