<?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: The Reshuffle Button</title>
	<atom:link href="http://battellemedia.com/archives/2004/02/the_reshuffle_button.php/feed" rel="self" type="application/rss+xml" />
	<link>http://battellemedia.com/archives/2004/02/the_reshuffle_button.php?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=the_reshuffle_button</link>
	<description>Thoughts on the intersection of search, media, technology, and more.</description>
	<lastBuildDate>Tue, 21 May 2013 16:33: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: Lorraine</title>
		<link>http://battellemedia.com/archives/2004/02/the_reshuffle_button.php#comment-24951</link>
		<dc:creator>Lorraine</dc:creator>
		<pubDate>Tue, 19 Feb 2008 13:48:42 +0000</pubDate>
		<guid isPermaLink="false">http://battellemedia.com/archives/2004/02/the_reshuffle_button.php#comment-24951</guid>
		<description>&lt;p&gt;I&#039;m currently trying to find a way to communicate your &quot;reshuffle&quot; function (it&#039;s a very similar algorithm, except you keep one result and reshuffle the rest accordingly). &lt;br /&gt;
Any suggestions for an - very small - icon? &lt;br /&gt;
It needs to displayed per result.&lt;br /&gt;
It&#039;s a real nail-bighter.&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>I&#8217;m currently trying to find a way to communicate your &#8220;reshuffle&#8221; function (it&#8217;s a very similar algorithm, except you keep one result and reshuffle the rest accordingly). <br />
Any suggestions for an &#8211; very small &#8211; icon? <br />
It needs to displayed per result.<br />
It&#8217;s a real nail-bighter.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kevin</title>
		<link>http://battellemedia.com/archives/2004/02/the_reshuffle_button.php#comment-24950</link>
		<dc:creator>Kevin</dc:creator>
		<pubDate>Wed, 18 Feb 2004 07:35:12 +0000</pubDate>
		<guid isPermaLink="false">http://battellemedia.com/archives/2004/02/the_reshuffle_button.php#comment-24950</guid>
		<description>&lt;p&gt;I think the benefit of knowing that 3,000,000 versus say 300 items matched your query is it gives you a sense of how useful it would be to refine your query.&lt;/p&gt;

&lt;p&gt;In practice, if you search for &quot;REM&quot; and find 43,000,000 results, it&#039;s an indication that maybe you should refine your search to &quot;REM music&quot;. On the other hand, if you search for &quot;Giraffe osteoporosis&quot; and get 34 results, you have a good idea that if the first 10 don&#039;t suit you, refinement probably won&#039;t help very much.&lt;/p&gt;

&lt;p&gt;Think of adding a second search term as a user-directed reshuffling.&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>I think the benefit of knowing that 3,000,000 versus say 300 items matched your query is it gives you a sense of how useful it would be to refine your query.</p>
<p>In practice, if you search for &#8220;REM&#8221; and find 43,000,000 results, it&#8217;s an indication that maybe you should refine your search to &#8220;REM music&#8221;. On the other hand, if you search for &#8220;Giraffe osteoporosis&#8221; and get 34 results, you have a good idea that if the first 10 don&#8217;t suit you, refinement probably won&#8217;t help very much.</p>
<p>Think of adding a second search term as a user-directed reshuffling.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>http://battellemedia.com/archives/2004/02/the_reshuffle_button.php#comment-24949</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Sun, 15 Feb 2004 14:25:53 +0000</pubDate>
		<guid isPermaLink="false">http://battellemedia.com/archives/2004/02/the_reshuffle_button.php#comment-24949</guid>
		<description>&lt;p&gt;At first thought I was thinking at Similar Pages at Google. But this functionnality is corrupt by the &quot;Portfolio&quot; or &quot;My clients&quot;&#039;s pages of sites where you can have a lot of links to very differents type of customers.&lt;/p&gt;

