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.