Next Article in Journal
Sound Synthesis of Objects Swinging through Air Using Physical Models
Next Article in Special Issue
Estimation of Mental Distress from Photoplethysmography
Previous Article in Journal
Smart Healthcare
Previous Article in Special Issue
Effects of Viewing Displays from Different Distances on Human Visual System
Article Menu
Issue 11 (November) cover image

Export Article

Open AccessArticle
Appl. Sci. 2017, 7(11), 1173; https://doi.org/10.3390/app7111173

Large Scale Community Detection Using a Small World Model

1
Department of Computer Science and Engineering, National Institute of Technology, Rourkela 769008, India
2
Department of Computer Engineering, Atilim University, Incek, Ankara 06836, Turkey
3
Department of Electrical and Information Engineering, Covenant University, Ota 1023, Nigeria
4
Department of Multimedia Engineering, Kaunas University of Technology, Kaunas 51368, Lithuania
Current address: Department of Computer Science and Engineering, NIT Rourkela, Rourkela 769008, Odisha, India.
*
Authors to whom correspondence should be addressed.
Received: 27 September 2017 / Revised: 1 November 2017 / Accepted: 2 November 2017 / Published: 15 November 2017
(This article belongs to the Special Issue Socio-Cognitive and Affective Computing)
Full-Text   |   PDF [870 KB, uploaded 16 November 2017]   |  

Abstract

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. View Full-Text
Keywords: small world network; six degrees of separation; map reduce; community detection; modularity; normalize mutual information small world network; six degrees of separation; map reduce; community detection; modularity; normalize mutual information
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Behera, R.K.; Rath, S.K.; Misra, S.; Damaševičius, R.; Maskeliūnas, R. Large Scale Community Detection Using a Small World Model. Appl. Sci. 2017, 7, 1173.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Appl. Sci. EISSN 2076-3417 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top