A Two-Stage Overlapping Community Detection Based on Structure and Node Attributes in Online Social Networks

2019 ◽  
pp. 310-320
Author(s):  
Xinmeng Zhang ◽  
Xinguang Li ◽  
Shengyi Jiang ◽  
Xia Li ◽  
Bolin Xie
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Online Social Networks ◽  
Two Stage ◽  
Overlapping Community Detection ◽  
Node Attributes ◽  
Overlapping Community

scholarly journals Community Detection Using Node Attributes and Structural Patterns in Online Social Networks

2017 ◽  
Vol 10 (4) ◽  
pp. 50
Author(s):  
Bikash Chandra Singh ◽  
Mohammad Muntasir Rahman ◽  
Md Sipon Miah ◽  
Mrinal Kanti Baowaly
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Online Social Networks ◽  
Online Social Network ◽  
Detection Methods ◽  
Structural Patterns ◽  
Detection Algorithms ◽  
Proposed Model ◽  
Node Attributes ◽  
Overlapping Community

Community detection in online social networks is a difficult but important phenomenon in term of revealing hidden relationships patterns among people so that we can understand human behaviors in term of social-economics perspectives. Community detection algorithms allow us to discover these types of patterns in online social networks. Identifying and detecting communities are not only of particular importance but also have immediate applications. For this reason, researchers have been intensively investigated to implement efficient algorithms to detect community in recent years. In this paper, we introduce set theory to address the community detection problem considering node attributes and network structural patterns. We also formulate probability theory to detect the overlapping community in online social network. Furthermore, we extend our focus on the comparative analysis on some existing community detection methods, which basically consider node attributes and edge contents for detecting community. We conduct comprehensive analysis on our framework so that we justify the performance of our proposed model. The experimental results show the effectiveness of the proposed approach.

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