Web Similarity

02/20/2015
by   Andrew R. Cohen, et al.
0

Normalized web distance (NWD) is a similarity or normalized semantic distance based on the World Wide Web or any other large electronic database, for instance Wikipedia, and a search engine that returns reliable aggregate page counts. For sets of search terms the NWD gives a similarity on a scale from 0 (identical) to 1 (completely different). The NWD approximates the similarity according to all (upper semi)computable properties. We develop the theory and give applications. The derivation of the NWD method is based on Kolmogorov complexity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/16/2010

Normalized Information Distance is Not Semicomputable

Normalized information distance (NID) uses the theoretical notion of Kol...
research
11/20/2001

The similarity metric

A new class of distances appropriate for measuring similarity relations ...
research
02/17/2006

Similarity of Objects and the Meaning of Words

We survey the emerging area of compression-based, parameter-free, simila...
research
08/11/2017

Normalized Information Distance and the Oscillation Hierarchy

We study the complexity of approximations to the normalized information ...
research
01/09/2017

Just an Update on PMING Distance for Web-based Semantic Similarity in Artificial Intelligence and Data Mining

One of the main problems that emerges in the classic approach to semanti...
research
11/28/2013

An Alternate Approach for Designing a Domain Specific Image Search Prototype Using Histogram

Everyone knows that thousand of words are represented by a single image....
research
12/19/2003

Clustering by compression

We present a new method for clustering based on compression. The method ...

Please sign up or login with your details

Forgot password? Click here to reset