&lt;p&gt;I think you should look, and use for a while, www.Kartoo.com (one of the first engine to make clustering) and is new Kapitalyser who keep a history of your searches and learn about it. They should re-released a plain Html version soon.&lt;/p&gt;

&lt;p&gt;</description>
		<content:encoded><![CDATA[<p>At first thought I was thinking at Similar Pages at Google. But this functionnality is corrupt by the &#8220;Portfolio&#8221; or &#8220;My clients&#8221;&#8216;s pages of sites where you can have a lot of links to very differents type of customers.</p>
<p>I think you should look, and use for a while, <a href="http://www.Kartoo.com" rel="nofollow">http://www.Kartoo.com</a> (one of the first engine to make clustering) and is new Kapitalyser who keep a history of your searches and learn about it. They should re-released a plain Html version soon.</p></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John Battelle</title>
		<link>http://battellemedia.com/archives/2004/02/the_reshuffle_button.php#comment-24948</link>
		<dc:creator>John Battelle</dc:creator>
		<pubDate>Sun, 15 Feb 2004 05:53:14 +0000</pubDate>
		<guid isPermaLink="false">http://battellemedia.com/archives/2004/02/the_reshuffle_button.php#comment-24948</guid>
		<description>&lt;p&gt;Gary Price has wonderful comments on my initial post. If you read to the end, you&#039;ll learn a lot...&lt;/p&gt;

&lt;p&gt;(reposted here with his permission)&lt;/p&gt;

&lt;p&gt;ohn, a couple of comments about your post. I hope they are useful to you. If&lt;br /&gt;
you think it&#039;s worthy, feel free to repost on your site.&lt;/p&gt;

&lt;p&gt;cheers,&lt;br /&gt;
gary&lt;/p&gt;

&lt;p&gt;&lt;br /&gt;
----&lt;br /&gt;
---&lt;/p&gt;

&lt;p&gt;1) For most web search engine total number of hits are junk and mean very&lt;br /&gt;
little.First, they are far from accurate. Second, they also include duplicate&lt;br /&gt;
and near duplicates. Third, they also mean nothing because most search engines&lt;br /&gt;
will only show you about 1,000 results (if you would even look that far down&lt;br /&gt;
the list). In other words, they are really just a promotion tool to make the&lt;br /&gt;
use think their search is &quot;seeing it all.&quot;&lt;/p&gt;

&lt;p&gt;2) Don&#039;t forget that you&#039;re only seeing what the web crawler can find. I don&#039;t&lt;br /&gt;
need to tell you that a great deal of material is not on the open web. It might&lt;br /&gt;
be in a fee-based system or reside on the invisible or opaque webs. How much&lt;br /&gt;
time are people wasting searching the open web for something that doesn&#039;t exist&lt;br /&gt;
or isn&#039;t current?&lt;/p&gt;

&lt;p&gt;In many cases, the searcher can save time and aggravation by using a specialized&lt;br /&gt;
database that is focused on a specific topic. Instead of searching the massive&lt;br /&gt;
open web (feel free to take a guess at its size) but instead direct the user to&lt;br /&gt;
a speciality database (smaller in size) and then run the search on it. This is&lt;br /&gt;
another approach to increase the precision of your search and lower the recall.&lt;br /&gt;
Said another way, a bigger database doesn&#039;t always mean better results.&lt;/p&gt;

&lt;p&gt;In the library world these days a great deal of interest is in what was once&lt;br /&gt;
called &quot;federated search&quot; but has been renamed meta search. This is not the&lt;br /&gt;
same way the web world thinks of metasearch. These products will allow an&lt;br /&gt;
organization to build categories of search tools, for example &quot;Business&quot; or&lt;br /&gt;
&quot;International Relations&quot; or &quot;Biomechanical Engineering.&quot; Then, the search&lt;br /&gt;
technology will parse the query for each underlying database, run the search,&lt;br /&gt;
remove duplicates, and merge the results onto a results page that has also been&lt;br /&gt;
designed by the local organization. In other words, you can present the results&lt;br /&gt;
in a way that will best serve the user group.&lt;/p&gt;

