<?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: Become Talks On AIR</title>
	<atom:link href="http://battellemedia.com/archives/2005/03/become_talks_on_air.php/feed" rel="self" type="application/rss+xml" />
	<link>http://battellemedia.com/archives/2005/03/become_talks_on_air.php?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=become_talks_on_air</link>
	<description>Thoughts on the intersection of search, media, technology, and more.</description>
	<lastBuildDate>Wed, 19 Jun 2013 11:42:00 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.4.1</generator>
	<item>
		<title>By: Become A. Competitor</title>
		<link>http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21433</link>
		<dc:creator>Become A. Competitor</dc:creator>
		<pubDate>Tue, 15 Mar 2005 10:25:51 +0000</pubDate>
		<guid isPermaLink="false">http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21433</guid>
		<description>&lt;p&gt;&gt; after all, calling your new algorithm AIR, but not publishing it might just open one up to some jokes - but they do have the right to protect trade secrets, after all. &lt;/p&gt;

&lt;p&gt;Well, it ain&#039;t quite so, at least not all of it. Check out this page, courtesy of US PTO:&lt;/p&gt;

&lt;p&gt;&lt;a href=&quot;http://appft1.uspto.gov/netacgi/nph-Parser?d=PG01&amp;p=1&amp;u=%2Fnetahtml%2FPTO%2Fsrchnum.html&amp;r=1&amp;f=G&amp;l=50&amp;s1=%2220030208482%22.PGNR.&amp;OS=DN/20030208482&amp;RS=DN/20030208482&quot; rel=&quot;nofollow&quot;&gt;http://appft1.uspto.gov/netacgi/nph-Parser?d=PG01&amp;p=1&amp;u=%2Fnetahtml%2FPTO%2Fsrchnum.html&amp;r=1&amp;f=G&amp;l=50&amp;s1=%2220030208482%22.PGNR.&amp;OS=DN/20030208482&amp;RS=DN/20030208482&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;It has pretty detailed explanation of how the algorithm works. I&#039;ve known this link for a long time, but I just didn&#039;t bother to read through it, as I didn&#039;t believe mathematics itself could lead to much user experience improvement. Maybe some curious people can study it and let us know how &quot;superior&quot; it is?&lt;/p&gt;

