On an Application of Relative Entropy

Simple item page
dc.creatorKhmelev, Dmitry V.
dc.creatorTeahan, William J.
dc.date2002-05-24
dc.date2003-01-11
dc.date.accessioned2026-07-07T02:45:36Z
dc.date.available2026-07-07T02:45:36Z
dc.descriptionWe 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.
dc.description1 page, to be published in PRL
dc.identifierhttps://arxiv.org/abs/cond-mat/0205521
dc.identifierhttp://arxiv.org/abs/cond-mat/0205521
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/19357
dc.subjectStatistical Mechanics
dc.subjectDisordered Systems and Neural Networks
dc.titleOn an Application of Relative Entropy
dc.typetext

Files

Collections

arXiv