<?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/"
		>
<channel>
	<title>Comments for Aperte.org</title>
	<atom:link href="http://aperte.org/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://aperte.org</link>
	<description>Jeremy Handcock</description>
	<lastBuildDate>Tue, 30 Nov 2010 07:18:42 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.1</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on So you want an elected Senate? Think twice. by Jeremy Handcock</title>
		<link>http://aperte.org/2010/02/16/so-you-want-an-elected-senate-think-twice/comment-page-1/#comment-38698</link>
		<dc:creator>Jeremy Handcock</dc:creator>
		<pubDate>Tue, 30 Nov 2010 07:18:42 +0000</pubDate>
		<guid isPermaLink="false">http://aperte.org/?p=625#comment-38698</guid>
		<description>@Sabrina S.: Yes, I compiled the graph using data obtained from the LEGISinfo database. Feel free to cite these data, however, note that the numbers haven&#039;t been reviewed by anyone but myself.</description>
		<content:encoded><![CDATA[<p>@Sabrina S.: Yes, I compiled the graph using data obtained from the LEGISinfo database. Feel free to cite these data, however, note that the numbers haven't been reviewed by anyone but myself.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on So you want an elected Senate? Think twice. by Sabrina S.</title>
		<link>http://aperte.org/2010/02/16/so-you-want-an-elected-senate-think-twice/comment-page-1/#comment-38693</link>
		<dc:creator>Sabrina S.</dc:creator>
		<pubDate>Mon, 29 Nov 2010 17:17:58 +0000</pubDate>
		<guid isPermaLink="false">http://aperte.org/?p=625#comment-38693</guid>
		<description>Did you compile the graph? i need to do something similar for a paper and if I use your graph as part of my research then I need to cite it properly. Thanks!</description>
		<content:encoded><![CDATA[<p>Did you compile the graph? i need to do something similar for a paper and if I use your graph as part of my research then I need to cite it properly. Thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Learning from strangers by Learning from strangers &#124; Catenary</title>
		<link>http://aperte.org/2010/08/05/learning-from-strangers/comment-page-1/#comment-38648</link>
		<dc:creator>Learning from strangers &#124; Catenary</dc:creator>
		<pubDate>Thu, 25 Nov 2010 02:04:20 +0000</pubDate>
		<guid isPermaLink="false">http://aperte.org/?p=689#comment-38648</guid>
		<description>[...] got a copy of &quot;Learning from Strangers,&quot; by Robert S. Weiss, after reading about it in Jeremy Handcock&#8217;s blog. It&#8217;s such a good book that I wanted to bang my head against a wall for not reading it [...]</description>
		<content:encoded><![CDATA[<p>[...] got a copy of "Learning from Strangers," by Robert S. Weiss, after reading about it in Jeremy Handcock&#8217;s blog. It&#8217;s such a good book that I wanted to bang my head against a wall for not reading it [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Learning from strangers by Whitney Hess</title>
		<link>http://aperte.org/2010/08/05/learning-from-strangers/comment-page-1/#comment-37751</link>
		<dc:creator>Whitney Hess</dc:creator>
		<pubDate>Mon, 09 Aug 2010 02:39:59 +0000</pubDate>
		<guid isPermaLink="false">http://aperte.org/?p=689#comment-37751</guid>
		<description>Thanks so much for the link love!</description>
		<content:encoded><![CDATA[<p>Thanks so much for the link love!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Design that disappears by Jeremy Handcock</title>
		<link>http://aperte.org/2010/08/07/design-that-disappears/comment-page-1/#comment-37749</link>
		<dc:creator>Jeremy Handcock</dc:creator>
		<pubDate>Sun, 08 Aug 2010 16:24:31 +0000</pubDate>
		<guid isPermaLink="false">http://aperte.org/?p=693#comment-37749</guid>
		<description>Bang on! I didn&#039;t know anything about Heidegger, but Weiser actually references &quot;ready-to-hand&quot; in his article:

&lt;blockquote&gt;
Whenever people learn something sufficiently well, they cease to be aware of it. [...] Computer scientist, economist, and Nobelist Herb Simon calls this phenomenon &quot;compiling&quot;; philosopher Michael Polanyi calls it the &quot;tacit dimension&quot;; psychologist TK Gibson calls it &quot;visual invariants&quot;; philosophers Georg Gadamer and Martin Heidegger call it &quot;the horizon&quot; and the &quot;ready-to-hand&quot;, John Seely Brown at PARC calls it the &quot;periphery&quot;.
&lt;/blockquote&gt;

Indeed, the challenge is in the execution, which I guess is the reason why Weiser&#039;s article sounds like it could have been written yesterday.  These are great thoughts to tuck away in a back pocket when getting down to the details of a design, though.  Another reason that his words sound so present may be that such design thinking has only recently entered the mainstream in software development.</description>
		<content:encoded><![CDATA[<p>Bang on! I didn't know anything about Heidegger, but Weiser actually references "ready-to-hand" in his article:</p>
<blockquote><p>
Whenever people learn something sufficiently well, they cease to be aware of it. [...] Computer scientist, economist, and Nobelist Herb Simon calls this phenomenon "compiling"; philosopher Michael Polanyi calls it the "tacit dimension"; psychologist TK Gibson calls it "visual invariants"; philosophers Georg Gadamer and Martin Heidegger call it "the horizon" and the "ready-to-hand", John Seely Brown at PARC calls it the "periphery".
</p></blockquote>
<p>Indeed, the challenge is in the execution, which I guess is the reason why Weiser's article sounds like it could have been written yesterday.  These are great thoughts to tuck away in a back pocket when getting down to the details of a design, though.  Another reason that his words sound so present may be that such design thinking has only recently entered the mainstream in software development.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Design that disappears by Jorge Aranda</title>
		<link>http://aperte.org/2010/08/07/design-that-disappears/comment-page-1/#comment-37746</link>
		<dc:creator>Jorge Aranda</dc:creator>
		<pubDate>Sun, 08 Aug 2010 14:26:55 +0000</pubDate>
		<guid isPermaLink="false">http://aperte.org/?p=693#comment-37746</guid>
		<description>These &quot;designs that disappear&quot; concept sounds like Heidegger&#039;s idea of readiness of objects; see for instance the entry on &quot;Ready-to-hand&quot; here: http://en.wikipedia.org/wiki/Heideggerian_terminology

Of course, the trick is to bring the concept to fruition...</description>
		<content:encoded><![CDATA[<p>These "designs that disappear" concept sounds like Heidegger's idea of readiness of objects; see for instance the entry on "Ready-to-hand" here: <a href="http://en.wikipedia.org/wiki/Heideggerian_terminology" rel="nofollow">http://en.wikipedia.org/wiki/Heideggerian_terminology</a></p>
<p>Of course, the trick is to bring the concept to fruition...</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Almost famous by Jeremy Handcock</title>
		<link>http://aperte.org/2010/06/08/almost-famous/comment-page-1/#comment-37061</link>
		<dc:creator>Jeremy Handcock</dc:creator>
		<pubDate>Fri, 11 Jun 2010 01:55:47 +0000</pubDate>
		<guid isPermaLink="false">http://aperte.org/?p=685#comment-37061</guid>
		<description>Hi Neil, thanks for the tip on ArXiv.org.  Yeah, an ICSE workshop might be a possibility.  I&#039;ll watch to see what comes up for 2011.</description>
		<content:encoded><![CDATA[<p>Hi Neil, thanks for the tip on ArXiv.org.  Yeah, an ICSE workshop might be a possibility.  I'll watch to see what comes up for 2011.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Almost famous by Neil</title>
		<link>http://aperte.org/2010/06/08/almost-famous/comment-page-1/#comment-37053</link>
		<dc:creator>Neil</dc:creator>
		<pubDate>Wed, 09 Jun 2010 13:56:58 +0000</pubDate>
		<guid isPermaLink="false">http://aperte.org/?p=685#comment-37053</guid>
		<description>Jeremy, you should consider posting this on ArXiv.org. That way it will be more accessible and longer-lived (should you not renew your domain for example).

I wonder if another venue would be suitable. Maybe an ICSE workshop?</description>
		<content:encoded><![CDATA[<p>Jeremy, you should consider posting this on ArXiv.org. That way it will be more accessible and longer-lived (should you not renew your domain for example).</p>
<p>I wonder if another venue would be suitable. Maybe an ICSE workshop?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Cheap data mining tricks by Jeremy Handcock</title>
		<link>http://aperte.org/2010/05/10/cheap-data-mining-tricks/comment-page-1/#comment-36850</link>
		<dc:creator>Jeremy Handcock</dc:creator>
		<pubDate>Wed, 12 May 2010 00:38:41 +0000</pubDate>
		<guid isPermaLink="false">http://aperte.org/?p=675#comment-36850</guid>
		<description>Hi George, thanks for your comment.  You&#039;re correct in that a distance derived from the Normalized Google Distance (NGD) isn&#039;t really comparable to a distance derived from LSI, so it&#039;s inappropriate to classify any technique using NGD as an &quot;alternative&quot; to LSI.  Instead, NGD is a single technique in the complete set of semantic analysis techniques (as is LSI).  Obviously the appropriateness of each technique depends on the application.  My apologies for the confusion.

The point about scalability is not necessarily with respect to the application discussed in the paper.  Instead, it&#039;s about employing a semantic distance measure at huge scale (e.g., the scale of the world wide web) in which case LSI would not be appropriate.  Consider the example of computing a semantic distance between &#039;horse&#039; and &#039;saddle&#039; using all the documents in the Google search index as the document set.</description>
		<content:encoded><![CDATA[<p>Hi George, thanks for your comment.  You're correct in that a distance derived from the Normalized Google Distance (NGD) isn't really comparable to a distance derived from LSI, so it's inappropriate to classify any technique using NGD as an "alternative" to LSI.  Instead, NGD is a single technique in the complete set of semantic analysis techniques (as is LSI).  Obviously the appropriateness of each technique depends on the application.  My apologies for the confusion.</p>
<p>The point about scalability is not necessarily with respect to the application discussed in the paper.  Instead, it's about employing a semantic distance measure at huge scale (e.g., the scale of the world wide web) in which case LSI would not be appropriate.  Consider the example of computing a semantic distance between 'horse' and 'saddle' using all the documents in the Google search index as the document set.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Cheap data mining tricks by George</title>
		<link>http://aperte.org/2010/05/10/cheap-data-mining-tricks/comment-page-1/#comment-36848</link>
		<dc:creator>George</dc:creator>
		<pubDate>Tue, 11 May 2010 21:21:41 +0000</pubDate>
		<guid isPermaLink="false">http://aperte.org/?p=675#comment-36848</guid>
		<description>So you have 4323 disceases and 2585 proteins?  And in order to compute the co-occurence counts you need to do a scan over 16,000,000 documents?  But the hypothetical term document matrix would only end up being 4323 by 2585?  Am I understanding this correctly? If I am, why is there any problem at all in running the most naive matrix factorization method on the small matrix you make?  Furthermore, your post sets up what seems to be a false dichotomy between using LSI and using the NMD formula. You could easily run SVD on a matrix with entries computed using the NMD formula.  What is your actual point about scalability?

As far as I can tell, the paper just picks a formula for computing similarity based on simple count statistics.  This isn&#039;t really an LSI alternative except in the sense that &quot;not doing LSI&quot; is an LSI alternative.  What I mean by that, is that the statistics you compute would have been the input to LSI. So a situation where someone might want to use LSI would almost be by definition a situation in which the pairwise NMD matrix isn&#039;t sufficient for the task.</description>
		<content:encoded><![CDATA[<p>So you have 4323 disceases and 2585 proteins?  And in order to compute the co-occurence counts you need to do a scan over 16,000,000 documents?  But the hypothetical term document matrix would only end up being 4323 by 2585?  Am I understanding this correctly? If I am, why is there any problem at all in running the most naive matrix factorization method on the small matrix you make?  Furthermore, your post sets up what seems to be a false dichotomy between using LSI and using the NMD formula. You could easily run SVD on a matrix with entries computed using the NMD formula.  What is your actual point about scalability?</p>
<p>As far as I can tell, the paper just picks a formula for computing similarity based on simple count statistics.  This isn't really an LSI alternative except in the sense that "not doing LSI" is an LSI alternative.  What I mean by that, is that the statistics you compute would have been the input to LSI. So a situation where someone might want to use LSI would almost be by definition a situation in which the pairwise NMD matrix isn't sufficient for the task.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

