Filters

2017 - 20192
Reset filters

Settings

Author: Behera, Ranjan KumarCOAR Access Rights: open access

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Article
    Citation - WoS: 18
    Citation - Scopus: 35
    Distributed Centrality Analysis of Social Network Data Using Mapreduce
    (Mdpi, 2019) Behera, Ranjan Kumar; Rath, Santanu Kumar; Misra, Sanjay; Damasevicius, Robertas; Maskeliunas, Rytis
    Analyzing the structure of a social network helps in gaining insights into interactions and relationships among users while revealing the patterns of their online behavior. Network centrality is a metric of importance of a network node in a network, which allows revealing the structural patterns and morphology of networks. We propose a distributed computing approach for the calculation of network centrality value for each user using the MapReduce approach in the Hadoop platform, which allows faster and more efficient computation as compared to the conventional implementation. A distributed approach is scalable and helps in efficient computations of large-scale datasets, such as social network data. The proposed approach improves the calculation performance of degree centrality by 39.8%, closeness centrality by 40.7% and eigenvalue centrality by 41.1% using a Twitter dataset.
  • Thumbnail Image
    Article
    Citation - WoS: 31
    Citation - Scopus: 36
    Large Scale Community Detection Using a Small World Model
    (Mdpi, 2017) Behera, Ranjan Kumar; Rath, Santanu Kumar; Misra, Sanjay; Damasevicius, Robertas; Maskeliunas, Rytis
    In a social network, small or large communities within the network play a major role in deciding the functionalities of the network. Despite of diverse definitions, communities in the network may be defined as the group of nodes that are more densely connected as compared to nodes outside the group. Revealing such hidden communities is one of the challenging research problems. A real world social network follows small world phenomena, which indicates that any two social entities can be reachable in a small number of steps. In this paper, nodes are mapped into communities based on the random walk in the network. However, uncovering communities in large-scale networks is a challenging task due to its unprecedented growth in the size of social networks. A good number of community detection algorithms based on random walk exist in literature. In addition, when large-scale social networks are being considered, these algorithms are observed to take considerably longer time. In this work, with an objective to improve the efficiency of algorithms, parallel programming framework like Map-Reduce has been considered for uncovering the hidden communities in social network. The proposed approach has been compared with some standard existing community detection algorithms for both synthetic and real-world datasets in order to examine its performance, and it is observed that the proposed algorithm is more efficient than the existing ones.