<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-10-12T10:30:43Z</responseDate>
  <request identifier="629" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:629</identifier>
        <datestamp>2024-03-06T10:06:41Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Automatic Meaning Discovery Using Google</dc:title>
          <dc:creator>Cilibrasi, Rudi</dc:creator>
          <dc:creator>Vitanyi, Paul M.B.</dc:creator>
          <dc:subject>Normalized Compression Distance</dc:subject>
          <dc:subject>Clustering</dc:subject>
          <dc:subject>Clasification</dc:subject>
          <dc:subject>Relative Semantics of Terms</dc:subject>
          <dc:subject>Google</dc:subject>
          <dc:subject>World-Wide-Web</dc:subject>
          <dc:subject>Kolmogorov complexity</dc:subject>
          <dc:description>We survey a new area of parameter-free similarity distance measures&#13;
useful in data-mining,&#13;
pattern recognition, learning and automatic semantics extraction.&#13;
Given a family of distances on a set of objects,&#13;
a distance is universal up to a certain precision for that family if it&#13;
minorizes every distance in the family between every two objects&#13;
in the set, up to the stated precision (we do not require the universal&#13;
distance to be an element of the family).&#13;
We consider similarity distances&#13;
for two types of objects: literal objects that as such contain all of their&#13;
meaning, like genomes or books, and names for objects.&#13;
The latter may have&#13;
literal embodyments like the first type, but may also&#13;
be abstract like ``red'' or ``christianity.'' For the first type&#13;
we consider&#13;
a family of computable distance measures&#13;
corresponding to parameters expressing similarity according to&#13;
particular features&#13;
between&#13;
pairs of literal objects. For the second type we consider similarity&#13;
distances generated by web users corresponding to particular semantic&#13;
relations between the (names for) the designated objects.&#13;
For both families we give universal similarity&#13;
distance measures, incorporating all particular distance measures&#13;
in the family. In the first case the universal&#13;
distance is based on compression and in the second&#13;
case it is based on Google page counts related to search terms.&#13;
In both cases experiments on a massive scale give evidence of the&#13;
viability of the approaches.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Rudi Cilibrasi and Paul M.B. Vitanyi</dc:contributor>
          <dc:date>2006</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 6051, Kolmogorov Complexity and Applications (2006)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.06051.3</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-6296</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.3</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
