On the network you keep: analyzing persons of interest using Cliqster

We consider the problem of determining the structural differences between different types of social networks and using these differences for applications concerning prediction of their structures. Much research on this problem has been conducted in the context of social media such as Facebook and Twitter, within which one would like to characterize and classify different types of individuals such as leaders, followers, and influencers. However, we consider the problem in the context of information gathered from law-enforcement agencies, financial institutions, and similar organizations, within which one would like to characterize and classify different types of persons of interest. The members of these networks tend to form special communities and thus new techniques are required. We propose a new generative model called Cliqster, for unweighted networks, and we describe an interpretable, and efficient algorithm for representing networks within this model. Our representation preserves the important underlying characteristics of the network and is both concise and discriminative. We demonstrate the discriminative power of our method by comparing to a traditional SVD method as well as a state-of-the-art Graphlet algorithm. Our results are general in that they can be applied to "person of interest" networks as well as traditional social media networks.

[1]  Béla Bollobás,et al.  Random Graphs , 1985 .

[2]  Ben Shneiderman,et al.  D-Dupe: An Interactive Tool for Entity Resolution in Social Networks , 2006, Graph Drawing.

[3]  Graham Cormode,et al.  Node Classification in Social Networks , 2011, Social Network Data Analytics.

[4]  Philip S. Yu,et al.  Inferring social roles and statuses in social networks , 2013, KDD.

[5]  Jure Leskovec,et al.  Multiplicative Attribute Graph Model of Real-World Networks , 2010, Internet Math..

[6]  Gábor Csárdi,et al.  The igraph software package for complex network research , 2006 .

[7]  Colin S Gillespie,et al.  Fitting Heavy Tailed Distributions: The poweRlaw Package , 2014, 1407.3492.

[8]  Shou-De Lin,et al.  What distinguish one from its peers in social networks? , 2013, Data Mining and Knowledge Discovery.

[9]  Garry Robins,et al.  An introduction to exponential random graph (p*) models for social networks , 2007, Soc. Networks.

[10]  Panos M. Pardalos,et al.  Solving maximum clique in sparse graphs: an $$O(nm+n2^{d/4})$$O(nm+n2d/4) algorithm for $$d$$d-degenerate graphs , 2014, Optim. Lett..

[11]  Edoardo M. Airoldi,et al.  A Survey of Statistical Network Models , 2009, Found. Trends Mach. Learn..

[12]  David Eppstein,et al.  Listing All Maximal Cliques in Large Sparse Real-World Graphs , 2011, JEAL.

[13]  Gergo Barta A Link-based Approach to Entity Resolution in Social Networks , 2014, CSE 2014.

[14]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[15]  Yujiu Yang,et al.  Node Classification in Social Network via a Factor Graph Model , 2013, PAKDD.

[16]  Edoardo M. Airoldi,et al.  Graphlet decomposition of a weighted network , 2012, AISTATS.

[17]  C. Lawson,et al.  Solving least squares problems , 1976, Classics in applied mathematics.

[18]  Charles L. Lawson,et al.  Solving least squares problems , 1976, Classics in applied mathematics.

[19]  T. Snijders,et al.  Estimation and Prediction for Stochastic Blockstructures , 2001 .

[20]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[21]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[22]  Jing Gao,et al.  Learning, Analyzing and Predicting Object Roles on Dynamic Networks , 2013, 2013 IEEE 13th International Conference on Data Mining.

[23]  Yves Zenou,et al.  The strength of weak ties in crime , 2008 .

[24]  Edoardo M. Airoldi,et al.  Mixed Membership Stochastic Blockmodels , 2007, NIPS.

[25]  Ryan A. Rossi,et al.  Role Discovery in Networks , 2014, IEEE Transactions on Knowledge and Data Engineering.

[26]  Mark E. J. Newman,et al.  Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Edoardo M. Airoldi,et al.  Bayesian mixed-membership models of complex and evolving networks , 2006 .

[28]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[29]  Yizhou Sun,et al.  RAIN: Social Role-Aware Information Diffusion , 2015, AAAI.

[30]  E. Glaeser,et al.  Crime and Social Interactions , 1995 .

[31]  Peter D. Hoff,et al.  Multiplicative latent factor models for description and prediction of social networks , 2009, Comput. Math. Organ. Theory.

[32]  Lise Getoor,et al.  Subgraph pattern matching over uncertain graphs with identity linkage uncertainty , 2014, 2014 IEEE 30th International Conference on Data Engineering.

[33]  D. R. Lick,et al.  k-Degenerate Graphs , 1970, Canadian Journal of Mathematics.