scholarly journals Dynamic Community Structure in Online Social Groups

Information ◽  
2021 ◽  
Vol 12 (3) ◽  
pp. 113
Author(s):  
Barbara Guidi ◽  
Andrea Michienzi
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Online Social Networks ◽  
Social Groups ◽  
Vast Number ◽  
Detection Algorithms ◽  
Human Scale ◽  
Online Social Media ◽  
Dynamic Community Detection ◽  
Dynamic Community

One of the main ideas about the Internet is to rethink its services in a user-centric fashion. This fact translates to having human-scale services with devices that will become smarter and make decisions in place of their respective owners. Online Social Networks and, in particular, Online Social Groups, such as Facebook Groups, will be at the epicentre of this revolution because of their great relevance in the current society. Despite the vast number of studies on human behaviour in Online Social Media, the characteristics of Online Social Groups are still unknown. In this paper, we propose a dynamic community detection driven study of the structure of users inside Facebook Groups. The communities are extracted considering the interactions among the members of a group and it aims at searching dense communication groups of users, and the evolution of the communication groups over time, in order to discover social properties of Online Social Groups. The analysis is carried out considering the activity of 17 Facebook Groups, using 8 community detection algorithms and considering 2 possible interaction lifespans. Results show that interaction communities in OSGs are very fragmented but community detection tools are capable of uncovering relevant structures. The study of the community quality gives important insights about the community structure and increasing the interaction lifespan does not necessarily result in more clusterized or bigger communities.

Community Detection Approaches in Real World Networks

2014 ◽  
Vol 6 (1) ◽  
pp. 35-51 ◽  
Author(s):  
Pooja Wadhwa ◽  
M.P.S Bhatia
Keyword(s):  
Community Detection ◽  
Online Social Networks ◽  
Temporal Dynamics ◽  
Detection Methods ◽  
Unified Approach ◽  
Detection Algorithms ◽  
Dynamic Community Detection ◽  
Dynamic Communities ◽  
Dynamic Community

Online social networks have been continuously evolving and one of their prominent features is the evolution of communities which can be characterized as a group of people who share a common relationship among themselves. Earlier studies on social network analysis focused on static network structures rather than dynamic processes, however, with the passage of time, the networks have also evolved and the researchers have started to focus on the aspect of studying dynamic behavior of networks. This paper aims to present an overview of community detection approaches graduating from static community detection methods towards the methods to identify dynamic communities in networks. The authors also present a classification of the existing dynamic community detection algorithms along the dimension of studying the evolution as either a two-step approach comprising of community detection via static methods and then applying temporal dynamics or a unified approach which comprises of dynamic detection of communities along with their evolutionary characteristics.

A novel approach for choosing dynamic community detection algorithms using PROMETHEE II

2020 ◽  
Vol 15 (4) ◽  
pp. 327-341
Author(s):  
Samia Mohand Arab ◽  
Noria Taghezout ◽  
Fatima Zohra Benkaddour
Keyword(s):  
Community Detection ◽  
Promethee Ii ◽  
Detection Algorithms ◽  
Novel Approach ◽  
Dynamic Community Detection ◽  
Dynamic Community

A Survey of Parallel Community Detection Algorithms

2017 ◽  
pp. 1-26
Author(s):  
Sobin C. C. ◽  
Vaskar Raychoudhury ◽  
Snehanshu Saha
Keyword(s):  
Social Networks ◽  
Big Data ◽  
Community Structure ◽  
Community Detection ◽  
Social Relations ◽  
Online Social Networks ◽  
Detection Algorithms ◽  
Big Data Applications ◽  
Comprehensive Survey ◽  
External Connections

The amount of data generated by online social networks such as Facebook, Twitter, etc., has recently experienced an enormous growth. Extracting useful information such as community structure, from such large networks is very important in many applications. Community is a collection of nodes, having dense internal connections and sparse external connections. Community detection algorithms aim to group nodes into different communities by extracting similarities and social relations between nodes. Although, many community detection algorithms in literature, they are not scalable enough to handle large volumes of data generated by many of the today's big data applications. So, researchers are focusing on developing parallel community detection algorithms, which can handle networks consisting of millions of edges and vertices. In this article, we present a comprehensive survey of parallel community detection algorithms, which is the first ever survey in this domain, although, multiple papers exist in literature related to sequential community detection algorithms.

scholarly journals A Novel Emerging Topic Identification and Evolution Discovery Method on Time-Evolving and Heterogeneous Online Social Networks

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Xiaoyan Xu ◽  
Wei Lv ◽  
Beibei Zhang ◽  
Shuaipeng Zhou ◽  
Wei Wei ◽  
...  
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Online Social Networks ◽  
Detection Method ◽  
Local Network ◽  
Evolution Law ◽  
Dynamic Community Detection ◽  
Heterogeneous Social Networks ◽  
Propagation Network ◽  
Dynamic Community

With the fast development of web 2.0, information generation and propagation among online users become deeply interweaved. How to effectively and immediately discover the new emerging topic and further how to uncover its evolution law are still wide open and urgently needed by both research and practical fields. This paper proposed a novel early emerging topic detection and its evolution law identification framework based on dynamic community detection method on time-evolving and scalable heterogeneous social networks. The framework is composed of three major steps. Firstly, a time-evolving and scalable complex network denoted as KeyGraph is built up by deeply analyzing the text features of all kinds of data crawled from heterogeneous online social network platforms; secondly, a novel dynamic community detection method is proposed by which the new emerging topic is detected on the modeled time-evolving and scalable KeyGraph network; thirdly, a unified directional topic propagation network modeled by a great number of short texts including microblogs and news titles is set up, and the topic evolution law of the previously detected early emerging topic is identified by fully utilizing local network variations and modularity optimization of the “time-evolving” and directional topic propagation network. Our method is proved to yield preferable results on both a huge amount of computer-generated test data and a great amount of real online network data crawled from mainstream heterogeneous social networks.

Spectral Synchronization Reveals Community Structure

2015 ◽  
Vol 719-720 ◽  
pp. 1198-1202
Author(s):  
Ming Yang Zhou ◽  
Zhong Qian Fu ◽  
Zhao Zhuo
Keyword(s):  
Spectral Analysis ◽  
Community Structure ◽  
Community Detection ◽  
Hierarchical Structure ◽  
Edge Density ◽  
Complex Structures ◽  
Detection Algorithms ◽  
Dimension Space ◽  
Local Synchronization ◽  
Better Than

Practical networks have community and hierarchical structure. These complex structures confuse the community detection algorithms and obscure the boundaries of communities. This paper proposes a delicate method which synthesizes spectral analysis and local synchronization to detect communities. Communities emerge automatically in the multi-dimension space of nontrivial eigenvectors. Its performance is compared to that of previous methods and applied to different practical networks. Our results perform better than that of other methods. Besides, it’s more robust for networks whose communities have different edge density and follow various degree distributions. This makes the algorithm a valuable tool to detect and analysis large practical networks with various community structures.

Sign in / Sign up

Export Citation Format

Share Document