Overlapping Community Detection Method for Social Networks

2017 ◽  
pp. 143-151
Author(s):  
Mohamed Ismail Maiza ◽  
Chiheb-Eddine Ben N’Cir ◽  
Nadia Essoussi
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Detection Method ◽  
Overlapping Community Detection ◽  
Overlapping Community

Community detection in social networks based on information propagation and user engagement

2021 ◽  
pp. 2150119
Author(s):  
Fuzhong Nian ◽  
Li Luo ◽  
Xuelong Yu ◽  
Xin Guo
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Detection Method ◽  
User Engagement ◽  
Connection Strength ◽  
Information Propagation ◽  
Edge Strength ◽  
Strength Based ◽  
Network Propagation ◽  
Overlapping Community

The iterative propagation of information between nodes will strengthen the connection strength between nodes, and the network can evolve into different groups according to difference edge strength. Based on this observation, we present the user engagement to quantify the influences of users different propagation modes to network propagation, and construct weight network to simulate real social network, and proposed the community detection method in social networks based on information propagation and user engagement. Our method can produce different scale communities and overlapping community. We also applied our method to real-world social networks. The experiment proved that the network spread and the community division interact with each other. The community structure is significantly different in the network propagation of different scales.

Community Detection in Large-Scale Social Networks

2018 ◽  
pp. 189-206 ◽  
Author(s):  
S Rao Chintalapudi ◽  
M. H. M. Krishna Prasad
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Large Scale ◽  
The Other ◽  
Edge Density ◽  
Challenging Problem ◽  
Overlapping Community Detection ◽  
Clustering Problem ◽  
Detection Algorithms ◽  
Overlapping Community

Community Structure is one of the most important properties of social networks. Detecting such structures is a challenging problem in the area of social network analysis. Community is a collection of nodes with dense connections than with the rest of the network. It is similar to clustering problem in which intra cluster edge density is more than the inter cluster edge density. Community detection algorithms are of two categories, one is disjoint community detection, in which a node can be a member of only one community at most, and the other is overlapping community detection, in which a node can be a member of more than one community. This chapter reviews the state-of-the-art disjoint and overlapping community detection algorithms. Also, the measures needed to evaluate a disjoint and overlapping community detection algorithms are discussed in detail.

Sign in / Sign up

Export Citation Format

Share Document