Compression-based Similarity

Details Compression-based Similarity Compression-based Similarity

2011-10-20

arxiv.org/abs/1110.4544v1

Computer Science

Information Theory

Latex, 8 pages, 2 fgures, in Proc. IEEE 1st Int. Conf. Data Compression, Communication and Processing, Palurno, Italy, June 21

Scientific paper

First we consider pair-wise distances for literal objects consisting of finite binary files. These files are taken to contain all of their meaning, like genomes or books. The distances are based on compression of the objects concerned, normalized, and can be viewed as similarity distances. Second, we consider pair-wise distances between names of objects, like "red" or "christianity." In this case the distances are based on searches of the Internet. Such a search can be performed by any search engine that returns aggregate page counts. We can extract a code length from the numbers returned, use the same formula as before, and derive a similarity or relative semantics between names for objects. The theory is based on Kolmogorov complexity. We test both similarities extensively experimentally.

Affiliated with

Also associated with

No associations

Rating

Compression-based Similarity 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 Compression-based Similarity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compression-based Similarity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-552066