loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI'06)
WMR--A Graph-Based Algorithm for Friend Recommendation
Hong Kong, China
December 18-December 22
ISBN: 0-7695-2747-7
Shuchuan Lo, National Taipei University of Technology, Taiwan
Chingching Lin, National Taipei University of Technology, Taiwan
More and more people make friends on the Internet. Most of the community websites generate the friend recommendation lists by search engine. Search engine is not an efficient mechanism because the database is too huge that search engine produces many unnecessary and unordered friend lists. However, there is little research discussing the issue of the recommendation quality of friend on the Internet. In this study, we propose a new recommendation algorithm named weighted minimum-message ratio (WMR) which generates a limited, ordered and personalized friend lists by the real message interaction number among web members. We chose 30 potential members from a community website as our experimental cases in this study. The result shows that the best recommended friend number for a target member is 15 and the precision and recall are 15% and 8% for testing prediction, respectively. This result is acceptable compared with book recommendation in which the testing precision and recall are 3% and 14%, respectively.
Citation:
Shuchuan Lo, Chingching Lin, "WMR--A Graph-Based Algorithm for Friend Recommendation," wi, pp.121-128, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.