A measure of relative entropy between individual sequences with application to universal classification
From MaRDI portal
Publication:4307329
DOI10.1109/18.243444zbMath0801.94004WikidataQ60362757 ScholiaQ60362757MaRDI QIDQ4307329
Publication date: 4 October 1994
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/17c167b2c9fa44d7fa3b4ddab000ea7851fa566c
Lempel-Ziv algorithm; informational divergence; universal classification; universal hypothesis testing
Related Items
Artificial sequences and complexity measures, Mathematical Models of Textual Data: A Short Review, Computing the relative entropy between regular tree languages, Algorithmic relative complexity, Expanding the algorithmic information theory frame for applications to Earth observation, Data compression and learning in time sequences analysis, Distance measures for biological sequences: some recent approaches, Non-parametric change-point estimation using string matching algorithms, Relative entropy via non-sequential recursive pair substitution, An example of mathematical authorship attribution