scientific article; zbMATH DE number 826063
From MaRDI portal
Publication:4858449
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Parallel algorithms in computer science (68W10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Recommendations
- A measure of relative entropy between individual sequences with application to universal classification
- Classification With Finite Memory Revisited
- On classification with empirically observed statistics and universal data compression
- Classification with finite memory
- Universal prediction of individual sequences
Cited in
(11)- A Bayesian approach for classification of Markov sources
- Finite-Memory Universal Prediction of Individual Sequences
- On universal types
- Classification With Finite Memory Revisited
- On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences
- A measure of relative entropy between individual sequences with application to universal classification
- Universal schemes for sequential decision from individual data sequences
- On classification with empirically observed statistics and universal data compression
- Classification with finite memory
- LATIN 2004: Theoretical Informatics
- State identification, existence of sequences and machine classification
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4858449)
