<?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 Probably Irrelevant</title>
	<atom:link href="http://probablyirrelevant.org/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://probablyirrelevant.org</link>
	<description>Information Retrieval Research and Development</description>
	<lastBuildDate>Thu, 30 Jun 2011 14:19:08 -0400</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on Informal SIGIR Test of Time Award by Ian</title>
		<link>http://probablyirrelevant.org/2011/06/informal-sigir-test-of-time-award/comment-page-1/#comment-16963</link>
		<dc:creator>Ian</dc:creator>
		<pubDate>Thu, 30 Jun 2011 14:19:08 +0000</pubDate>
		<guid isPermaLink="false">http://probablyirrelevant.org/?p=112#comment-16963</guid>
		<description>Ahhh, 2001 was such an... eventful SIGIR</description>
		<content:encoded><![CDATA[<p>Ahhh, 2001 was such an&#8230; eventful SIGIR</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on IR in IBM&#8217;s Watson: An interview with Nico Schlaefer by Le Zhao</title>
		<link>http://probablyirrelevant.org/2011/03/ir-in-ibms-watson-an-interview-with-nico-schlaefer/comment-page-1/#comment-14229</link>
		<dc:creator>Le Zhao</dc:creator>
		<pubDate>Sat, 19 Mar 2011 21:50:46 +0000</pubDate>
		<guid isPermaLink="false">http://probablyirrelevant.org/?p=100#comment-14229</guid>
		<description>Nice interview!  The technique looks more like expanding an answer string?  The use of topic modeling in assisting expansion looks interesting.</description>
		<content:encoded><![CDATA[<p>Nice interview!  The technique looks more like expanding an answer string?  The use of topic modeling in assisting expansion looks interesting.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Explicit negative feedback comes to the web&#8230;somewhat by miles</title>
		<link>http://probablyirrelevant.org/2011/02/explicit-negative-feedback-comes-to-the-web-somewhat/comment-page-1/#comment-13354</link>
		<dc:creator>miles</dc:creator>
		<pubDate>Wed, 16 Feb 2011 14:48:52 +0000</pubDate>
		<guid isPermaLink="false">http://probablyirrelevant.org/?p=91#comment-13354</guid>
		<description>Fernando, my original comment stemmed from a (possibly wrong) assumption.  But I think the assumption is plausible.  Namely, I assumed that the information implied by an explicit block is qualitatively different from the implications of a generic click:  The block is a strong statement of non-relevance, while a click entails a weak indication of relevance.

So this type of negative feedback is indeed subject to click spam just like positive click-based feedback.  But it seems to me that the spam detection methods should differ for negative feedback vs. positive feedback.  Negative feedback isn&#039;t an intractable problem, just a different one than that posed by positive clickthrough feedback.</description>
		<content:encoded><![CDATA[<p>Fernando, my original comment stemmed from a (possibly wrong) assumption.  But I think the assumption is plausible.  Namely, I assumed that the information implied by an explicit block is qualitatively different from the implications of a generic click:  The block is a strong statement of non-relevance, while a click entails a weak indication of relevance.</p>
<p>So this type of negative feedback is indeed subject to click spam just like positive click-based feedback.  But it seems to me that the spam detection methods should differ for negative feedback vs. positive feedback.  Negative feedback isn&#8217;t an intractable problem, just a different one than that posed by positive clickthrough feedback.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Explicit negative feedback comes to the web&#8230;somewhat by Jon</title>
		<link>http://probablyirrelevant.org/2011/02/explicit-negative-feedback-comes-to-the-web-somewhat/comment-page-1/#comment-13327</link>
		<dc:creator>Jon</dc:creator>
		<pubDate>Tue, 15 Feb 2011 18:32:27 +0000</pubDate>
		<guid isPermaLink="false">http://probablyirrelevant.org/?p=91#comment-13327</guid>
		<description>In this case, at least, Google can (probably) tie the negative feedback to an individual. Just like a lot of crowd-sourced tasks, identifying quality is mostly a matter of weeding out the bad workers, finding the over-zealous reasonably-high-quality super-users, and focusing on them.</description>
		<content:encoded><![CDATA[<p>In this case, at least, Google can (probably) tie the negative feedback to an individual. Just like a lot of crowd-sourced tasks, identifying quality is mostly a matter of weeding out the bad workers, finding the over-zealous reasonably-high-quality super-users, and focusing on them.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Explicit negative feedback comes to the web&#8230;somewhat by Fernando</title>
		<link>http://probablyirrelevant.org/2011/02/explicit-negative-feedback-comes-to-the-web-somewhat/comment-page-1/#comment-13322</link>
		<dc:creator>Fernando</dc:creator>
		<pubDate>Tue, 15 Feb 2011 14:24:28 +0000</pubDate>
		<guid isPermaLink="false">http://probablyirrelevant.org/?p=91#comment-13322</guid>
		<description>Miles, how is that different from handling click spam in general?</description>
		<content:encoded><![CDATA[<p>Miles, how is that different from handling click spam in general?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Explicit negative feedback comes to the web&#8230;somewhat by miles</title>
		<link>http://probablyirrelevant.org/2011/02/explicit-negative-feedback-comes-to-the-web-somewhat/comment-page-1/#comment-13320</link>
		<dc:creator>miles</dc:creator>
		<pubDate>Tue, 15 Feb 2011 14:04:04 +0000</pubDate>
		<guid isPermaLink="false">http://probablyirrelevant.org/?p=91#comment-13320</guid>
		<description>When I read about this, the first question that came to mind here is, how can we marshal negative feedback without risking gaming of the system?  i.e. Most black-hat approaches aim to raise a site in organic search.  Here we invite the opposite problem.  If I&#039;m a company with a direct competitor in my search space, a naive negative fb mechanism would allow me to &#039;bomb&#039; that competitor&#039;s results.

So clearly, any production-level use of these data will require a resourceful approach... a new sub-problem in the adversarial IR domain?</description>
		<content:encoded><![CDATA[<p>When I read about this, the first question that came to mind here is, how can we marshal negative feedback without risking gaming of the system?  i.e. Most black-hat approaches aim to raise a site in organic search.  Here we invite the opposite problem.  If I&#8217;m a company with a direct competitor in my search space, a naive negative fb mechanism would allow me to &#8216;bomb&#8217; that competitor&#8217;s results.</p>
<p>So clearly, any production-level use of these data will require a resourceful approach&#8230; a new sub-problem in the adversarial IR domain?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Explicit negative feedback comes to the web&#8230;somewhat by Jon</title>
		<link>http://probablyirrelevant.org/2011/02/explicit-negative-feedback-comes-to-the-web-somewhat/comment-page-1/#comment-13311</link>
		<dc:creator>Jon</dc:creator>
		<pubDate>Tue, 15 Feb 2011 01:47:51 +0000</pubDate>
		<guid isPermaLink="false">http://probablyirrelevant.org/?p=91#comment-13311</guid>
		<description>This is certainly a feature I appreciate, and I&#039;d be interested to see whether or not it plays into a larger plan of modeling true negative feedback. I&#039;d imagine for now they&#039;re just casting the net to see what kind of data they pull in. 

They do seem to be paying attention to Blekko&#039;s approach - this is the only Blekko feature I found personally compelling.</description>
		<content:encoded><![CDATA[<p>This is certainly a feature I appreciate, and I&#8217;d be interested to see whether or not it plays into a larger plan of modeling true negative feedback. I&#8217;d imagine for now they&#8217;re just casting the net to see what kind of data they pull in. </p>
<p>They do seem to be paying attention to Blekko&#8217;s approach &#8211; this is the only Blekko feature I found personally compelling.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Finding relevance judgements in the wild by Webhosting</title>
		<link>http://probablyirrelevant.org/2009/04/finding-relevance-judgements-in-the-wild/comment-page-1/#comment-10704</link>
		<dc:creator>Webhosting</dc:creator>
		<pubDate>Tue, 05 Oct 2010 11:19:27 +0000</pubDate>
		<guid isPermaLink="false">http://probablyirrelevant.org/?p=61#comment-10704</guid>
		<description>I am surprised that out of a large sample of 17k you only selected 48 threads that were relevant to your study. Each test could of course produce different results next time with different criteria. So further experiments may give different results.</description>
		<content:encoded><![CDATA[<p>I am surprised that out of a large sample of 17k you only selected 48 threads that were relevant to your study. Each test could of course produce different results next time with different criteria. So further experiments may give different results.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Query logs and information retrieval research by Lee S Jensen</title>
		<link>http://probablyirrelevant.org/2010/06/query-logs-and-information-retrieval-research/comment-page-1/#comment-9424</link>
		<dc:creator>Lee S Jensen</dc:creator>
		<pubDate>Tue, 22 Jun 2010 14:21:52 +0000</pubDate>
		<guid isPermaLink="false">http://probablyirrelevant.org/?p=76#comment-9424</guid>
		<description>AOL got in big trouble when it released its search log. This was because it violated privacy issues. However, with a vertical search system the logs don&#039;t generally have that concern. Being able to track the search path of person when they are only looking at genealogy (www.ancestry.com) or cameras (www.dpreview.com) doesn&#039;t really tell you anything valuable about a particular person. Focusing on getting search logs from these types of companies should be our focus.</description>
		<content:encoded><![CDATA[<p>AOL got in big trouble when it released its search log. This was because it violated privacy issues. However, with a vertical search system the logs don&#8217;t generally have that concern. Being able to track the search path of person when they are only looking at genealogy (www.ancestry.com) or cameras (www.dpreview.com) doesn&#8217;t really tell you anything valuable about a particular person. Focusing on getting search logs from these types of companies should be our focus.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Query logs and information retrieval research by neelannair</title>
		<link>http://probablyirrelevant.org/2010/06/query-logs-and-information-retrieval-research/comment-page-1/#comment-9217</link>
		<dc:creator>neelannair</dc:creator>
		<pubDate>Wed, 09 Jun 2010 14:57:38 +0000</pubDate>
		<guid isPermaLink="false">http://probablyirrelevant.org/?p=76#comment-9217</guid>
		<description>Valid points.

But I guess query logs are a huge investment for most search engines. It forms part of their competitive advantage over other search engines.

I&#039;d like to propose a time-out clause for search engine query logs. They could release query logs more than &#039;n&#039; years old for a license and fee. So Universities can give open access to researchers to work with them.

As far as the Lemur Project was concerned, I came to know about it in the news that it had been discontinued. There is such a thing as publicity, I guess. Wonder if they tied up with existing search engines or something to promote the cause.</description>
		<content:encoded><![CDATA[<p>Valid points.</p>
<p>But I guess query logs are a huge investment for most search engines. It forms part of their competitive advantage over other search engines.</p>
<p>I&#8217;d like to propose a time-out clause for search engine query logs. They could release query logs more than &#8216;n&#8217; years old for a license and fee. So Universities can give open access to researchers to work with them.</p>
<p>As far as the Lemur Project was concerned, I came to know about it in the news that it had been discontinued. There is such a thing as publicity, I guess. Wonder if they tied up with existing search engines or something to promote the cause.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

