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 Comparative Study of Thresholding Algorithms on Breast Area and Fibroglandular Tissue

One of the independently risk factors of breast cancer is mammographic density reflecting the composition of the fibroglandular tissue in breast area. Tumor in the mammogram is precisely complicated to detect as it is co...

Self Interference Cancellation in Co-Time-Co-Frequency Full Duplex Cellular Communication

The performance of co-time co-frequency full duplex (CCDF) communication systems is limited by the self-interference (SI), which is the result of using the same frequency for transmission and reception. However, current...

Dynamic Time Warping and FFT: A Data Preprocessing Method for Electrical Load Forecasting

For power suppliers, an important task is to accurately predict the short-term load. Thus many papers have introduced different kinds of artificial intelligent models to improve the prediction accuracy. In recent years,...

Multi-Depots Vehicle Routing Problem with Simultaneous Delivery and Pickup and Inventory Restrictions: Formulation and Resolution

Reverse logistics can be defined as a set of practices and processes for managing returns from the consumer to the manufacturer, simultaneously with direct flow management. In this context, we have chosen to study an imp...

Efficient Gabor-Based Recognition for Handwritten Arabic-Indic Digits

In daily life, the need of automatically digitizing paper documentations and recognizing textual images is still present with existing and potential upcoming rooms for improvements, especially for languages like Arabic,...

Download PDF file
  • EP ID EP261618
  • DOI 10.14569/IJACSA.2018.090146
  • Views 90
  • 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