Social Network Integration: Towards Constructing the Social Graph

In this work, we formulate the problem of social network integration. It takes multiple observed social networks as input and returns an integrated global social graph where each node corresponds to a real person. The key challenge for social network integration is to discover the correspondences or interlinks across different social networks. We engaged an in-depth analysis across three online social networks, AMiner, Linkedin, and Videolectures in order to address what reveals users' social identity, whether the social factors consistent across different social networks and how we can leverage these information to perform integration. We proposed a unified framework for the social network integration task. It crawls data from multiple social networks and further discovers accounts correspond to the same real person from the obtained networks. We use a probabilistic model to determine such correspondence, it incorporates features like the consistency of social status and social ties across different, as well as one-to-one mapping constraint and logical transitivity to jointly make the prediction. Empirical experiments verify the effectiveness of our method.

[1]  Philip S. Yu,et al.  Inferring anchor links across multiple heterogeneous social networks , 2013, CIKM.

[2]  Reza Zafarani,et al.  Connecting users across social media sites: a behavioral-modeling approach , 2013, KDD.

[3]  Jon M. Kleinberg,et al.  Subgraph frequencies: mapping the empirical and extremal geography of large graph collections , 2013, WWW.

[4]  Fan Zhang,et al.  What's in a name?: an unsupervised approach to link users across communities , 2013, WSDM.

[5]  Prithviraj Sen,et al.  Collective context-aware topic models for entity disambiguation , 2012, WWW.

[6]  Jie Tang,et al.  Learning to Infer Social Ties in Large Networks , 2011, ECML/PKDD.

[7]  Rajeev Rastogi,et al.  Entity disambiguation with hierarchical topic models , 2011, KDD.

[8]  Peter Fankhauser,et al.  Identifying Users Across Social Tagging Systems , 2011, ICWSM.

[9]  Jure Leskovec,et al.  Supervised random walks: predicting and recommending links in social networks , 2010, WSDM '11.

[10]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.

[11]  Ziqi Zhang,et al.  Semantic Relatedness Approach for Named Entity Disambiguation , 2010, IRCDL.

[12]  Ying Wang,et al.  Message-Passing Algorithms for Sparse Network Alignment , 2009, TKDD.

[13]  Reza Zafarani,et al.  Connecting Corresponding Identities across Communities , 2009, ICWSM.

[14]  Gunnar W. Klau,et al.  A new graph-based method for pairwise global network alignment , 2009, BMC Bioinformatics.

[15]  Yuzhong Qu,et al.  Matching large ontologies: A divide-and-conquer approach , 2008, Data Knowl. Eng..

[16]  Bonnie Berger,et al.  Global alignment of multiple protein interaction networks with application to functional orthology detection , 2008, Proceedings of the National Academy of Sciences.

[17]  Silviu Cucerzan,et al.  Large-Scale Named Entity Disambiguation Based on Wikipedia Data , 2007, EMNLP.

[18]  Cynthia Dwork,et al.  Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography , 2007, WWW '07.

[19]  Bonnie Berger,et al.  Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology , 2007, RECOMB.

[20]  Ismailcem Budak Arpinar,et al.  Ontology-Driven Automatic Entity Disambiguation in Unstructured Text , 2006, SEMWEB.

[21]  Razvan C. Bunescu,et al.  Using Encyclopedic Knowledge for Named entity Disambiguation , 2006, EACL.

[22]  Edith Cohen,et al.  Optimal oblivious routing in polynomial time , 2003, STOC '03.

[23]  Andrew McCallum,et al.  Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data , 2001, ICML.

[24]  H. L’etang FRANCIS SCOTT KEY FITZGERALD , 1968 .

[25]  David D. Jensen,et al.  Anonymizing Social Networks , 2007 .