&lt;p&gt;It&#039;s also kinda amusing to hear that these two guys were trying to hide something that&#039;s actually already public for a long time. Oh, did I hear somebody say ...&quot;ostrich&quot;?!&lt;br /&gt;
&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>> after all, calling your new algorithm AIR, but not publishing it might just open one up to some jokes &#8211; but they do have the right to protect trade secrets, after all. </p>
<p>Well, it ain&#8217;t quite so, at least not all of it. Check out this page, courtesy of US PTO:</p>
<p><a href="http://appft1.uspto.gov/netacgi/nph-Parser?d=PG01&#038;p=1&#038;u=%2Fnetahtml%2FPTO%2Fsrchnum.html&#038;r=1&#038;f=G&#038;l=50&#038;s1=%2220030208482%22.PGNR.&#038;OS=DN/20030208482&#038;RS=DN/20030208482" rel="nofollow">http://appft1.uspto.gov/netacgi/nph-Parser?d=PG01&#038;p=1&#038;u=%2Fnetahtml%2FPTO%2Fsrchnum.html&#038;r=1&#038;f=G&#038;l=50&#038;s1=%2220030208482%22.PGNR.&#038;OS=DN/20030208482&#038;RS=DN/20030208482</a></p>
<p>It has pretty detailed explanation of how the algorithm works. I&#8217;ve known this link for a long time, but I just didn&#8217;t bother to read through it, as I didn&#8217;t believe mathematics itself could lead to much user experience improvement. Maybe some curious people can study it and let us know how &#8220;superior&#8221; it is?</p>
<p>It&#8217;s also kinda amusing to hear that these two guys were trying to hide something that&#8217;s actually already public for a long time. Oh, did I hear somebody say &#8230;&#8221;ostrich&#8221;?!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: msobel</title>
		<link>http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21432</link>
		<dc:creator>msobel</dc:creator>
		<pubDate>Mon, 14 Mar 2005 21:30:32 +0000</pubDate>
		<guid isPermaLink="false">http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21432</guid>
		<description>&lt;p&gt;I tried it looking for a print server.  I got 10m responses but no way to search by price.  Either I don&#039;t understand or ...&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>I tried it looking for a print server.  I got 10m responses but no way to search by price.  Either I don&#8217;t understand or &#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ID:entity</title>
		<link>http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21431</link>
		<dc:creator>ID:entity</dc:creator>
		<pubDate>Mon, 14 Mar 2005 19:31:54 +0000</pubDate>
		<guid isPermaLink="false">http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21431</guid>
		<description>&lt;p&gt;Sounds very much like Authorities &amp; Hubs (Jon Kleinberg &#039;98, Authoritative Sources in a Hyperlinked Environment) - but the editors are in the process of selecting perhaps either the Hubs or enabling the crawler to backrub from useful authorities. &lt;/p&gt;

&lt;p&gt;So its a hybrid, where the context for the crawler is pre-determined, then the algo calculates the score in terms of relevance. &lt;/p&gt;

&lt;p&gt;Well maybe, could be wrong!!&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>Sounds very much like Authorities &#038; Hubs (Jon Kleinberg &#8217;98, Authoritative Sources in a Hyperlinked Environment) &#8211; but the editors are in the process of selecting perhaps either the Hubs or enabling the crawler to backrub from useful authorities. </p>
<p>So its a hybrid, where the context for the crawler is pre-determined, then the algo calculates the score in terms of relevance. </p>
<p>Well maybe, could be wrong!!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: James MacAonghus</title>
		<link>http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21430</link>
		<dc:creator>James MacAonghus</dc:creator>
		<pubDate>Mon, 14 Mar 2005 17:50:28 +0000</pubDate>
		<guid isPermaLink="false">http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21430</guid>
		<description>&lt;p&gt;I compared Become to Froogle and I wasn&#039;t all that impressed. Yes, it does an OK job, but not much more than that, and it has been touted as revolutionary. Certainly it does not do sufficiently better than Google to take up mindspace on that difficult-to-manage &quot;list of websites I simply must check when I buy something&quot;. See the write up at: &lt;a href=&quot;http://aqute.typepad.com/aquteresearch/2005/02/becomecom.html&quot; rel=&quot;nofollow&quot;&gt;http://aqute.typepad.com/aquteresearch/2005/02/becomecom.html&lt;/a&gt; .&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>I compared Become to Froogle and I wasn&#8217;t all that impressed. Yes, it does an OK job, but not much more than that, and it has been touted as revolutionary. Certainly it does not do sufficiently better than Google to take up mindspace on that difficult-to-manage &#8220;list of websites I simply must check when I buy something&#8221;. See the write up at: <a href="http://aqute.typepad.com/aquteresearch/2005/02/becomecom.html" rel="nofollow">http://aqute.typepad.com/aquteresearch/2005/02/becomecom.html</a> .</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jon K</title>
		<link>http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21429</link>
		<dc:creator>Jon K</dc:creator>
		<pubDate>Mon, 14 Mar 2005 17:50:09 +0000</pubDate>
		<guid isPermaLink="false">http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21429</guid>
		<description>&lt;p&gt;Dave, great blog I enjoy reading your insights.&lt;/p&gt;

&lt;p&gt;It sounds like quite a bit of calculating for each page (both intense human and computer review) how can it possibly scale with out extraordinary cost?&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>Dave, great blog I enjoy reading your insights.</p>
<p>It sounds like quite a bit of calculating for each page (both intense human and computer review) how can it possibly scale with out extraordinary cost?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: stan dushanbe</title>
		<link>http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21428</link>
		<dc:creator>stan dushanbe</dc:creator>
		<pubDate>Mon, 14 Mar 2005 12:31:34 +0000</pubDate>
		<guid isPermaLink="false">http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21428</guid>
		<description>&lt;p&gt;great post.&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>great post.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: stan rusbug</title>
		<link>http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21427</link>
		<dc:creator>stan rusbug</dc:creator>
		<pubDate>Mon, 14 Mar 2005 12:29:57 +0000</pubDate>
		<guid isPermaLink="false">http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21427</guid>
		<description>&lt;p&gt;great post. thanks.&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>great post. thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: David Spencer</title>
		<link>http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21426</link>
		<dc:creator>David Spencer</dc:creator>
		<pubDate>Mon, 14 Mar 2005 04:45:11 +0000</pubDate>
		<guid isPermaLink="false">http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21426</guid>
		<description>&lt;p&gt;Re the simple phrase: &quot;PageRank is published&quot;. This is true, but misleading, as it&#039;s just one factor in how Google scores pages - I think I read that there approx 200 factors in a pages score -other ones I&#039;ve heard of are that title matches score higher, along with words in bold or h1 or h2 tags.&lt;/p&gt;

&lt;p&gt;Great blog BTW.&lt;/p&gt;

&lt;p&gt;thx,&lt;br /&gt;
 Dave&lt;br /&gt;
&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>Re the simple phrase: &#8220;PageRank is published&#8221;. This is true, but misleading, as it&#8217;s just one factor in how Google scores pages &#8211; I think I read that there approx 200 factors in a pages score -other ones I&#8217;ve heard of are that title matches score higher, along with words in bold or h1 or h2 tags.</p>
<p>Great blog BTW.</p>
<p>thx,<br />
 Dave</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Brian</title>
		<link>http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21425</link>
		<dc:creator>Brian</dc:creator>
		<pubDate>Sun, 13 Mar 2005 22:26:54 +0000</pubDate>
		<guid isPermaLink="false">http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21425</guid>
		<description>&lt;p&gt;Before they take a swipe at the biggest search engine on the &#039;net they should probably brief themselves on everything that&#039;s happened since that  &lt;a href=&quot;http://scholar.google.com/scholar?hl=en&amp;lr=&amp;safe=off&amp;q=page+brin&amp;btnG=Search&quot; rel=&quot;nofollow&quot;&gt;famous paper&lt;/a&gt; of 1998 (that&#039;s 7 years ago now Yang and Yun). Suggesting that Google&#039;s ranking is strictly linear and based soley on inbould links is ridiculous. How do you suppose they were able to extrapolate the exact same search algorithm to to the Google Mini, Froogle, Google Scholar, Google Local, Google News, Gmail, Google Desktop Search, Google Groups, Google Print, Google Catalogs and anything I missed.&lt;/p&gt;

&lt;p&gt;Hint: They didn&#039;t.&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>Before they take a swipe at the biggest search engine on the &#8216;net they should probably brief themselves on everything that&#8217;s happened since that  <a href="http://scholar.google.com/scholar?hl=en&#038;lr=&#038;safe=off&#038;q=page+brin&#038;btnG=Search" rel="nofollow">famous paper</a> of 1998 (that&#8217;s 7 years ago now Yang and Yun). Suggesting that Google&#8217;s ranking is strictly linear and based soley on inbould links is ridiculous. How do you suppose they were able to extrapolate the exact same search algorithm to to the Google Mini, Froogle, Google Scholar, Google Local, Google News, Gmail, Google Desktop Search, Google Groups, Google Print, Google Catalogs and anything I missed.</p>
<p>Hint: They didn&#8217;t.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Hashim</title>
		<link>http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21424</link>
		<dc:creator>Hashim</dc:creator>
		<pubDate>Sun, 13 Mar 2005 20:39:59 +0000</pubDate>
		<guid isPermaLink="false">http://battellemedia.com/archives/2005/03/become_talks_on_air.php#comment-21424</guid>
		<description>&lt;p&gt;&quot;2) if it provides links to other valuable sites within a similar topic of interest (while minimizing links to off-topic sites)&quot;&lt;/p&gt;

&lt;p&gt;I had the same idea myself. &lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>&#8220;2) if it provides links to other valuable sites within a similar topic of interest (while minimizing links to off-topic sites)&#8221;</p>
<p>I had the same idea myself. </p>
]]></content:encoded>
	</item>
</channel>
</rss>
