<?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: Music Recommender Systems</title>
	<atom:link href="http://www.fuchaoqun.com/2009/11/music-recommender-systems/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.fuchaoqun.com/2009/11/music-recommender-systems/?utm_source=rss&amp;utm_medium=rss&amp;utm_campaign=music-recommender-systems</link>
	<description></description>
	<lastBuildDate>Mon, 26 Jul 2010 00:44:40 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
	<item>
		<title>By: 超群.com</title>
		<link>http://www.fuchaoqun.com/2009/11/music-recommender-systems/comment-page-1/#comment-1454</link>
		<dc:creator>超群.com</dc:creator>
		<pubDate>Wed, 09 Dec 2009 11:07:34 +0000</pubDate>
		<guid isPermaLink="false">http://www.fuchaoqun.com/?p=262#comment-1454</guid>
		<description>@philoc 

我这边测试的情况做音乐推荐效果很好，运算量的话还行，不是特别大，google的SVD并行算法，目前还不得知。我觉得没有必要担心运算量的问题，加内存就好了。</description>
		<content:encoded><![CDATA[<p>@philoc </p>
<p>我这边测试的情况做音乐推荐效果很好，运算量的话还行，不是特别大，google的SVD并行算法，目前还不得知。我觉得没有必要担心运算量的问题，加内存就好了。</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: philoc</title>
		<link>http://www.fuchaoqun.com/2009/11/music-recommender-systems/comment-page-1/#comment-1453</link>
		<dc:creator>philoc</dc:creator>
		<pubDate>Wed, 09 Dec 2009 06:54:20 +0000</pubDate>
		<guid isPermaLink="false">http://www.fuchaoqun.com/?p=262#comment-1453</guid>
		<description>超群，你用过SVD效果如何？这个计算量应该挺大的吧，原来在google黑板报上看过他们搞出了SVD的并行算法，你有了解吗</description>
		<content:encoded><![CDATA[<p>超群，你用过SVD效果如何？这个计算量应该挺大的吧，原来在google黑板报上看过他们搞出了SVD的并行算法，你有了解吗</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: 超群.com</title>
		<link>http://www.fuchaoqun.com/2009/11/music-recommender-systems/comment-page-1/#comment-1428</link>
		<dc:creator>超群.com</dc:creator>
		<pubDate>Mon, 23 Nov 2009 09:34:50 +0000</pubDate>
		<guid isPermaLink="false">http://www.fuchaoqun.com/?p=262#comment-1428</guid>
		<description>@Forest 

我没有实验过那么多用户，如果数据实在太大，我觉得更好的方式是清洗的力度更大些。</description>
		<content:encoded><![CDATA[<p>@Forest </p>
<p>我没有实验过那么多用户，如果数据实在太大，我觉得更好的方式是清洗的力度更大些。</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Forest</title>
		<link>http://www.fuchaoqun.com/2009/11/music-recommender-systems/comment-page-1/#comment-1427</link>
		<dc:creator>Forest</dc:creator>
		<pubDate>Mon, 23 Nov 2009 06:22:29 +0000</pubDate>
		<guid isPermaLink="false">http://www.fuchaoqun.com/?p=262#comment-1427</guid>
		<description>不错，不知道SVD方法能处理多大规模的数据，例如用户量超过1千万可以吗？</description>
		<content:encoded><![CDATA[<p>不错，不知道SVD方法能处理多大规模的数据，例如用户量超过1千万可以吗？</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: 超群.com</title>
		<link>http://www.fuchaoqun.com/2009/11/music-recommender-systems/comment-page-1/#comment-1426</link>
		<dc:creator>超群.com</dc:creator>
		<pubDate>Mon, 23 Nov 2009 05:35:30 +0000</pubDate>
		<guid isPermaLink="false">http://www.fuchaoqun.com/?p=262#comment-1426</guid>
		<description>@Caiwangqin

主要是工程方面，学术上很多不足。</description>
		<content:encoded><![CDATA[<p>@Caiwangqin</p>
<p>主要是工程方面，学术上很多不足。</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Caiwangqin</title>
		<link>http://www.fuchaoqun.com/2009/11/music-recommender-systems/comment-page-1/#comment-1425</link>
		<dc:creator>Caiwangqin</dc:creator>
		<pubDate>Mon, 23 Nov 2009 04:26:20 +0000</pubDate>
		<guid isPermaLink="false">http://www.fuchaoqun.com/?p=262#comment-1425</guid>
		<description>讲的不错 :)</description>
		<content:encoded><![CDATA[<p>讲的不错 <img src='http://www.fuchaoqun.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
</channel>
</rss>
<!-- WP Super Cache is installed but broken. The path to wp-cache-phase1.php in wp-content/advanced-cache.php must be fixed! -->