On an Application of Relative Entropy
Dmitry V. Khmelev, William J. Teahan
Abstract
We describe general approach to classification of character sequences (texts, DNA) using relative entropy estimated by off-the-shelf compression and Markov Chains and find them precise enough. We also notice that the method for estimating relative entropy described in the paper cond-mat/0108530 "Language Trees..." by D. Benedetto et al. was considered earlier and was found to be easily surpassed by the simple and computationally effective first order Markov Chain approach.
Create a lesson
Related papers
Global Minima of the Thomson Problem in a Disk: A Molecular Dynamics Approach with Fixed Border Charges
Georgiy K. Lavrov, Eduard G. Nikonov
Martingale theory for heat and phase-space contraction in heterogeneous diffusions
Jing Qin, Nariya Uchida, Édgar Roldán
Formal Fluctuation-Response Relations for Non-Stationary Systems: The Dynamic Conjugate Variable
Igor M. Sokolov
Khinchin's ergodicity and typicality in statistical mechanics
Dario Lucente, Marco Baldovin, Giacomo Gradenigo et al.
Universal 1/f Noise in the Power Spectra of Energy Time-series in Solvated DNA Dynamics
Harsh Sahu, Deepika Sardana, Pramod Kumar et al.
Landau diamagnetism and the de Haas-van Alphen effect from a single geometric construction
Sung-Hoon Lee