An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Upper semi-lattice of binary strings with the relation "x is simple conditional to y"
Theoretical Computer Science
Conditional complexity and codes
Theoretical Computer Science
Logical operations and Kolmogorov complexity
Theoretical Computer Science
Independent minimum length programs to translate between given strings
Theoretical Computer Science
Information distance and conditional complexities
Theoretical Computer Science
Logical Operations and Kolmogorov Complexity II
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Towards parameter-free data mining
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Algorithmic Clustering of Music Based on String Compression
Computer Music Journal
2005 Special Issue: The context-tree kernel for strings
Neural Networks - Special issue on neural networks and kernel methods for structured domains
Clustering Fetal Heart Rate Tracings by Compression
CBMS '06 Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems
Shared information and program plagiarism detection
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We summarize the recent developments of a general theory of information distance and its applications in whole genome phylogeny, document comparison, internet query-answer systems, and many other data mining tasks. We also solve an open problem regarding the universality of the normalized information distance.