<?xml version='1.0' encoding='utf-8' ?>
<!--  If you are running a bot please visit this policy page outlining rules you must respect. http://www.livejournal.com/bots/  -->
<rss version='2.0' xmlns:lj='http://www.livejournal.org/rss/lj/1.0/' xmlns:media='http://search.yahoo.com/mrss/' xmlns:atom10='http://www.w3.org/2005/Atom'>
<channel>
  <title>Last Paragraph</title>
  <link>http://lastparagraph.livejournal.com/</link>
  <description>Last Paragraph - LiveJournal.com</description>
  <lastBuildDate>Sat, 07 Oct 2006 15:29:03 GMT</lastBuildDate>
  <generator>LiveJournal / LiveJournal.com</generator>
  <lj:journal>lastparagraph</lj:journal>
  <lj:journalid>10130717</lj:journalid>
  <lj:journaltype>personal</lj:journaltype>
  <atom10:link rel='hub' href='http://pubsubhubbub.appspot.com/' />
<item>
  <guid isPermaLink='true'>http://lastparagraph.livejournal.com/852.html</guid>
  <pubDate>Sat, 07 Oct 2006 15:29:03 GMT</pubDate>
  <title>Netflix Prize</title>
  <link>http://lastparagraph.livejournal.com/852.html</link>
  <description>Netflix, the DVD rent-through-the-mail service, is hosting a &lt;a href=&quot;http://www.netflixprize.com&quot;&gt;competition&lt;/a&gt; to improve their movie suggestion system, with a prize of .... $1,000,000 &amp;lt;/dr.evil&amp;gt;.&amp;nbsp; Netflix provides around 100,000,000 historical ratings from their customers (masked, of course), with which to build a scoring algorithm.&amp;nbsp; To claim the prize, the algorithm must predict another qualifying data set with an &lt;a href=&quot;http://en.wikipedia.org/wiki/Root_Mean_Squared_Error&quot;&gt;RMSE&lt;/a&gt; of less than 0.8563, which is a 10% improvement over Netflix&apos;s current RMSE of 0.9474.&lt;br /&gt;&lt;br /&gt;Last night, having downloaded and briefly looked at the data, I submitted a very simple solution, which at the time &lt;a href=&quot;http://www.netflixprize.com/leaderboard&quot;&gt;placed me 10th&lt;/a&gt; with a RMSE of 1.0004.&amp;nbsp; I know I can do much better than that, given sufficient time to investigate &amp;amp; build a better algorithm - of course I&apos;m sure others can too.&amp;nbsp; In the end, it&apos;s not really about the prize for me (though it would be nice), but rather the competition - seeing how well I can do relative to others.</description>
  <comments>http://lastparagraph.livejournal.com/852.html</comments>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
</channel>
</rss>