&lt;p&gt;This paper (which uses the another term for the technology &quot;common user&lt;br /&gt;
interface&quot;) reviews a great deal of the technology:&lt;br /&gt;
&lt;a href=&quot;http://www.natlib.govt.nz/files/CUI_Report_Final.pdf&quot; rel=&quot;nofollow&quot;&gt;http://www.natlib.govt.nz/files/CUI_Report_Final.pdf&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;This technology will work with open web resources (Google), specialized and&lt;br /&gt;
Invisible Web databases (ResearchIndex), and proprietary info systems (what a&lt;br /&gt;
library or company might pay for (LexisNexis).  Because some of these products&lt;br /&gt;
are not dependent on any standard, advanced search features can be easily&lt;br /&gt;
mapped to the search interface.&lt;/p&gt;

&lt;p&gt;&lt;br /&gt;
3) A new user interface from Yahoo (http://search.yahoo.com) allows the user to&lt;br /&gt;
pick which tabs/databases will be visible on their Yahoo search page. Of&lt;br /&gt;
course, many people don&#039;t use the tabs.&lt;/p&gt;

&lt;p&gt;&lt;br /&gt;
4) I think something that is very interesting/exciting is Ask.Com&#039;s Smart Answer&lt;br /&gt;
technology. Where instead of just getting links it takes a stab at an answer&lt;br /&gt;
and places it at the top of the results page. This is not using the Jeeves old&lt;br /&gt;
idea of pre-supposing question/answer sets but rather by using NLP.&lt;/p&gt;

&lt;p&gt;For example:&lt;br /&gt;
What is the capital of Spain.&lt;br /&gt;
&lt;a href=&quot;http://web.ask.com/web?q=what+is+the+capital+of+spain&amp;o=0&amp;qsrc=0&quot; rel=&quot;nofollow&quot;&gt;http://web.ask.com/web?q=what+is+the+capital+of+spain&amp;o=0&amp;qsrc=0&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Who won the academy award for best actor in 1972.&lt;br /&gt;
&lt;a href=&quot;http://tinyurl.com/2x5en&quot; rel=&quot;nofollow&quot;&gt;http://tinyurl.com/2x5en&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;5) Suggesting better query terms? AltaVista has had Prisma for a couple of&lt;br /&gt;
years.&lt;br /&gt;
&lt;a href=&quot;http://www.altavista.com/web/results?q=battelle+media&amp;kgs=0&amp;kls=1&amp;avkw=aapt&quot; rel=&quot;nofollow&quot;&gt;http://www.altavista.com/web/results?q=battelle+media&amp;kgs=0&amp;kls=1&amp;avkw=aapt&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Teoma does a good job by using the names of &quot;user communities&quot; to help narrow&lt;br /&gt;
and focus.&lt;/p&gt;

