Classification with finite memory

DOI10.1109/18.485707zbMATH Open0853.62009OpenAlexW2133307276MaRDI QIDQ4885665FDOQ4885665

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

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

zbMATH Keywords

classifiertraining sequencefinite memorypattern-matchingcorrect classification

Mathematics Subject Classification ID

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

Cited In (7)

• On Learning With Finite Memory
• On classification with empirically observed statistics and universal data compression
• Incremental exemplar learning schemes for classification on embedded devices
• Title not available (Why is that?)
• Learning with Finite Memory
• Classification With Finite Memory Revisited
• 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)