A note on sequence prediction over large alphabets

DOI10.3390/A5010050MaRDI QIDQ1736500zbMATH OpenOpenAlexFDO

Authors Travis Gagie

Publication date 26 March 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a5010050

zbMATH Keywords

sequence predictionalphabet size

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets
• On Context-Tree Prediction of Individual Sequences
• Universal prediction of individual sequences
• The complexity and effectiveness of prediction algorithms
• On complexity of easy predictable sequences

Cited in

(6)

• High-order entropy compressed bit vectors with rank/select
• On Context-Tree Prediction of Individual Sequences
• Prediction with a short memory
• Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets
• Superior guarantees for sequential prediction and lossless compression via alphabet decomposition
• scientific article; zbMATH DE number 2243374 (Why is no real title available?)

This page was built for publication: A note on sequence prediction over large alphabets

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