LaFT-tree: perceiving the expansion trace of one's circle of friends in online social networks

Many patterns have been discovered to explain and analyze how people make friends. Among them is the triadic closure, supported by the principle of the transitivity of friendship, which means for an individual the friends of her friend are more likely to become her new friends. However, people's motivations under this principle haven't been well studied, and it's still unknown that how this principle works in diverse situations. In this paper, we try to study this principle deeply based on the behavior modeling. We study how one expands her egocentric network via her friends, also called intermediaries, based on the transitivity of friendship. We propose LaFT-Tree, a tree-based representation of friendship formation inspired from triadic closure. LaFT-Tree provides a hierarchical view of the flat structure of one's egocentric network by visualizing the expansion trace of one's egocentric network. We model people's friend-making behaviors using LaFT-LDA, a generative model for LaFT-Tree learning. The proposed model is evaluated on both synthetic and real-world social networks and experimental results demonstrate the effectiveness of LaFT-LDA for LaFT-Tree inference. We also present some interesting applications of the LaFT-Tree, showing that our model can be generalized and benefit other social network analysis tasks.

[1]  Shyhtsun Felix Wu,et al.  The Evolution of Ego-Centric Triads: A Microscopic Approach toward Predicting Macroscopic Network Properties , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.

[2]  Michael I. Jordan,et al.  Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..

[3]  G. Simmel The sociology of Georg Simmel , 1950 .

[4]  Ravi Kumar,et al.  Structure and evolution of online social networks , 2006, KDD '06.

[5]  Scott A. Golder,et al.  Structural Predictors of Tie Formation in Twitter: Transitivity and Mutuality , 2010, 2010 IEEE Second International Conference on Social Computing.

[6]  Jure Leskovec,et al.  Microscopic evolution of social networks , 2008, KDD.

[7]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[8]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[9]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[10]  Mark S. Granovetter The Strength of Weak Ties , 1973, American Journal of Sociology.

[11]  Aristides Gionis,et al.  Mining Graph Evolution Rules , 2009, ECML/PKDD.

[12]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

[13]  Jon M. Kleinberg,et al.  The Directed Closure Process in Hybrid Social-Information Networks, with an Analysis of Link Formation on Twitter , 2010, ICWSM.

[14]  Munmun De Choudhury,et al.  Tie Formation on Twitter: Homophily and Structure of Egocentric Networks , 2011, SocialCom/PASSAT.

[15]  David Krackhardt,et al.  Heider vs Simmel: Emergent Features in Dynamic Structures , 2006, SNA@ICML.

[16]  A. Rapoport Spread of information through a population with socio-structural bias: I. Assumption of transitivity , 1953 .

[17]  Daniel M. Romero,et al.  Who Should I Follow? Recommending People in Directed Social Networks , 2011, ICWSM.

[18]  M. Newman Clustering and preferential attachment in growing networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Xiao Fan Wang,et al.  How people make friends in social networking sites - A microscopic perspective , 2011, ArXiv.

[20]  David Lo,et al.  Mining interesting link formation rules in social networks , 2010, CIKM.

[21]  Ee-Peng Lim,et al.  Do You Trust to Get Trust? A Study of Trust Reciprocity Behaviors and Reciprocal Trust Prediction , 2010, SDM.

[22]  Umeshwar Dayal,et al.  PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth , 2001, ICDE 2001.

[23]  Eli Upfal,et al.  Stochastic models for the Web graph , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[24]  Brian D. Davison,et al.  Structural link analysis and prediction in microblogs , 2011, CIKM '11.

[25]  Jie Tang,et al.  Who will follow you back?: reciprocal relationship prediction , 2011, CIKM '11.