<?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: Discovr: a flickr experiment gone wrong</title>
	<atom:link href="http://www.jorgebernal.info/photography/discovr-flickr-experiment-wrong/feed" rel="self" type="application/rss+xml" />
	<link>http://www.jorgebernal.info/photography/discovr-flickr-experiment-wrong</link>
	<description></description>
	<lastBuildDate>Tue, 16 Mar 2010 09:23:03 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=abc</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Raphink</title>
		<link>http://www.jorgebernal.info/photography/discovr-flickr-experiment-wrong/comment-page-1#comment-1625</link>
		<dc:creator>Raphink</dc:creator>
		<pubDate>Mon, 09 Nov 2009 10:09:51 +0000</pubDate>
		<guid isPermaLink="false">http://www.jorgebernal.info/?p=414#comment-1625</guid>
		<description>One way of limiting the number of users (although not sure it would actually make it faster) would be to go the last.fm way.

Last.fm makes a list of your &quot;neighbors&quot;, that is, the people who like the same of music you do. First find people who not only added one picture you added as a favorite, but actually several. Make a list of the people who have most in common with you, keep 10 to 20 of them, and find the images that most of them added as their favorite. You will get more relevance this way imo.</description>
		<content:encoded><![CDATA[<p>One way of limiting the number of users (although not sure it would actually make it faster) would be to go the last.fm way.</p>
<p>Last.fm makes a list of your &#8220;neighbors&#8221;, that is, the people who like the same of music you do. First find people who not only added one picture you added as a favorite, but actually several. Make a list of the people who have most in common with you, keep 10 to 20 of them, and find the images that most of them added as their favorite. You will get more relevance this way imo.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Arjen Lentz</title>
		<link>http://www.jorgebernal.info/photography/discovr-flickr-experiment-wrong/comment-page-1#comment-1624</link>
		<dc:creator>Arjen Lentz</dc:creator>
		<pubDate>Mon, 09 Nov 2009 00:06:28 +0000</pubDate>
		<guid isPermaLink="false">http://www.jorgebernal.info/?p=414#comment-1624</guid>
		<description>That&#039;s kinda like a friend-of-a-friend type problem, or at least it&#039;s a graph.
See http://openquery.com/graph

Emulating a graph is never going to be fast/pretty/scalable, that might be the prob.</description>
		<content:encoded><![CDATA[<p>That&#8217;s kinda like a friend-of-a-friend type problem, or at least it&#8217;s a graph.<br />
See <a href="http://openquery.com/graph" rel="nofollow">http://openquery.com/graph</a></p>
<p>Emulating a graph is never going to be fast/pretty/scalable, that might be the prob.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: GoLo</title>
		<link>http://www.jorgebernal.info/photography/discovr-flickr-experiment-wrong/comment-page-1#comment-1622</link>
		<dc:creator>GoLo</dc:creator>
		<pubDate>Sun, 08 Nov 2009 21:34:08 +0000</pubDate>
		<guid isPermaLink="false">http://www.jorgebernal.info/?p=414#comment-1622</guid>
		<description>1) The random choosing would show the most favorited more times, as they are linked to more people. They are more probable to be choosen XD.</description>
		<content:encoded><![CDATA[<p>1) The random choosing would show the most favorited more times, as they are linked to more people. They are more probable to be choosen XD.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jorge Bernal</title>
		<link>http://www.jorgebernal.info/photography/discovr-flickr-experiment-wrong/comment-page-1#comment-1621</link>
		<dc:creator>Jorge Bernal</dc:creator>
		<pubDate>Sun, 08 Nov 2009 20:56:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.jorgebernal.info/?p=414#comment-1621</guid>
		<description>1) could be nice. Switching from *most* favorited to *latest* favorited could be faster. I wonder if the results would be worthy

2) Already keeps caches. But they won&#039;t help most users, unless...

3) ...it keeps running for a while and mirrors flickr :) But that would take a huge database, and many users willing to wait 30 minutes to see some pics :(</description>
		<content:encoded><![CDATA[<p>1) could be nice. Switching from *most* favorited to *latest* favorited could be faster. I wonder if the results would be worthy</p>
<p>2) Already keeps caches. But they won&#8217;t help most users, unless&#8230;</p>
<p>3) &#8230;it keeps running for a while and mirrors flickr <img src='http://www.jorgebernal.info/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' />  But that would take a huge database, and many users willing to wait 30 minutes to see some pics <img src='http://www.jorgebernal.info/wp-includes/images/smilies/icon_sad.gif' alt=':(' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: GoLo</title>
		<link>http://www.jorgebernal.info/photography/discovr-flickr-experiment-wrong/comment-page-1#comment-1620</link>
		<dc:creator>GoLo</dc:creator>
		<pubDate>Sun, 08 Nov 2009 20:39:05 +0000</pubDate>
		<guid isPermaLink="false">http://www.jorgebernal.info/?p=414#comment-1620</guid>
		<description>Some ideas (Too lazy for a patch :P):
1) taking very few favourites / users randomly
2) saving meta-data on a temporal cache, first request will be always slow, but next will be fast.
3) Hey, you could download Flickr... Not so crazy, after all google downloaded the internet.</description>
		<content:encoded><![CDATA[<p>Some ideas (Too lazy for a patch <img src='http://www.jorgebernal.info/wp-includes/images/smilies/icon_razz.gif' alt=':P' class='wp-smiley' /> ):<br />
1) taking very few favourites / users randomly<br />
2) saving meta-data on a temporal cache, first request will be always slow, but next will be fast.<br />
3) Hey, you could download Flickr&#8230; Not so crazy, after all google downloaded the internet.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
