Graph Mining Approaches to Study Volunteer Relationships in Sourceforge.net

Graph Mining Approaches to Study Volunteer Relationships in Sourceforge.net

DOI: 10.4018/978-1-5225-3707-6.ch007
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

The contribution of volunteers in the development of Free and Open Source Software in Sourceforge.net is studied in this paper. Using Social Network analysis, the small set of developers who can maximize the information flow in the network are discovered. The propagation of top developers across past three years are also studied. The four algorithms used to find top influential developers gives almost similar results. The movement of top developers over past years was also consistent. Influential nodes in a network are very important to diffuse influence on the rest of the network. They are most often highly connected within the network. The existing algorithms are efficient to identify them. However, the challenge is in selecting a seed set that can spread the influence instantaneously with least effort. In this paper, a method is defined to spread influence on the entire network by selecting the least number of non-overlapping influential nodes faster than a well known existing algorithm. Further to this, the number of clusters in the network is also determined simultaneously from the seed set of the networks.
Chapter Preview
Top

Introduction

Increase in the use of personal computers in late 1980s has encouraged much wider use of Social network analysis (SNA) methods because it has meant increased ability to manage large data sets and to visualize social network data in a wide variety of ways (Pan, 2007). Social network analysis is based on an assumption of the importance of relationships among interacting units. It is also used to study social relations among a set of actors as it concerns with the network structure formulation and solution (Borgatti, Mehra, Brass et al., 2009; Carrington, Scott & Wasserman, 2005). Such structures are usually captured in graphs. At organisations, collaboration in networks is critical to innovation. Paradoxically these networks are taken for granted, frequently invisible and rarely managed (Lim, Quercia & Finkelstein, 2010; Thomas, Valluri & Karlapalem, 2006).

Social network analysis is focused on uncovering the patterning of people’s interaction. A rapid growth in work across organisation as well as geographic boundaries with outsourcing, off-shoring, virtual organisations and business process networks combined with trends such as the rise of blogs, online communities and social networking sites such as Friendster and Linkedin as well as the rapid growth of collaborative software have all contributed to the emergence of SNA from the academic closet. The network’s perspective encompasses theories, models, and applications that are expressed in terms of relational concepts or processes. Along with growing interest and increased use of network analysis has come a consensus about the central principles underlying the network perspective. The semantic web is an emerging concept that launches the idea of having data on the web defined and linked in a way that it can be used by people and processed by machines. The semantic web and social network models support each other (Jamali & Abolhassani, 2006).

Graph Data Mining in Social Network Analysis

Graphs have become very important in modelling complicated structures. Many domains produce data that can be intuitively represented by graphs. The process of discovering interesting facts and information about these graphs is difficult and challenging to work with, because real world data is very huge for any sort of raw interpretation. Graph mining which is a data mining approach has to be collaborated with SNA to obtain the results of the data sets so as to provide us with an insight of the frequent sub graphs of interest.

Complete Chapter List

Search this Book:
Reset