<?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 on: Lectures on the Google Technology Stack 1: Introduction to PageRank</title>
	<atom:link href="http://michaelnielsen.org/blog/lectures-on-the-google-technology-stack-1-introduction-to-pagerank/feed/" rel="self" type="application/rss+xml" />
	<link>http://michaelnielsen.org/blog/lectures-on-the-google-technology-stack-1-introduction-to-pagerank/</link>
	<description></description>
	<lastBuildDate>Mon, 07 May 2012 21:35:26 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3</generator>
	<item>
		<title>By: Michael Nielsen</title>
		<link>http://michaelnielsen.org/blog/lectures-on-the-google-technology-stack-1-introduction-to-pagerank/comment-page-1/#comment-36215</link>
		<dc:creator>Michael Nielsen</dc:creator>
		<pubDate>Tue, 27 Mar 2012 21:54:21 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=506#comment-36215</guid>
		<description>@leo - Yes, you&#039;re quite right.  I&#039;ve now fixed the offending indices.  Thanks.</description>
		<content:encoded><![CDATA[<p>@leo &#8211; Yes, you&#8217;re quite right.  I&#8217;ve now fixed the offending indices.  Thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: leo</title>
		<link>http://michaelnielsen.org/blog/lectures-on-the-google-technology-stack-1-introduction-to-pagerank/comment-page-1/#comment-36009</link>
		<dc:creator>leo</dc:creator>
		<pubDate>Fri, 02 Mar 2012 14:53:45 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=506#comment-36009</guid>
		<description>I think the indices in G_{jk}, E_{jk}, etc. are inverted.</description>
		<content:encoded><![CDATA[<p>I think the indices in G_{jk}, E_{jk}, etc. are inverted.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: How to combine multiple notions of relevance in search &#124; DDI</title>
		<link>http://michaelnielsen.org/blog/lectures-on-the-google-technology-stack-1-introduction-to-pagerank/comment-page-1/#comment-35749</link>
		<dc:creator>How to combine multiple notions of relevance in search &#124; DDI</dc:creator>
		<pubDate>Sat, 04 Feb 2012 15:16:14 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=506#comment-35749</guid>
		<description>[...] how relevant a given webpage is to a search query: (1) the cosine similarity measure; and (2) the PageRank, which is a query-independent measure of the importance of a page. While it&#8217;s good that we [...]</description>
		<content:encoded><![CDATA[<p>[...] how relevant a given webpage is to a search query: (1) the cosine similarity measure; and (2) the PageRank, which is a query-independent measure of the importance of a page. While it&#8217;s good that we [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Documents as geometric objects: how to rank documents for full-text search &#124; DDI</title>
		<link>http://michaelnielsen.org/blog/lectures-on-the-google-technology-stack-1-introduction-to-pagerank/comment-page-1/#comment-30871</link>
		<dc:creator>Documents as geometric objects: how to rank documents for full-text search &#124; DDI</dc:creator>
		<pubDate>Thu, 07 Jul 2011 19:11:49 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=506#comment-30871</guid>
		<description>[...] to return? When the document is on the web, part of the answer to that question is provided by the PageRank algorithm, which analyses the link structure of the web to determine the importance of different webpages. [...]</description>
		<content:encoded><![CDATA[<p>[...] to return? When the document is on the web, part of the answer to that question is provided by the PageRank algorithm, which analyses the link structure of the web to determine the importance of different webpages. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Pregel &#124; DDI</title>
		<link>http://michaelnielsen.org/blog/lectures-on-the-google-technology-stack-1-introduction-to-pagerank/comment-page-1/#comment-30781</link>
		<dc:creator>Pregel &#124; DDI</dc:creator>
		<pubDate>Fri, 17 Jun 2011 19:31:29 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=506#comment-30781</guid>
		<description>[...] I won&#8217;t get into any more of the ins-and-outs of PageRank, but will assume that you&#8217;re happy enough with the description above. If you&#8217;re looking for more details, I&#8217;ve written an extended introduction. [...]</description>
		<content:encoded><![CDATA[<p>[...] I won&#8217;t get into any more of the ins-and-outs of PageRank, but will assume that you&#8217;re happy enough with the description above. If you&#8217;re looking for more details, I&#8217;ve written an extended introduction. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Three Minutes on PageRank &#171;</title>
		<link>http://michaelnielsen.org/blog/lectures-on-the-google-technology-stack-1-introduction-to-pagerank/comment-page-1/#comment-22262</link>
		<dc:creator>Three Minutes on PageRank &#171;</dc:creator>
		<pubDate>Wed, 13 May 2009 13:08:26 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=506#comment-22262</guid>
		<description>[...] bad for three minutes! PageRank a very complicated subject, as you can see from here, a college level course that spends a semester discussing it! Making sense out of PageRank in just [...]</description>
		<content:encoded><![CDATA[<p>[...] bad for three minutes! PageRank a very complicated subject, as you can see from here, a college level course that spends a semester discussing it! Making sense out of PageRank in just [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: argv</title>
		<link>http://michaelnielsen.org/blog/lectures-on-the-google-technology-stack-1-introduction-to-pagerank/comment-page-1/#comment-19120</link>
		<dc:creator>argv</dc:creator>
		<pubDate>Fri, 27 Mar 2009 02:08:31 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=506#comment-19120</guid>
		<description>@JohnS

The IP angle is interesting.

But consider another angle.

Anyone can crawl the web and create and index.  Even a cache.  But some questions begin to emerge:

- are they holding the IP (e.g. copyright) of others&#039; sites as URI&#039;s or even cahed pages?

- are they operating as middlemen, as gateways to others&#039; content, and letting advertisers intrude into the pathway between user and the content she intends to retrieve?

- will content owners agree to anyone crawling and indexing and even caching their content, or only to certain parties (e.g. Google, Yahoo, MSN, etc.)

- do we need middlemen?

- are &quot;browsers&quot; even necessary, if we are merely searching and selecting known content from an index?  consider a tool that can handle regex searches, a tool that can generate an index and a tool that can retrieve a file when given a URI

is the internet of today (cf. to that of say 1993) too big to &quot;browse&quot;?  compare the &quot;portal&quot; concept (e.g. Yahoo! etc.) of the early web versus today&#039;s point of entry: the Google search</description>
		<content:encoded><![CDATA[<p>@JohnS</p>
<p>The IP angle is interesting.</p>
<p>But consider another angle.</p>
<p>Anyone can crawl the web and create and index.  Even a cache.  But some questions begin to emerge:</p>
<p>- are they holding the IP (e.g. copyright) of others&#8217; sites as URI&#8217;s or even cahed pages?</p>
<p>- are they operating as middlemen, as gateways to others&#8217; content, and letting advertisers intrude into the pathway between user and the content she intends to retrieve?</p>
<p>- will content owners agree to anyone crawling and indexing and even caching their content, or only to certain parties (e.g. Google, Yahoo, MSN, etc.)</p>
<p>- do we need middlemen?</p>
<p>- are &#8220;browsers&#8221; even necessary, if we are merely searching and selecting known content from an index?  consider a tool that can handle regex searches, a tool that can generate an index and a tool that can retrieve a file when given a URI</p>
<p>is the internet of today (cf. to that of say 1993) too big to &#8220;browse&#8221;?  compare the &#8220;portal&#8221; concept (e.g. Yahoo! etc.) of the early web versus today&#8217;s point of entry: the Google search</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: links for 2008-12-24 &#171; Bloggitation</title>
		<link>http://michaelnielsen.org/blog/lectures-on-the-google-technology-stack-1-introduction-to-pagerank/comment-page-1/#comment-16557</link>
		<dc:creator>links for 2008-12-24 &#171; Bloggitation</dc:creator>
		<pubDate>Thu, 25 Dec 2008 07:02:09 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=506#comment-16557</guid>
		<description>[...] Lectures on the Google Technology Stack 1: Introduction to PageRank (tags: python programming web google seo) [...]</description>
		<content:encoded><![CDATA[<p>[...] Lectures on the Google Technology Stack 1: Introduction to PageRank (tags: python programming web google seo) [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Michael Nielsen &#187; Using your laptop to compute PageRank for millions of webpages</title>
		<link>http://michaelnielsen.org/blog/lectures-on-the-google-technology-stack-1-introduction-to-pagerank/comment-page-1/#comment-16508</link>
		<dc:creator>Michael Nielsen &#187; Using your laptop to compute PageRank for millions of webpages</dc:creator>
		<pubDate>Tue, 23 Dec 2008 18:13:33 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=506#comment-16508</guid>
		<description>[...] difficult to apply to the web as a whole, simply because the web contains so many webpages. While just a few lines of code can be used to implement PageRank on collections of a few thousand webpages, it&#8217;s trickier to [...]</description>
		<content:encoded><![CDATA[<p>[...] difficult to apply to the web as a whole, simply because the web contains so many webpages. While just a few lines of code can be used to implement PageRank on collections of a few thousand webpages, it&#8217;s trickier to [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Michael Nielsen &#187; The PageRank distribution for the web</title>
		<link>http://michaelnielsen.org/blog/lectures-on-the-google-technology-stack-1-introduction-to-pagerank/comment-page-1/#comment-16204</link>
		<dc:creator>Michael Nielsen &#187; The PageRank distribution for the web</dc:creator>
		<pubDate>Fri, 12 Dec 2008 21:54:37 +0000</pubDate>
		<guid isPermaLink="false">http://michaelnielsen.org/blog/?p=506#comment-16204</guid>
		<description>[...] PageRank for a webpage is a probability between 0 and 1. The general idea is that PageRank quantifies the importance of the page: the bigger the probability the more [...]</description>
		<content:encoded><![CDATA[<p>[...] PageRank for a webpage is a probability between 0 and 1. The general idea is that PageRank quantifies the importance of the page: the bigger the probability the more [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

