Classification with finite memory

DOI10.1109/18.485707MaRDI QIDQ4885665zbMATH OpenOpenAlexFDO

Authors Jacob Ziv, Aaron D. Wyner

Publication date 7 January 1997

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

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

zbMATH Keywords

classifiercorrect classificationfinite memorypattern-matchingtraining sequence

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Information theory (general) (94A15)

Recommendations

• Classification With Finite Memory Revisited
• scientific article; zbMATH DE number 826063
• 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

(8)

• Incremental exemplar learning schemes for classification on embedded devices
• Classification With Finite Memory Revisited
• A measure of relative entropy between individual sequences with application to universal classification
• On classification with empirically observed statistics and universal data compression
• scientific article; zbMATH DE number 826063 (Why is no real title available?)
• On Learning With Finite Memory
• Learning with Finite Memory
• Finite-memory hypothesis testing--Comments on a critique (Corresp.)

This page was built for publication: Classification with finite memory

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