A measure of relative entropy between individual sequences with application to universal classification

DOI10.1109/18.243444zbMath0801.94004OpenAlexW2110764329WikidataQ60362757 ScholiaQ60362757MaRDI QIDQ4307329

Jacob Ziv, Neri Merhav

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

zbMATH Keywords

Lempel-Ziv algorithminformational divergenceuniversal classificationuniversal hypothesis testing

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Source coding (94A29)

Related Items (10)

Computing the relative entropy between regular tree languages ⋮ Algorithmic relative complexity ⋮ Relative entropy via non-sequential recursive pair substitution ⋮ Distance measures for biological sequences: some recent approaches ⋮ Non-parametric change-point estimation using string matching algorithms ⋮ An example of mathematical authorship attribution ⋮ Expanding the algorithmic information theory frame for applications to Earth observation ⋮ Artificial sequences and complexity measures ⋮ Mathematical Models of Textual Data: A Short Review ⋮ Data compression and learning in time sequences analysis

This page was built for publication: A measure of relative entropy between individual sequences with application to universal classification