By Topic

Interactive visualization of the social network of research collaborations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Alsukhni, M. ; Fac. of Eng. & Appl. Sci., Univ. of Ontario Inst. of Technol., Oshawa, ON, Canada ; Ying Zhu

Social networks have been evolving over the past few years, leading to a rapid increase in the number and complexity of relationships among their entities. In this paper, we focus on a large scale dataset known as the Digital Bibliography and Library Project (DBLP), which contains information on all publications that have been published in computer and information science related journals and conference proceedings. We model the DBLP dataset as a social network of research collaborations. DBLP is a structured and dynamic dataset stored in the XML file format; it contains over 850,000 authors and 2 million publications and the resulting collaboration social network is a scale-free network. We define DBLP collaboration social network as a graph that consists of researchers as nodes and links representing the collaboration among the researchers. In this work, we implement a data analysis algorithm called Multidimensional Scaling (MDS) to represent the degree of collaboration among the DBLP authors as Euclidean distances in order to analyze, mine and understand the relational information in this large scale network in a visual way. MDS requires a highly computational complexity for large scale graphs such as the DBLP graph. Therefore, we propose different solutions to overcome this problem, and improve the MDS performance. In addition, as the quality of the MDS result is measured by a metric known as the stress value, we use the steepest descent method to minimize the stress in an iterative process called stress optimization in order to generate the best geometric layout of the graph. We also propose a solution to further enhance the graph visualization by partitioning the graph into sub-graphs and using repelling forces among nodes within the same sub-graph.

Published in:

Information Reuse and Integration (IRI), 2012 IEEE 13th International Conference on

Date of Conference:

8-10 Aug. 2012