Make new friends, but keep the old: recommending people on social networking sites

ABSTRACT

This paper studies people recommendations designed to help users find known, offline contacts and discover new friends on social networking sites. We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3,000 users. We found all algorithms effective in expanding users' friend lists. Algorithms based on social network information were able to produce better-received recommendations and find more known contacts for users, while algorithms using similarity of user-created content were stronger in discovering new friends. We also collected qualitative feedback from our survey users and draw several meaningful design implications.

REFERENCES

• 1: Boyd, d. m.,&Ellison, N. B. 2007. Social network sites: Definition, history, and scholarship. Journal of Computer-Mediated Communication, 13(1), article 11.
• 2: Deerwester, S., Dumais, S., Furnas, G.W., Landauer, T.K., Harshman, R. 1990. Indexing by Latent Semantic Analysis. J. of Amer. Soc. Info. Sci. 41 (6): 391--407.
• 3: Joan DiMicco , David R. Millen , Werner Geyer , Casey Dugan , Beth Brownholtz , Michael Muller, Motivations for social networking at work, Proceedings of the ACM 2008 conference on Computer supported cooperative work, November 08-12, 2008, San Diego, CA, USA [doi>10.1145/1460563.1460674]
• 4: Kate Ehrlich , Ching-Yung Lin , Vicky Griffiths-Fisher, Searching for experts in the enterprise: combining text and social network analysis, Proceedings of the 2007 international ACM conference on Supporting group work, November 04-07, 2007, Sanibel Island, Florida, USA [doi>10.1145/1316624.1316642]
• 5: Werner Geyer , Casey Dugan , David R. Millen , Michael Muller , Jill Freyne, Recommending topics for self-descriptions in online user profiles, Proceedings of the 2008 ACM conference on Recommender systems, October 23-25, 2008, Lausanne, Switzerland [doi>10.1145/1454008.1454019]
• 6: Granovetter, M. 1973. Strength of weak ties. Amer. J. Sociology 78 (1973), 1360--1380.
• 7: Georg Groh , Christian Ehmig, Recommendations in taste related domains: collaborative filtering vs. social filtering, Proceedings of the 2007 international ACM conference on Supporting group work, November 04-07, 2007, Sanibel Island, Florida, USA [doi>10.1145/1316624.1316643]
• 8: Ido Guy , Michal Jacovi , Noga Meshulam , Inbal Ronen , Elad Shahar, Public vs. private: comparing public social network information with email, Proceedings of the ACM 2008 conference on Computer supported cooperative work, November 08-12, 2008, San Diego, CA, USA [doi>10.1145/1460563.1460627]
• 9: Ido Guy , Michal Jacovi , Elad Shahar , Noga Meshulam , Vladimir Soroka , Stephen Farrell, Harvesting with SONAR: the value of aggregating social network information, Proceeding of the twenty-sixth annual SIGCHI conference on Human factors in computing systems, April 05-10, 2008, Florence, Italy [doi>10.1145/1357054.1357212]
• 10: Jonathan L. Herlocker , Joseph A. Konstan , John Riedl, Explaining collaborative filtering recommendations, Proceedings of the 2000 ACM conference on Computer supported cooperative work, p.241-250, December 2000, Philadelphia, Pennsylvania, United States [doi>10.1145/358916.358995]
• 11: Hofmann, T. 1999. Probabilistic Latent Semantic Analysis. UAI'99.
• 12: David W. McDonald, Recommending collaboration with social networks: a comparative evaluation, Proceedings of the SIGCHI conference on Human factors in computing systems, April 05-10, 2003, Ft. Lauderdale, Florida, USA [doi>10.1145/642611.642714]
• 13: Raymond J. Mooney , Loriene Roy, Content-based book recommending using learning for text categorization, Proceedings of the fifth ACM conference on Digital libraries, p.195-204, June 02-07, 2000, San Antonio, Texas, United States [doi>10.1145/336597.336662]
• 14: Official Facebook Blog: http://blog.facebook.com/blog.php?post=15610312130.
• 15: Pazzani, M. J., Muramatsu, J.,&Billsus, D. 1996. Syskill webert: Identifying interesting web sites. AAAI/IAAI, Vol. 1, 54--61.
• 16: Porter, M.F. 1980. An algorithm for suffix stripping. Program, 14(3). 130--137.
• 17: Gerard Salton , Christopher Buckley, Term-weighting approaches in automatic text retrieval, Information Processing and Management: an International Journal, v.24 n.5, p.513-523, 1988 [doi>10.1016/0306-4573(88)90021-0]
• 18: Shilad Sen , Werner Geyer , Michael Muller , Marty Moore , Beth Brownholtz , Eric Wilcox , David R. Millen, FeedMe: a collaborative alert filtering system, Proceedings of the 2006 20th anniversary conference on Computer supported cooperative work, November 04-08, 2006, Banff, Alberta, Canada [doi>10.1145/1180875.1180890]
• 19: Ellen Spertus , Mehran Sahami , Orkut Buyukkokten, Evaluating similarity measures: a large-scale study in the orkut social network, Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, August 21-24, 2005, Chicago, Illinois, USA [doi>10.1145/1081870.1081956]
• 20: Swearingen, K. and Sinha, R. 2002. Interaction Design for Recommender Systems. Proc. DIS'02.
• 21: Loren Terveen , David W. McDonald, Social matching: A framework and research agenda, ACM Transactions on Computer-Human Interaction (TOCHI), v.12 n.3, p.401-434, September 2005 [doi>10.1145/1096737.1096740]

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.5 INFORMATION INTERFACES AND PRESENTATION (I.7)
      H.5.3 Group and Organization Interfaces

General Terms:
Experimentation

Keywords:
friend, recommender system, social networking