【24h】

Make new friends, but keep the old

机译:结交新朋友,但保留旧朋友

获取原文
获取原文并翻译 | 示例

摘要

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.
机译:本文研究了人们的建议,旨在帮助用户找到已知的脱机联系人并在社交网站上发现新朋友。我们使用500位用户的个性化调查和3,000位用户的现场研究,评估了企业社交网站中的四种推荐算法。我们发现所有算法都可以有效地扩展用户的好友列表。基于社交网络信息的算法能够产生更好的推荐并为用户找到更多的已知联系人,而使用用户创建内容的相似性的算法在发现新朋友方面则更强大。我们还从调查用户那里收集了定性反馈,并得出了一些有意义的设计含义。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号