Classification With Finite Memory Revisited

DOI10.1109/TIT.2007.909181MaRDI QIDQ3549092zbMATH OpenOpenAlexFDO

Authors Jacob Ziv

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2007.909181

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Statistical decision theory (62C99) Ergodicity, mixing, rates of mixing (37A25)

Recommendations

• Classification with finite memory
• scientific article; zbMATH DE number 826063
• Second-order asymptotically optimal statistical classification
• A measure of relative entropy between individual sequences with application to universal classification
• On classification with empirically observed statistics and universal data compression

Cited in

(12)

• scientific article; zbMATH DE number 826063 (Why is no real title available?)
• Second-order asymptotically optimal statistical classification
• A paradigm for class identification problems
• Classification via Minimum Incremental Coding Length
• A general classification rule for probability measures
• Learning with Finite Memory
• scientific article; zbMATH DE number 4100590 (Why is no real title available?)
• Simultaneity in the problems of classification of finite objects
• On classification with empirically observed statistics and universal data compression
• On Learning With Finite Memory
• Universal Neyman-Pearson classification with a partially known hypothesis
• Formalization of ``natural classification and systematics as fix-points of predictions

This page was built for publication: Classification With Finite Memory Revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549092)