1.

UNIVERSITY OF GONDAR
COLLEGE OF INFORMATICS
DEPARTMENT OF INFORMATION SCIENCE
DATA SCIENCE AND ANALYTICS POST GRADUATE
PROGRAM
ASSIGNMENT TYPE:-ARTICLE REVIEW
BY:- MOHAMMED SEID
 CONTENT
Paper information
Introduction
Research Goal
Significance
Categories of the subject
Significance of the categories
Relation between of the categories
Experiment of discussion
Conclusion
 SURVEY-PAPER INFORMATION
Author Title Journal Volume Article Year DOI
number

Community detection in Community detection Social 9 23 2019 https://doi.org/

large-scale social networks: in large-scale social Network 10.1007/
state-of-the-art and future networks: state-of-the- Analysis s13278-019-
directions art and future and Mining 0566-x
directions journal
 INTRODUCTION
 A community Ci may be described as a group of vertices(i.e., a
subgraph) that probably share common properties and/or play
similar roles within a network (see Fortunato2010).

 Communities are an important feature of the network that can

generally be defined as two categories: the structure based, a cluster
of nodes that have more links with each other than other nodes of a
graph, and the semantic based, a cluster of nodes with similar
semantic context or a set of nodes sharing the same interests.
 CONT..

 The community detection constitutes a

growing challenge, because of the
heterogeneity of data and structures formed in
them, and their size.
 This survey paper focuses on community detection algorithms in large-scale social
networks and provides a comprehensive taxonomy of existing models based on their
computational nature (centralized or distributed) and application to static or dynamic social
networks.
 GOAL OF THE SURVEY

The focus of the paper is:

To categorize and compare the theoretic community detection algorithms.
To bring together techniques related to characterize, identify, and extract communities
with two strategies: centralized and distributed.
To analyze the strategy of detection according to the dynamic of networks: static or
evolves over time.
 To provide the metrics for detecting partition: the structural-based partition or the
semantic and structural-based partition
 SIGNIFICANCE

 This survey paper provides a comprehensive review of community detection algorithms

for social networks. Here are some key points about its significance

It categorizes and compares different community detection models based on whether they
are centralized vs distributed and for static vs dynamic networks. This provides a useful
taxonomy of the state-of-the-art in this field.

It analyzes the characteristics, performance, complexity, and computational cost of

different algorithms. This helps compare the strengths and weaknesses of different
approaches
 CONT..

It covers community detection based on just network structure as well as integrating
semantic information. This highlights how meaning and content can improve
detection

It provides future research directions and open challenges, such as handling dynamic
semantic data, improving scalability, estimating the number of communities,
distributed detection in undistributed networks, and multimodal analysis. This gives
guidance for advancing this research area
 CATEGORIES OF THE SUBJECT


 THANKS!!!

For Your Comment..