<?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: Costs and Transparency in Ranking Systems</title>
	<atom:link href="http://wanderingstan.com/2007-03-12/costs_and_transparency_in_ranking_systems/feed" rel="self" type="application/rss+xml" />
	<link>http://wanderingstan.com/2007-03-12/costs_and_transparency_in_ranking_systems</link>
	<description>wanderings and wonderings of stan james</description>
	<pubDate>Tue, 16 Mar 2010 00:42:30 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.7.1</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Joe</title>
		<link>http://wanderingstan.com/2007-03-12/costs_and_transparency_in_ranking_systems/comment-page-1#comment-72</link>
		<dc:creator>Joe</dc:creator>
		<pubDate>Tue, 30 Nov 1999 00:00:00 +0000</pubDate>
		<guid isPermaLink="false">#comment-72</guid>
		<description>Only global ratings suffer from it. Subjective metrics are a lot more attack resistant - http://www.sigcomm.org/sigcomm2005/paper-CheFri.pdf</description>
		<content:encoded><![CDATA[<p>Only global ratings suffer from it. Subjective metrics are a lot more attack resistant - <a href="http://www.sigcomm.org/sigcomm2005/paper-CheFri.pdf" rel="nofollow">http://www.sigcomm.org/sigcomm2005/paper-CheFri.pdf</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: stan</title>
		<link>http://wanderingstan.com/2007-03-12/costs_and_transparency_in_ranking_systems/comment-page-1#comment-73</link>
		<dc:creator>stan</dc:creator>
		<pubDate>Tue, 30 Nov 1999 00:00:00 +0000</pubDate>
		<guid isPermaLink="false">#comment-73</guid>
		<description>Yes! The problem is when you want a global "objective" ranking system. When you want ratings with a known bias (e.g. the academy awards, your friend's delicious tags) then these problems go away.

I guess I should do a follow up post about how Lijit does search in a subjective way, thus avoiding the google problems.

Thanks for the paper reference, Joe...I'll read it tonight.</description>
		<content:encoded><![CDATA[<p>Yes! The problem is when you want a global &#8220;objective&#8221; ranking system. When you want ratings with a known bias (e.g. the academy awards, your friend&#8217;s delicious tags) then these problems go away.</p>
<p>I guess I should do a follow up post about how Lijit does search in a subjective way, thus avoiding the google problems.</p>
<p>Thanks for the paper reference, Joe&#8230;I&#8217;ll read it tonight.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
