WMR--A Graph-Based Algorithm for Friend Recommendation

Abstract

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