2000 character limit reached
Kolmogorov Complexity: Clustering Objects and Similarity (1207.6188v1)
Published 26 Jul 2012 in cs.CC and cs.DC
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.