Conference Paper

Algorithms for Data Retrieval from Online Social Network Graphs.

Dept. of Comput., Univ. of Bradford, Bradford, UK
DOI: 10.1109/CIT.2010.293 In proceeding of: 10th IEEE International Conference on Computer and Information Technology, CIT 2010, Bradford, West Yorkshire, UK, June 29-July 1, 2010
Source: DBLP

ABSTRACT 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 Bookmark
 · 
103 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Nowadays, we witness a flood of continuously changing information from a variety of web sources. New challenges to track information changes in real time require new methods in web information retrieval using Multi Agents System (MAS) technology. This research continues previous work on extracting data from Online Social Networks (OSNs) by using an agent in each user profile to monitor its updates, which are sent to a controller agent that saves a history of each user‟s activity in a local repository, as well as applying a vulnerability measure to users‟ profiles. An algorithm making use of MAS within the Online Social Network Retrieval System (OSNRS) is proposed. Our experiments on data extraction show that using MAS simplifies the process of tracking profile‟s history and opens the opportunity of understanding the dynamic behavior of OSN users especially when it is combined with text mining. The application of the vulnerability measure over time highlighted that in the case of this experiment the structure of the node‟s network, rather than the contents of the node, changed over time. The validation of the vulnerability measure showed that friends of a profile, that disclose
    International journal of knowledge and web intelligence. 06/2012; 3(3):p256-286.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Online social network (OSN) usage has led to personal details being presented on online profiles readily. This can cause profile owners to be vulnerable to social engineering attacks. Our approach to quantifying vulnerability consists of a model with three components: individual, relative and absolute vulnerabilities. The individual vulnerability is calculated by allocating weights to profile attribute values disclosed which may contribute towards the personal vulnerability of the profile owner. The relative vulnerability is the collective vulnerability of the profiles' friends. The absolute vulnerability is the overall vulnerability for the profile which considers the individual and relative vulnerabilities. This paper extends research done on axioms based on the vulnerability model, by stating propositions to explore the effects of different operators on the profiles relative and absolute vulnerabilities. The case studies show that our approach offers a formal background for estimating how attribute and operator changes influence the individual, relative and absolute vulnerability of OSN profiles.
    International Journal of Internet Technology and Secured Transactions 04/2012; 4(2/3).
  • [Show abstract] [Hide abstract]
    ABSTRACT: Online social networking sites have changed the landscape of the internet. The increasing popularity of such sites leads to the aggregation of huge amount of personally identifiable and sensitive personal data online. Along with other security considerations, protection of such personal data is also coming under the responsibility of such service providers. Apart from traditional network attacks targeted on social networking sites, malicious crawlers possess greater threads to the online digital data. Today's security mechanisms to deal with malicious crawlers are not mature and having their own limitations. This paper presents a link encryption primitive to counteract with such crawlers.
    Information Technology: New Generations (ITNG), 2012 Ninth International Conference on; 01/2012

Full-text (2 Sources)

View
16 Downloads
Available from
May 31, 2014