<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Concept classification via Google page counts</title>
	<atom:link href="http://involution.wordpress.com/2007/06/01/concept-classification-via-google-page-counts/feed/" rel="self" type="application/rss+xml" />
	<link>http://involution.wordpress.com/2007/06/01/concept-classification-via-google-page-counts/</link>
	<description>Ruminations and Illuminations in Mathematics</description>
	<lastBuildDate>Fri, 06 Jul 2007 18:10:40 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Coconuts</title>
		<link>http://involution.wordpress.com/2007/06/01/concept-classification-via-google-page-counts/#comment-47</link>
		<dc:creator>Coconuts</dc:creator>
		<pubDate>Sun, 03 Jun 2007 01:18:13 +0000</pubDate>
		<guid isPermaLink="false">http://involution.wordpress.com/2007/06/01/concept-classification-via-google-page-counts/#comment-47</guid>
		<description>Interesting work!  It reminds me a lot of &lt;a href=&quot;http://en.wikipedia.org/wiki/Latent_semantic_indexing&quot; rel=&quot;nofollow&quot;&gt;Latent Semantic Analysis&lt;/a&gt;, which similarly calculates similarity between terms by how often they co-occur in documents.  The algorithm that LSA uses is a little more complicated, and, I think, might address some of the weaknesses pointed out in the paper.  I think it might be neat to try to combine the two approaches, maybe by using google to find a more &quot;interesting&quot; document set to feed to LSA.</description>
		<content:encoded><![CDATA[<p>Interesting work!  It reminds me a lot of <a href="http://en.wikipedia.org/wiki/Latent_semantic_indexing" rel="nofollow">Latent Semantic Analysis</a>, which similarly calculates similarity between terms by how often they co-occur in documents.  The algorithm that LSA uses is a little more complicated, and, I think, might address some of the weaknesses pointed out in the paper.  I think it might be neat to try to combine the two approaches, maybe by using google to find a more &#8220;interesting&#8221; document set to feed to LSA.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Carnival of Mathematics IX &#171; JD2718</title>
		<link>http://involution.wordpress.com/2007/06/01/concept-classification-via-google-page-counts/#comment-46</link>
		<dc:creator>Carnival of Mathematics IX &#171; JD2718</dc:creator>
		<pubDate>Sat, 02 Jun 2007 14:24:57 +0000</pubDate>
		<guid isPermaLink="false">http://involution.wordpress.com/2007/06/01/concept-classification-via-google-page-counts/#comment-46</guid>
		<description>[...] attempts to Classify Concepts by search engine page Counts. [...]</description>
		<content:encoded><![CDATA[<p>[...] attempts to Classify Concepts by search engine page Counts. [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
