arXiv:cond-mat/0205521 Abstract

arXiv:cond-mat/0205521Abstract References Reviews Resources

On an Application of Relative Entropy

Published 2002-05-24, updated 2003-01-11Version 2

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.

Comments: 1 page, to be published in PRL

Categories: cond-mat.stat-mech, cond-mat.dis-nn

Keywords: relative entropy, first order markov chain approach, application, effective first order markov chain, computationally effective first order markov

Related articles: Most relevant | Search more

arXiv:cond-mat/0507525 (Published 2005-07-22, updated 2006-01-03)

An algorithm for counting circuits: application to real-world and random graphs

Enzo Marinari, Remi Monasson, Guilhem Semerjian

arXiv:cond-mat/0411450 (Published 2004-11-17)

New Application of Functional Integrals to Classical Mechanics

Anton Zherebtsov, Kirill Ilinski

arXiv:cond-mat/0105473 (Published 2001-05-24)

Preferential growth: Solution and application to modeling stock market