Computer Science – Information Retrieval
Scientific paper
2008-09-15
Computer Science
Information Retrieval
33 pages, 12 figures, pdf, in: Normalized information distance, in: Information Theory and Statistical Learning, Eds. M. Dehme
Scientific paper
The normalized information distance is a universal distance measure for objects of all kinds. It is based on Kolmogorov complexity and thus uncomputable, but there are ways to utilize it. First, compression algorithms can be used to approximate the Kolmogorov complexity if the objects have a string representation. Second, for names and abstract concepts, page count statistics from the World Wide Web can be used. These practical realizations of the normalized information distance can then be applied to machine learning tasks, expecially clustering, to perform feature-free and parameter-free data mining. This chapter discusses the theoretical foundations of the normalized information distance and both practical realizations. It presents numerous examples of successful real-world applications based on these distance measures, ranging from bioinformatics to music clustering to machine translation.
Balbach Frank J.
Cilibrasi Rudi L.
Li Ming
Vitanyi Paul M. B.
No associations
LandOfFree
Normalized Information Distance does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Normalized Information Distance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Normalized Information Distance will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-635522