Jul 26
▼Suggesting Friends Using the Implicit Social Graph, Maayan Roth, Assaf Ben-David, David Deutscher, Guy Flysher, Ilan Horn, Ari Leichtberg, Naty Leiser, Yossi Matias, Ron Merom, Proc. of the 16th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2010.
http://research.google.com/pubs/archive/36371.pdf
Abstract
Although users of online communication tools rarely categorize their contacts into groups such as "family", "co-workers", or "jogging buddies", they nonetheless implicitly cluster contacts, by virtue of their interactions with them, forming implicit groups. In this paper, we describe the implicit social graph which is formed by users' interactions with contacts and groups of contacts, and which is distinct from explicit social graphs in which users explicitly add other individuals as their "friends". We introduce an interaction-based metric for estimating a user's affinity to his contacts and groups. We then describe a novel friend suggestion algorithm that uses a user's implicit social graph to generate a friend group, given a small seed set of contacts which the user has already labeled as friends. We show experimental results that demonstrate the importance of both implicit group relationships and interaction-based affinity ranking in suggesting friends. Finally, we discuss two applications of the Friend Suggest algorithm that have been released as Gmail Labs features.
http://resear
Ab
Although users of online communication tools rarely categorize their contacts into groups such as "family", "co-workers", or "jogging buddies", they nonetheless implicitly cluster contacts, by virtue of their interactions with them, forming implicit groups. In this paper, we describe the implicit social graph which is formed by users' interactions with contacts and groups of contacts, and which is distinct from explicit social graphs in which users explicitly add other individuals as their "friends". We introduce an interaction-based metric for estimating a user's affinity to his contacts and groups. We then describe a novel friend suggestion algorithm that uses a user's implicit social graph to generate a friend group, given a small seed set of contacts which the user has already labeled as friends. We show experimental results that demonstrate the importance of both implicit group relationships and interaction-based affinity ranking in suggesting friends. Finally, we discuss two applications of the Friend Suggest algorithm that have been released as Gmail Labs features.
26 people liked this - Abhishek Anand, Adewale Oshineye, Aleksey Tikhonov, Alexander Krassotkin, Amund Tveit and 21 others, Andriy Burkov, Brian Hendrickson, Bruno F., Christan Grant, Daniel Bos, Derek Gottfrid, Dmitry Namiot, DongWoo Lee, Dvir Reznik, Hüseyin Köktaş, Jake Levine, Jeff Dalton, Manjunath Sindagi, Matina Thomaidou, Michael Elliot, Nishant Vijayakumar, Rafael Almeida Batista, Rand Fitzpatrick, Rohit Khare, Violet Mae Lim and Wiredset On Google
Andriy Burkov - Very cool, especially the Labs feature. Thanks!Jul 26DeleteUndo deleteReport spamNot spam
Google Research has disabled comments on this post
Comment
Like