Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis

Graphs are widely used in large scale social network analysis nowadays. Not only analysts need to focus on cohesive subgraphs to study patterns among social actors, but also normal users are interested in discovering what happening in their neighborhood. However, effectively storing large scale social network and efficiently identifying cohesive subgraphs is challenging. In this work we introduce a novel subgraph concept to capture the cohesion in social interactions, and propose an I/O efficient approach to discover cohesive subgraphs. Besides, we propose an analytic system which allows users to perform intuitive, visual browsing on large scale social networks. Our system stores the network as a social graph in the graph database, retrieves a local cohesive subgraph based on the input keywords, and then hierarchically visualizes the subgraph out on orbital layout, in which more important social actors are located in the center. By summarizing textual interactions between social actors as tag cloud, we provide a way to quickly locate active social communities and their interactions in a unified view.

[1]  Jia Wang,et al.  Truss Decomposition in Massive Networks , 2012, Proc. VLDB Endow..

[2]  Alessandro Vespignani,et al.  K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases , 2005, Networks Heterog. Media.

[3]  Víctor M. Eguíluz,et al.  Social features of online networks: the strength of weak ties in online social media , 2011, ArXiv.

[4]  Lada A. Adamic,et al.  The role of social networks in information diffusion , 2012, WWW.

[5]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[6]  R. Luce,et al.  Connectivity and generalized cliques in sociometric group structure , 1950, Psychometrika.

[7]  Anthony K. H. Tung,et al.  CSV: visualizing and mining cohesive subgraphs , 2008, SIGMOD Conference.

[8]  R. Alba.  A graph‐theoretic definition of a sociometric clique† , 1973 .

[9]  Anthony K. H. Tung,et al.  On Triangulation-based Dense Neighborhood Graphs Discovery , 2010, Proc. VLDB Endow..

[10]  Jie Tang,et al.  ArnetMiner: extraction and mining of academic social networks , 2008, KDD.

[11]  Srinivasan Parthasarathy,et al.  Extracting Analyzing and Visualizing Triangle K-Core Motifs within Networks , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[12]  Marko A. Rodriguez,et al.  The Graph Traversal Pattern , 2010, Graph Data Management.

[13]  Sergiy Butenko,et al.  Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem , 2011, Oper. Res..

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

[15]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[16]  Eric Gilbert,et al.  Predicting tie strength with social media , 2009, CHI.

[17]  James Cheng,et al.  Efficient core decomposition in massive networks , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[18]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Stephen B. Seidman,et al.  A graph‐theoretic generalization of the clique concept* , 1978 .

[20]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[21]  Kwan-Liu Ma,et al.  Visual Reasoning about Social Networks Using Centrality Sensitivity , 2012, IEEE Transactions on Visualization and Computer Graphics.

[22]  Alessandro Vespignani,et al.  Large scale networks fingerprinting and visualization using the k-core decomposition , 2005, NIPS.

[23]  Ulrik Brandes,et al.  Journal of Graph Algorithms and Applications More Flexible Radial Layout , 2022 .

[24]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[25]  Graeme Hirst,et al.  Semantic distance in WordNet: An experimental, application-oriented evaluation of five measures , 2004 .

[26]  James Cheng,et al.  Triangle listing in massive networks and its applications , 2011, KDD.

[27]  R. Luce,et al.  A method of matrix analysis of group structure , 1949, Psychometrika.

[28]  Jure Leskovec,et al.  Empirical comparison of algorithms for network community detection , 2010, WWW '10.

[29]  F. Harary,et al.  The cohesiveness of blocks in social networks: Node connectivity and conditional density , 2001 .

[30]  Linton C. Freeman,et al.  Carnegie Mellon: Journal of Social Structure: Visualizing Social Networks Visualizing Social Networks , 2022 .

[31]  Gabriel Kliot,et al.  Streaming graph partitioning for large distributed graphs , 2012, KDD.