Classification With Finite Memory Revisited

DOI10.1109/TIT.2007.909181zbMATH Open1326.68260OpenAlexW2015521196MaRDI QIDQ3549092FDOQ3549092

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)

Cited In (5)

• A general classification rule for probability measures
• On Learning With Finite Memory
• Title not available (Why is that?)
• Learning with Finite Memory
• A paradigm for class identification problems

   Recommendations

• Classification with finite memory 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)