Loading...
Please wait, while we are loading the content...
Similar Documents
Normalized Information Distance (2008)
| Content Provider | CiteSeerX |
|---|---|
| Author | Li, Ming Balbach, Frank J. Vitányi, Paul M. B. Cilibrasi, Rudi L. |
| Abstract | 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, especially 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. |
| File Format | |
| Publisher Date | 2008-01-01 |
| Access Restriction | Open |
| Subject Keyword | Successful Real-world Application Kolmogorov Complexity Compression Algorithm Machine Translation Theoretical Foundation Abstract Concept World Wide Web Normalized Information Distance Practical Realization Universal Distance Measure Parameter-free Data Mining Information Distance Numerous Example Distance Measure Page Count Statistic String Representation |
| Content Type | Text |
| Resource Type | Article |