&lt;p&gt;Gigablast just launched Giga Bits.&lt;br /&gt;
&lt;a href=&quot;http://www.gigablast.com/search?q=john+battelle+journalist&quot; rel=&quot;nofollow&quot;&gt;http://www.gigablast.com/search?q=john+battelle+journalist&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Also, Yahoo&#039;s SmartSort is very useful and works well at getting the user to&lt;br /&gt;
what he or she is looking for.&lt;br /&gt;
&lt;a href=&quot;http://shopping.yahoo.com/smartsort&quot; rel=&quot;nofollow&quot;&gt;http://shopping.yahoo.com/smartsort&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;br /&gt;
Reading:&lt;br /&gt;
This article by Silverstein and Henzinger of Google and a Stanford associate&lt;br /&gt;
discusses several problems that engines face getting the material into the&lt;br /&gt;
database in the first place.&lt;br /&gt;
&quot;Challenges in Web Search Engines&quot;&lt;br /&gt;
&lt;a href=&quot;http://www.acm.org/sigs/sigir/forum/F2002/henzinger.pdf&quot; rel=&quot;nofollow&quot;&gt;http://www.acm.org/sigs/sigir/forum/F2002/henzinger.pdf&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;This White Paper from Vivisimo is also interesing reading.&lt;br /&gt;
&quot;Needed: A More Selective Ignorance&quot;&lt;br /&gt;
&lt;a href=&quot;http://vivisimo.com/docs/overlook.pdf&quot; rel=&quot;nofollow&quot;&gt;http://vivisimo.com/docs/overlook.pdf&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;cheers,&lt;br /&gt;
gary&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>Gary Price has wonderful comments on my initial post. If you read to the end, you&#8217;ll learn a lot&#8230;</p>
<p>(reposted here with his permission)</p>
<p>ohn, a couple of comments about your post. I hope they are useful to you. If<br />
you think it&#8217;s worthy, feel free to repost on your site.</p>
<p>cheers,<br />
gary</p>
<p>
&#8212;-<br />
&#8212;</p>
<p>1) For most web search engine total number of hits are junk and mean very<br />
little.First, they are far from accurate. Second, they also include duplicate<br />
and near duplicates. Third, they also mean nothing because most search engines<br />
will only show you about 1,000 results (if you would even look that far down<br />
the list). In other words, they are really just a promotion tool to make the<br />
use think their search is &#8220;seeing it all.&#8221;</p>
<p>2) Don&#8217;t forget that you&#8217;re only seeing what the web crawler can find. I don&#8217;t<br />
need to tell you that a great deal of material is not on the open web. It might<br />
be in a fee-based system or reside on the invisible or opaque webs. How much<br />
time are people wasting searching the open web for something that doesn&#8217;t exist<br />
or isn&#8217;t current?</p>
<p>In many cases, the searcher can save time and aggravation by using a specialized<br />
database that is focused on a specific topic. Instead of searching the massive<br />
open web (feel free to take a guess at its size) but instead direct the user to<br />
a speciality database (smaller in size) and then run the search on it. This is<br />
another approach to increase the precision of your search and lower the recall.<br />
Said another way, a bigger database doesn&#8217;t always mean better results.</p>
<p>In the library world these days a great deal of interest is in what was once<br />
called &#8220;federated search&#8221; but has been renamed meta search. This is not the<br />
same way the web world thinks of metasearch. These products will allow an<br />
organization to build categories of search tools, for example &#8220;Business&#8221; or<br />
&#8220;International Relations&#8221; or &#8220;Biomechanical Engineering.&#8221; Then, the search<br />
technology will parse the query for each underlying database, run the search,<br />
remove duplicates, and merge the results onto a results page that has also been<br />
designed by the local organization. In other words, you can present the results<br />
in a way that will best serve the user group.</p>
<p>This paper (which uses the another term for the technology &#8220;common user<br />
interface&#8221;) reviews a great deal of the technology:<br />
<a href="http://www.natlib.govt.nz/files/CUI_Report_Final.pdf" rel="nofollow">http://www.natlib.govt.nz/files/CUI_Report_Final.pdf</a></p>
<p>This technology will work with open web resources (Google), specialized and<br />
Invisible Web databases (ResearchIndex), and proprietary info systems (what a<br />
library or company might pay for (LexisNexis).  Because some of these products<br />
are not dependent on any standard, advanced search features can be easily<br />
mapped to the search interface.</p>
<p>
3) A new user interface from Yahoo (<a href="http://search.yahoo.com" rel="nofollow">http://search.yahoo.com</a>) allows the user to<br />
pick which tabs/databases will be visible on their Yahoo search page. Of<br />
course, many people don&#8217;t use the tabs.</p>
<p>
4) I think something that is very interesting/exciting is Ask.Com&#8217;s Smart Answer<br />
technology. Where instead of just getting links it takes a stab at an answer<br />
and places it at the top of the results page. This is not using the Jeeves old<br />
idea of pre-supposing question/answer sets but rather by using NLP.</p>
<p>For example:<br />
What is the capital of Spain.<br />
<a href="http://web.ask.com/web?q=what+is+the+capital+of+spain&#038;o=0&#038;qsrc=0" rel="nofollow">http://web.ask.com/web?q=what+is+the+capital+of+spain&#038;o=0&#038;qsrc=0</a></p>
<p>Who won the academy award for best actor in 1972.<br />
<a href="http://tinyurl.com/2x5en" rel="nofollow">http://tinyurl.com/2x5en</a></p>
<p>5) Suggesting better query terms? AltaVista has had Prisma for a couple of<br />
years.<br />
<a href="http://www.altavista.com/web/results?q=battelle+media&#038;kgs=0&#038;kls=1&#038;avkw=aapt" rel="nofollow">http://www.altavista.com/web/results?q=battelle+media&#038;kgs=0&#038;kls=1&#038;avkw=aapt</a></p>
<p>Teoma does a good job by using the names of &#8220;user communities&#8221; to help narrow<br />
and focus.</p>
<p>Gigablast just launched Giga Bits.<br />
<a href="http://www.gigablast.com/search?q=john+battelle+journalist" rel="nofollow">http://www.gigablast.com/search?q=john+battelle+journalist</a></p>
<p>Also, Yahoo&#8217;s SmartSort is very useful and works well at getting the user to<br />
what he or she is looking for.<br />
<a href="http://shopping.yahoo.com/smartsort" rel="nofollow">http://shopping.yahoo.com/smartsort</a></p>
<p>
Reading:<br />
This article by Silverstein and Henzinger of Google and a Stanford associate<br />
discusses several problems that engines face getting the material into the<br />
database in the first place.<br />
&#8220;Challenges in Web Search Engines&#8221;<br />
<a href="http://www.acm.org/sigs/sigir/forum/F2002/henzinger.pdf" rel="nofollow">http://www.acm.org/sigs/sigir/forum/F2002/henzinger.pdf</a></p>
<p>This White Paper from Vivisimo is also interesing reading.<br />
&#8220;Needed: A More Selective Ignorance&#8221;<br />
<a href="http://vivisimo.com/docs/overlook.pdf" rel="nofollow">http://vivisimo.com/docs/overlook.pdf</a></p>
<p>cheers,<br />
gary</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ross Stapleton-Gray</title>
		<link>http://battellemedia.com/archives/2004/02/the_reshuffle_button.php#comment-24947</link>
		<dc:creator>Ross Stapleton-Gray</dc:creator>
		<pubDate>Sun, 15 Feb 2004 04:03:22 +0000</pubDate>
		<guid isPermaLink="false">http://battellemedia.com/archives/2004/02/the_reshuffle_button.php#comment-24947</guid>
		<description>&lt;p&gt;&gt; While I&#039;m ranting, I&#039;d like the engine to suggest better query terms for me. It can&#039;t be that hard to store user queries and cluster those which have similar constructions, query words, or results/paths taken.&lt;/p&gt;

&lt;p&gt;&quot;You have chosen &#039;fiscal responsibility.&#039;  More Americans have chosen &#039;war on terrorism.&#039;  Use that to reform your query? (Y/N/Escape to Canada)&quot;&lt;br /&gt;
&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>> While I&#8217;m ranting, I&#8217;d like the engine to suggest better query terms for me. It can&#8217;t be that hard to store user queries and cluster those which have similar constructions, query words, or results/paths taken.</p>
<p>&#8220;You have chosen &#8216;fiscal responsibility.&#8217;  More Americans have chosen &#8216;war on terrorism.&#8217;  Use that to reform your query? (Y/N/Escape to Canada)&#8221;</p>
]]></content:encoded>
	</item>
</channel>
</rss>
