Web similarity in sets of search terms using database queries
SN Computer Science , Volume 1 p. 161
Normalized web distance (NWD) is a similarity or normalized semantic distance based on the World Wide Web or another 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 common similarity (common semantics) on a scale from 0 (identical) to 1 (completely different). The NWD approximates the similarity of members of a set according to all (upper semi) computable properties. We develop the theory and give applications of classifying using Amazon, Wikipedia, and the NCBI website from the National Institutes of Health. The last gives new correlations between health hazards. A restriction of the NWD to a set of two yields the earlier normalized Google distance (NGD), but no combination of the NGD’s of pairs in a set can extract the information the NWD extracts from the set. The NWD enables a new contextual (different databases) learning approach based on Kolmogorov complexity theory that incorporates knowledge from these databases.
|Normalized web distance, Pattern recognition, Data mining, Similarity, Classification, Kolmogorov complexity|
|SN Computer Science|
|Organisation||Algorithms and Complexity|
Cohen, A.R, & Vitányi, P.M.B. (2020). Web similarity in sets of search terms using database queries. SN Computer Science, 1. doi:10.1007/s42979-020-00148-5