<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns="http://purl.org/rss/1.0/" xmlns:admin="http://webns.net/mvcb/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:cc="http://web.resource.org/cc/"><channel rdf:about="http://www.bibsonomy.org/author/Cilibrasi"><title>BibSonomy publications for /author/Cilibrasi</title><link>BibSonomypublrss/author/Cilibrasi</link><description>BibSonomy RSS feed for /author/Cilibrasi</description><dc:date>2012-02-16T05:22:49+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/226f35d6a29010583da2a68eedaaf690e/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/24ee6e45b8093dd9b85f4a7a7283c4073/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2104bb0bb1c60788ad33a2dcbb667a9c0/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2980e695898971b62190c24968d6dc4ba/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2843814ffb84515f3d8473d783fd92bc0/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2437af6bd0bd018d8ca52d51ecc169d40/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/24097e4eb25f3f99979360e6e13c40256/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f83e6f389f2afe8bb829abf62db308f0/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2d9a48907c77e47a0097dfe2a6160e82c/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/250308d5168f519ce89a71fa67574ac25/gromgull"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2aadd39f3c0413848cbc72092e9ac4fb1/wyswilson"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2cb260a59280a6312cdd532222ec10930/wyswilson"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2d7887bf271cc02fda6713e9d64c7f0bf/wyswilson"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2e2ae8887137141b9d5f895b5333cf226/lina.wolf"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/200ba496f53767b92d5965db71eeea8bf/dbenz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25156d51daa332b82b27cc4665dbff1f5/dbenz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/24e823daa890d0bafff91045fd4bedb0b/mortimer_m8"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29d1d18e90d3b3c38d04e78d0471800b8/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25797b28e3963b54f8e748b764a3c0896/wyswilson"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2049b2bfae97bca112c4153f4742f3ca1/wyswilson"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/226f35d6a29010583da2a68eedaaf690e/dblp"><title>Clustering by compression</title><link>http://www.bibsonomy.org/bibtex/226f35d6a29010583da2a68eedaaf690e/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;Rudi Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Vitányi&#034;&gt;Paul M. B. Vitányi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2003&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/24ee6e45b8093dd9b85f4a7a7283c4073/dblp"><title>About the Lifespan of Peer to Peer Networks</title><link>http://www.bibsonomy.org/bibtex/24ee6e45b8093dd9b85f4a7a7283c4073/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;Rudi Cilibrasi&lt;/a&gt;, &lt;a href=&#034;/author/Lotker&#034;&gt;Zvi Lotker&lt;/a&gt;, &lt;a href=&#034;/author/Navarra&#034;&gt;Alfredo Navarra&lt;/a&gt;, &lt;a href=&#034;/author/Pérennes&#034;&gt;Stéphane Pérennes&lt;/a&gt;,  and &lt;a href=&#034;/author/Vitányi&#034;&gt;Paul M. B. Vitányi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2104bb0bb1c60788ad33a2dcbb667a9c0/dblp"><title>The Google Similarity Distance</title><link>http://www.bibsonomy.org/bibtex/2104bb0bb1c60788ad33a2dcbb667a9c0/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;Rudi Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Vitányi&#034;&gt;Paul M. B. Vitányi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2980e695898971b62190c24968d6dc4ba/dblp"><title>Algorithmic Clustering of Music</title><link>http://www.bibsonomy.org/bibtex/2980e695898971b62190c24968d6dc4ba/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;Rudi Cilibrasi&lt;/a&gt;, &lt;a href=&#034;/author/Vitányi&#034;&gt;Paul M. B. Vitányi&lt;/a&gt;,  and &lt;a href=&#034;/author/de Wolf&#034;&gt;Ronald de Wolf&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2003&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2843814ffb84515f3d8473d783fd92bc0/dblp"><title>Similarity of Objects and the Meaning of Words</title><link>http://www.bibsonomy.org/bibtex/2843814ffb84515f3d8473d783fd92bc0/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;Rudi Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Vitányi&#034;&gt;Paul M. B. Vitányi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2437af6bd0bd018d8ca52d51ecc169d40/dblp"><title>Normalized Web Distance and Word Similarity</title><link>http://www.bibsonomy.org/bibtex/2437af6bd0bd018d8ca52d51ecc169d40/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;Rudi Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Vitányi&#034;&gt;Paul M. B. Vitányi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2009&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/24097e4eb25f3f99979360e6e13c40256/dblp"><title>A New Quartet Tree Heuristic for Hierarchical Clustering</title><link>http://www.bibsonomy.org/bibtex/24097e4eb25f3f99979360e6e13c40256/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;Rudi Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Vitányi&#034;&gt;Paul M. B. Vitányi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f83e6f389f2afe8bb829abf62db308f0/dblp"><title>Limits of Rush Hour Logic Complexity</title><link>http://www.bibsonomy.org/bibtex/2f83e6f389f2afe8bb829abf62db308f0/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Tromp&#034;&gt;John Tromp&lt;/a&gt;,  and &lt;a href=&#034;/author/Cilibrasi&#034;&gt;Rudi Cilibrasi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2005&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2d9a48907c77e47a0097dfe2a6160e82c/dblp"><title>Normalized Information Distance</title><link>http://www.bibsonomy.org/bibtex/2d9a48907c77e47a0097dfe2a6160e82c/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Vitányi&#034;&gt;Paul M. B. Vitányi&lt;/a&gt;, &lt;a href=&#034;/author/Balbach&#034;&gt;Frank J. Balbach&lt;/a&gt;, &lt;a href=&#034;/author/Cilibrasi&#034;&gt;Rudi Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Li&#034;&gt;Ming Li&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2008&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/250308d5168f519ce89a71fa67574ac25/gromgull"><title>Automatic Meaning Discovery Using Google</title><link>http://www.bibsonomy.org/bibtex/250308d5168f519ce89a71fa67574ac25/gromgull</link><dc:creator>gromgull</dc:creator><dc:date>2011-11-23T16:24:13+01:00</dc:date><dc:subject>distance-measure google machine-learning </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;Rudi Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Vitanyi&#034;&gt;Paul M. B. Vitanyi&lt;/a&gt; &lt;/span&gt;  (&lt;em&gt;March 2005&lt;/em&gt;)&lt;em&gt;v2
		    .
	    &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/distance-measure"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/google"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/machine-learning"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2aadd39f3c0413848cbc72092e9ac4fb1/wyswilson"><title>Automatic Extraction of Meaning from the Web</title><link>http://www.bibsonomy.org/bibtex/2aadd39f3c0413848cbc72092e9ac4fb1/wyswilson</link><dc:creator>wyswilson</dc:creator><dc:date>2011-04-14T07:06:28+02:00</dc:date><dc:subject>imported </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;R. Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Vitanyi&#034;&gt;P. Vitanyi&lt;/a&gt; &lt;/span&gt;(&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2cb260a59280a6312cdd532222ec10930/wyswilson"><title>The Google Similarity Distance</title><link>http://www.bibsonomy.org/bibtex/2cb260a59280a6312cdd532222ec10930/wyswilson</link><dc:creator>wyswilson</dc:creator><dc:date>2011-04-14T07:06:28+02:00</dc:date><dc:subject>imported </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;R. Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Vitanyi&#034;&gt;P. Vitanyi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;IEEE Transactions on Knowledge and Data Engineering&lt;/em&gt; &lt;em&gt;19(3):370-383&lt;/em&gt; (&lt;em&gt;2007&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2d7887bf271cc02fda6713e9d64c7f0bf/wyswilson"><title>Normalized Information Distance</title><link>http://www.bibsonomy.org/bibtex/2d7887bf271cc02fda6713e9d64c7f0bf/wyswilson</link><dc:creator>wyswilson</dc:creator><dc:date>2011-04-14T07:06:28+02:00</dc:date><dc:subject>imported </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Vitanyi&#034;&gt;P. Vitanyi&lt;/a&gt;, &lt;a href=&#034;/author/Balbach&#034;&gt;F. Balbach&lt;/a&gt;, &lt;a href=&#034;/author/Cilibrasi&#034;&gt;R. Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Li&#034;&gt;M. Li&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Information Theory and Statistical Learning, &lt;/em&gt;&lt;em&gt;New-York: Springer, &lt;/em&gt;(&lt;em&gt;2009&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2e2ae8887137141b9d5f895b5333cf226/lina.wolf"><title>The Google Similarity Distance</title><link>http://www.bibsonomy.org/bibtex/2e2ae8887137141b9d5f895b5333cf226/lina.wolf</link><dc:creator>lina.wolf</dc:creator><dc:date>2011-03-08T08:43:28+01:00</dc:date><dc:subject>google similarity </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;Rudi L. Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Vitáni&#034;&gt;Paul M.B. Vitáni&lt;/a&gt; &lt;/span&gt;  (&lt;em&gt;2007&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/google"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/200ba496f53767b92d5965db71eeea8bf/dbenz"><title>The Google Similarity Distance</title><link>http://www.bibsonomy.org/bibtex/200ba496f53767b92d5965db71eeea8bf/dbenz</link><dc:creator>dbenz</dc:creator><dc:date>2011-01-28T11:34:03+01:00</dc:date><dc:subject>google relatedness_measures web_based imported </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;Rudi Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Vitanyi&#034;&gt;Paul M. B. Vitanyi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;IEEE Transactions on Knowledge and Data Engineering&lt;/em&gt;  (&lt;em&gt;2007&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/google"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/relatedness_measures"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web_based"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/></rdf:Bag></taxo:topics><description>[cs/0412098] The Google Similarity Distance</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/25156d51daa332b82b27cc4665dbff1f5/dbenz"><title>Clustering by compression</title><link>http://www.bibsonomy.org/bibtex/25156d51daa332b82b27cc4665dbff1f5/dbenz</link><dc:creator>dbenz</dc:creator><dc:date>2011-01-28T11:32:21+01:00</dc:date><dc:subject>toread compression clustering </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;R. Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Vitanyi&#034;&gt;P.M.B. Vitanyi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;IEEE Transactions on Information Theory&lt;/em&gt; &lt;em&gt;51(4):1523-1545&lt;/em&gt; (&lt;em&gt;April 2005&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/toread"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/compression"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustering"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/24e823daa890d0bafff91045fd4bedb0b/mortimer_m8"><title>The Google Similarity Distance</title><link>http://www.bibsonomy.org/bibtex/24e823daa890d0bafff91045fd4bedb0b/mortimer_m8</link><dc:creator>mortimer_m8</dc:creator><dc:date>2010-12-17T18:47:41+01:00</dc:date><dc:subject>automatic-learning, google, linguistics, ontology, semantic </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;Rudi Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Vitanyi&#034;&gt;Paul M. B. Vitanyi&lt;/a&gt; &lt;/span&gt;  (&lt;em&gt;May 30, 2007&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/automatic-learning,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/google,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/linguistics,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ontology,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/semantic"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/29d1d18e90d3b3c38d04e78d0471800b8/dblp"><title>A Fast Quartet tree heuristic for hierarchical clustering.</title><link>http://www.bibsonomy.org/bibtex/29d1d18e90d3b3c38d04e78d0471800b8/dblp</link><dc:creator>dblp</dc:creator><dc:date>2010-12-06T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;Rudi Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Vitányi&#034;&gt;Paul M. B. Vitányi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Pattern Recognition&lt;/em&gt; &lt;em&gt;44(3):662-677&lt;/em&gt; (&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/25797b28e3963b54f8e748b764a3c0896/wyswilson"><title>Normalized Information Distance</title><link>http://www.bibsonomy.org/bibtex/25797b28e3963b54f8e748b764a3c0896/wyswilson</link><dc:creator>wyswilson</dc:creator><dc:date>2010-11-26T09:32:26+01:00</dc:date><dc:subject>imported </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Vitanyi&#034;&gt;P. Vitanyi&lt;/a&gt;, &lt;a href=&#034;/author/Balbach&#034;&gt;F. Balbach&lt;/a&gt;, &lt;a href=&#034;/author/Cilibrasi&#034;&gt;R. Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Li&#034;&gt;M. Li&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Information Theory and Statistical Learning, &lt;/em&gt;&lt;em&gt;New-York: Springer, &lt;/em&gt;(&lt;em&gt;2009&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2049b2bfae97bca112c4153f4742f3ca1/wyswilson"><title>Automatic Extraction of Meaning from the Web</title><link>http://www.bibsonomy.org/bibtex/2049b2bfae97bca112c4153f4742f3ca1/wyswilson</link><dc:creator>wyswilson</dc:creator><dc:date>2010-11-26T09:32:26+01:00</dc:date><dc:subject>imported </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cilibrasi&#034;&gt;R. Cilibrasi&lt;/a&gt;,  and &lt;a href=&#034;/author/Vitanyi&#034;&gt;P. Vitanyi&lt;/a&gt; &lt;/span&gt;(&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/></rdf:Bag></taxo:topics></item></rdf:RDF>
