Algorithms for Data Retrieval from Online Social Network Graphs

In the last few years, data extraction from online social networks (OSNs) has become more automated. The aim of this study was to extract all friends from MySpace profiles in order to generate a friendship graph. The graph would be analysed to investigate and apply node vulnerability metrics. This research is an extension of our previous work which concentrated on the extraction of top friends but did not investigate the graph or node vulnerability. The graph was generated from the friendship links that were extracted and placed into a repository. From the graph structure and profiles’ personal details, vulnerability was calculated to find the most vulnerable node. Results were promising and provided interesting findings. Metric validation highlighted that the graph can be used to infer information that may not be present on the profile. The number of neighbours and the clustering coefficient were two main factors that affect the vulnerability of nodes.

[1]  Jian Pei,et al.  Preserving Privacy in Social Networks Against Neighborhood Attacks , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[2]  Sougata Mukherjea,et al.  On the structural properties of massive telecom call graphs: findings and implications , 2006, CIKM '06.

[3]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[4]  James Caverlee,et al.  A Large-Scale Study of MySpace: Observations and Implications for Online Social Networks , 2021, ICWSM.

[5]  Mick J. Ridley,et al.  Data retrieval from online social network profiles for social engineering applications , 2009, 2009 International Conference for Internet Technology and Secured Transactions, (ICITST).

[6]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[7]  Charles K. Nicholas,et al.  Topological analysis of an online social network for older adults , 2008, SSM '08.

[8]  George Danezis,et al.  Prying Data out of a Social Network , 2009, 2009 International Conference on Advances in Social Network Analysis and Mining.

[9]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[10]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[11]  Christos Faloutsos,et al.  Parallel crawling for online social networks , 2007, WWW '07.

[12]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[13]  John Scott.  What is social network analysis , 2010 .

[14]  Lise Getoor,et al.  Preserving the Privacy of Sensitive Relationships in Graph Data , 2007, PinKDD.

[15]  T. Grance,et al.  SP 800-122. Guide to Protecting the Confidentiality of Personally Identifiable Information (PII) , 2010 .

[16]  Shyhtsun Felix Wu,et al.  Crawling Online Social Graphs , 2010, 2010 12th International Asia-Pacific Web Conference.

[17]  Hsinchun Chen,et al.  The topology of dark networks , 2008, Commun. ACM.

[18]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994 .

[19]  Guanrong Chen,et al.  Complex networks: small-world, scale-free and beyond , 2003 .

[20]  Krishna P. Gummadi,et al.  Measurement and analysis of online social networks , 2007, IMC '07.

[21]  Vitaly Shmatikov,et al.  De-anonymizing Social Networks , 2009, 2009 30th IEEE Symposium on Security and Privacy.