Kolmogorov Complexity: Clustering Objects and Similarity
Computational Complexity
2012-07-27 v1 Distributed, Parallel, and Cluster Computing
Abstract
The clustering objects has become one of themes in many studies, and do not few researchers use the similarity to cluster the instances automatically. However, few research consider using Kommogorov Complexity to get information about objects from documents, such as Web pages, where the rich information from an approach proved to be difficult to. In this paper, we proposed a similarity measure from Kolmogorov Complexity, and we demonstrate the possibility of exploiting features from Web based on hit counts for objects of Indonesia Intellectual.
Keywords
Cite
@article{arxiv.1207.6188,
title = {Kolmogorov Complexity: Clustering Objects and Similarity},
author = {Mahyuddin K. M. Nasution},
journal= {arXiv preprint arXiv:1207.6188},
year = {2012}
}
Comments
13 pages; Bulletin of Mathematics, Vol. 3 (2011), No. 1: 1-16