Information Distance in Multiples

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Information distance is a parameter-free similarity measure based on compression, used in pattern recognition, data mining, phylogeny, clustering, and classification. The notion of information distance is extended from pairs to multiples (finite lists). We study maximal overlap, metricity, universality, minimal overlap, additivity, and normalized information distance in multiples. We use the theoretical notion of Kolmogorov complexity which for practical purposes is approximated by the length of the compressed version of the file involved, using a real-world compression program. {\em Index Terms}-- Information distance, multiples, pattern recognition, data mining, similarity, Kolmogorov complexity
LateX 14 pages, Submitted to a technical journal

Keywords

Computer Vision and Pattern Recognition, Machine Learning, J.3; E.4

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/230927

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0905.3347
 http://arxiv.org/abs/0905.3347

Collections

arXiv