Ties that matter

On-line social networks mostly allow individuals to extend friend requests to all forms of possible connections including those related to official purposes, interests, family relations, friendships, and acquaintances. One requires to mine relevant connections in order to make reliable and meaningful interpretations following network analysis. Most networks lack weight assignments that mark the strength of a connection. Thus there is a requirement of methods that can effectively identify essential edges from only the topological information available. The method discussed in this article identifies unique and high number of mutual connections through weighted self-information. The extracted skeleton network has highly reduced number of edges, still conserving the centrality distributions as far as possible. The method used is applied locally to each node, to extract connections relevant to every node. Results are demonstrated on five datasets which show that the proposed method is able to eliminate a large number of irrelevant edges. The method is also found to scale well to large datasets.

[1]  Christos Faloutsos,et al.  Center-piece subgraphs: problem definition and fast solutions , 2006, KDD '06.

[2]  Dorothea Wagner,et al.  Analysis and Visualization of Social Networks , 2003, Graph Drawing Software.

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

[4]  Václav Snásel,et al.  Social Network Reduction Based on Stability , 2010, 2010 International Conference on Computational Aspects of Social Networks.

[5]  Ulrik Brandes,et al.  Simmelian backbones: Amplifying hidden homophily in Facebook networks , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[6]  Jure Leskovec,et al.  Defining and Evaluating Network Communities Based on Ground-Truth , 2012, ICDM.

[7]  Yuval Shavitt,et al.  A model of Internet topology using k-shell decomposition , 2007, Proceedings of the National Academy of Sciences.

[8]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[9]  K-I Goh,et al.  Skeleton and fractal scaling in complex networks. , 2006, Physical review letters.

[10]  Jure Leskovec,et al.  Structure and Overlaps of Communities in Networks , 2012, KDD 2012.

[11]  Claude E. Shannon,et al.  The mathematical theory of communication , 1950 .

[12]  Ji Zhu,et al.  Skeleton of weighted social network , 2013 .

[13]  Marián Boguñá,et al.  Extracting the multiscale backbone of complex weighted networks , 2009, Proceedings of the National Academy of Sciences.