A Parallel Community Detection Algorithm for Big Social Networks

Abstract

Mining social networks has become an important task in data mining field, which describes users and their roles and relationships in social networks. Processing social networks with graph algorithms is the source for discovering many features. The most important algorithms applied to social networks are community detection algorithms. Communities of social networks are groups of people sharing common interests or activities. DenGraph is one of the density-based algorithms that used to find clusters of arbitrary shapes based on users’ interactions in social networks. However, because of the rapidly growing size of social networks, it is impossible to process a huge graph on a single machine in an acceptable level of execution. In this article, DenGraph algorithm has been redesigned to work in distributed computing environment. We proposed ParaDengraph Algorithm based on Pregel parallel model for large graph processing.

Authors and Affiliations

Yathrib AlQahtani, Mourad Ykhlef

Keywords

Related Articles

A Framework for Creating a Distributed Rendering Environment on the Compute Clusters

This paper discusses the deployment of existing render farm manager in a typical compute cluster environment such as a university. Usually, both a render farm and a compute cluster use different queue managers and assume...

MAS based on a Fast and Robust FCM Algorithm for MR Brain Image Segmentation

In the aim of providing sophisticated applications and getting benefits from the advantageous properties of agents, designing agent-based and multi-agent systems has become an important issue that received further consid...

An Expert Comparison of Accreditation Support Tools for the Undergraduate Computing Programs

Realizing continuous quality improvement within educational programs is a challenging task. However, there exist various assessment tools and models that help in this regard. This paper explores the features and capabili...

 Key Issues in Vowel Based Splitting of Telugu Bigrams

 Splitting of compound Telugu words into its components or root words is one of the important, tedious and yet inaccurate tasks of Natural Language Processing (NLP). Except in few special cases, at least one vowel i...

Intelligent Irrigation Management System

It is widely known that water resources are decreasing around the world. Rapid urbanization, population growth, industries and the expansion of agriculture are increasing demand for freshwater. In most countries, includi...

Download PDF file
  • EP ID EP261618
  • DOI 10.14569/IJACSA.2018.090146
  • Views 91
  • Downloads 0

How To Cite

Yathrib AlQahtani, Mourad Ykhlef (2018). A Parallel Community Detection Algorithm for Big Social Networks. International Journal of Advanced Computer Science & Applications, 9(1), 335-340. https://europub.co.uk/articles/-A-261618