<?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: IDEA #77 &#8211; Social Search Engine (take on Google)</title>
	<atom:link href="http://www.stevepoland.com/idea-77-social-search-engine-take-on-google/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.stevepoland.com/idea-77-social-search-engine-take-on-google/</link>
	<description>Serial entrepreneur and former early @TechCrunch Writer.</description>
	<lastBuildDate>Tue, 07 Feb 2012 03:10:00 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: Zmunz09</title>
		<link>http://www.stevepoland.com/idea-77-social-search-engine-take-on-google/comment-page-1/#comment-37925</link>
		<dc:creator>Zmunz09</dc:creator>
		<pubDate>Wed, 05 Oct 2011 18:28:00 +0000</pubDate>
		<guid isPermaLink="false">http://stevepoland.com/?p=295#comment-37925</guid>
		<description>Google +1</description>
		<content:encoded><![CDATA[<p>Google +1</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: alpha</title>
		<link>http://www.stevepoland.com/idea-77-social-search-engine-take-on-google/comment-page-1/#comment-1151</link>
		<dc:creator>alpha</dc:creator>
		<pubDate>Tue, 09 Oct 2007 20:45:27 +0000</pubDate>
		<guid isPermaLink="false">http://stevepoland.com/?p=295#comment-1151</guid>
		<description>I&#039;ve been thinking about how I read RSS feeds recently, and I think a social ranking of feeds would make it so much easier to find good content... I mean if feeds and posts are socially tagged and ranked and added...

Because I don&#039;t often search for content in blogs, I read them... it would be good if everyone else doing that helped out a little.</description>
		<content:encoded><![CDATA[<p>I&#8217;ve been thinking about how I read RSS feeds recently, and I think a social ranking of feeds would make it so much easier to find good content&#8230; I mean if feeds and posts are socially tagged and ranked and added&#8230;</p>
<p>Because I don&#8217;t often search for content in blogs, I read them&#8230; it would be good if everyone else doing that helped out a little.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jordan Mitchell</title>
		<link>http://www.stevepoland.com/idea-77-social-search-engine-take-on-google/comment-page-1/#comment-1152</link>
		<dc:creator>Jordan Mitchell</dc:creator>
		<pubDate>Tue, 25 Sep 2007 01:13:29 +0000</pubDate>
		<guid isPermaLink="false">http://stevepoland.com/?p=295#comment-1152</guid>
		<description>Hi Ivan, well I believe moving more into that direction is a good thing, but then again I doubt you&#039;d list technology/ranking as your biggest challenge right now. I think adoption (network effect) is the biggest challenge we all have. For us it is anyway!</description>
		<content:encoded><![CDATA[<p>Hi Ivan, well I believe moving more into that direction is a good thing, but then again I doubt you&#8217;d list technology/ranking as your biggest challenge right now. I think adoption (network effect) is the biggest challenge we all have. For us it is anyway!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ivan</title>
		<link>http://www.stevepoland.com/idea-77-social-search-engine-take-on-google/comment-page-1/#comment-1150</link>
		<dc:creator>Ivan</dc:creator>
		<pubDate>Fri, 21 Sep 2007 11:05:34 +0000</pubDate>
		<guid isPermaLink="false">http://stevepoland.com/?p=295#comment-1150</guid>
		<description>Jordan Mitchell: this is what yoorl.com is doing (in a way). The relevance of a site is determined implicitly, depending on how well that page spreads. Maybe moving more into that direction would be the right thing to do.
What do you think?</description>
		<content:encoded><![CDATA[<p>Jordan Mitchell: this is what yoorl.com is doing (in a way). The relevance of a site is determined implicitly, depending on how well that page spreads. Maybe moving more into that direction would be the right thing to do.<br />
What do you think?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jordan Mitchell</title>
		<link>http://www.stevepoland.com/idea-77-social-search-engine-take-on-google/comment-page-1/#comment-1149</link>
		<dc:creator>Jordan Mitchell</dc:creator>
		<pubDate>Thu, 20 Sep 2007 15:30:49 +0000</pubDate>
		<guid isPermaLink="false">http://stevepoland.com/?p=295#comment-1149</guid>
		<description>I&#039;m convinced that the next generation of search WILL be social search, but fully believe that the vote will be passive/implicit, not active/explicit.

There are already well-funded companies offering social search based on explicit votes -- either via a thumbs-up/down mechanism, bookmarking, manual ranking, etc. That&#039;s not working.

People don&#039;t want to build search results. But I think social search will work if they can vote passively. In essence, the users are the Web spiders and their behaviors form the indices.</description>
		<content:encoded><![CDATA[<p>I&#8217;m convinced that the next generation of search WILL be social search, but fully believe that the vote will be passive/implicit, not active/explicit.</p>
<p>There are already well-funded companies offering social search based on explicit votes &#8212; either via a thumbs-up/down mechanism, bookmarking, manual ranking, etc. That&#8217;s not working.</p>
<p>People don&#8217;t want to build search results. But I think social search will work if they can vote passively. In essence, the users are the Web spiders and their behaviors form the indices.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: alpha</title>
		<link>http://www.stevepoland.com/idea-77-social-search-engine-take-on-google/comment-page-1/#comment-1148</link>
		<dc:creator>alpha</dc:creator>
		<pubDate>Thu, 20 Sep 2007 04:13:25 +0000</pubDate>
		<guid isPermaLink="false">http://stevepoland.com/?p=295#comment-1148</guid>
		<description>You&#039;d need a strong algorithm to give the users the power to actually find good results. Or you wait for the users to supply results and grade them, but this is a social directory - not search.

Also, when I search I browse all the links I think are useful (tabbing them in firefox) when I&#039;ve finished scanning the search results I start looking through my tabbed results. So this is essentially providing Google with all the results I think are good.

There would be too many for me to find them if there wasn&#039;t already a strong algorithm.

But you could use a basic algorithm to toss the crap. And then a sort of monte carlo algorithm to provide &#039;random&#039; results to the user (random in order - because order is very important in search). Then weight the results as users provide click through... you could also give the click through a frame or similar to provide input for the result from the user, otherwise you would almost only be relying on click through rates... or users rating sites before they have seen them - based on snippet?

You&#039;d need a well seeded algorithm to allow new sites to perform as well as old well visited sites - but this could provide a vulnerability in the search algorithm that many sites would enjoy exposing.

Ok, I think it can be done.</description>
		<content:encoded><![CDATA[<p>You&#8217;d need a strong algorithm to give the users the power to actually find good results. Or you wait for the users to supply results and grade them, but this is a social directory &#8211; not search.</p>
<p>Also, when I search I browse all the links I think are useful (tabbing them in firefox) when I&#8217;ve finished scanning the search results I start looking through my tabbed results. So this is essentially providing Google with all the results I think are good.</p>
<p>There would be too many for me to find them if there wasn&#8217;t already a strong algorithm.</p>
<p>But you could use a basic algorithm to toss the crap. And then a sort of monte carlo algorithm to provide &#8216;random&#8217; results to the user (random in order &#8211; because order is very important in search). Then weight the results as users provide click through&#8230; you could also give the click through a frame or similar to provide input for the result from the user, otherwise you would almost only be relying on click through rates&#8230; or users rating sites before they have seen them &#8211; based on snippet?</p>
<p>You&#8217;d need a well seeded algorithm to allow new sites to perform as well as old well visited sites &#8211; but this could provide a vulnerability in the search algorithm that many sites would enjoy exposing.</p>
<p>Ok, I think it can be done.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ed Kohler</title>
		<link>http://www.stevepoland.com/idea-77-social-search-engine-take-on-google/comment-page-1/#comment-1147</link>
		<dc:creator>Ed Kohler</dc:creator>
		<pubDate>Thu, 20 Sep 2007 02:47:05 +0000</pubDate>
		<guid isPermaLink="false">http://stevepoland.com/?p=295#comment-1147</guid>
		<description>Social search engines sound like a good concept, but I&#039;m convinced that anything requiring work on the part of searchers is doomed from the start. Winning search is based on calculating the actions people are passively making unrelated to search such as link popularity, on-site factors, search behavior, etc.

But I&#039;d loved to be proven wrong. Anything that makes search better is a winner in my book.</description>
		<content:encoded><![CDATA[<p>Social search engines sound like a good concept, but I&#8217;m convinced that anything requiring work on the part of searchers is doomed from the start. Winning search is based on calculating the actions people are passively making unrelated to search such as link popularity, on-site factors, search behavior, etc.</p>
<p>But I&#8217;d loved to be proven wrong. Anything that makes search better is a winner in my book.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

