<?xml version="1.0" encoding="ISO-8859-1" ?><?xml-stylesheet type="text/xsl" href="results.xsl" ?><root>

<item>
  <title>Predicting the popularity of online content</title>
  <link>http://www.hpl.hp.com/research/scl/papers/predictions</link>
  <minidescription>popularity, youtube, digg, attention, predicting future downloads.</minidescription>
  <tags>
	<tag>attention</tag>
	<tag>youtube</tag>
	<tag>popularity</tag>
	<tag>social media</tag>
	<tag>prediction</tag>
	<tag>online content</tag>
  </tags>
  <description>
We present a method for accurately predicting the long time
popularity of online content from early measurements of
user access. Using two content sharing portals, Youtube
and Digg, we show that by modeling the accrual of views
and votes on content offered by these services we can
predict the long-term dynamics of individual submissions from
initial data. In the case of Digg, measuring access to given
stories during the first two hours allows us to forecast their
popularity 30 days ahead with remarkable accuracy, while
downloads of Youtube videos need to be followed for 10 days
to attain the same performance. The differing time scales
of the predictions are shown to be due to differences in how
content is consumed on the two portals: Digg stories quickly
become outdated, while Youtube videos are still found long
after they are initially submitted to the portal. We show
that predictions are more accurate for submissions for which
attention decays quickly, whereas predictions for evergreen
content will be prone to larger errors.


</description>
  <author>Gabor Szabo and Bernardo A. Huberman</author>
  <pubDate>2008-11-03 15:27:00</pubDate>
</item>


<item>
  <title>Social network collaborative filtering</title>
  <link>http://www.hpl.hp.com/research/scl/papers/sncf/</link>
  <minidescription>User-generated social networking links can be as predictive as algorithmically 
  identified "neighbors" in recommender systems.</minidescription>
  <tags>
	  <tag>collaborative filtering</tag>
	  <tag>social networks</tag>
	  <tag>prediction</tag>
	<tag>recommender systems</tag>
		<tag>essembly</tag>

  </tags> 
  <description>This paper demonstrates that "social network collaborative 
filtering" (SNCF), wherein user-selected like-minded alters are used to 
make predictions, can rival traditional user-to-user collaborative filtering (CF) 
in predictive accuracy. Using a unique data set from an online community 
where users rated items and also created social networking links specifically 
intended to represent like-minded allies, we use SNCF and traditional CF 
to predict ratings by networked users. We find that SNCF using generic "friend" 
alters is moderately worse than the better CF techniques, but outperforms 
benchmarks such as by-item or by-user average rating; generic friends often are not like-minded. 
However, SNCF using "ally" alters is competitive with CF. These results are significant 
because SNCF is tremendously more computationally efficient than traditional 
user-user CF and may be implemented in large-scale web commerce and social 
networking communities. It is notoriously difficult to distinguish the contributions 
of social influence (where allies influence users) and social selection 
(where users are simply effective at selecting like-minded people as their allies). 
Nonetheless, comparing similarity over time, we do show no evidence of strong 
social influence among allies or friends.
	</description>
	<author>Rong Zheng, Dennis M. Wilkinson and Foster Provost</author>
  <pubDate>2008-10-06 12:00:00</pubDate>
</item>
</root>