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
Author(s):  
Pooja Wadhwa ◽  
M.P.S Bhatia

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.


Information ◽  
2021 ◽  
Vol 12 (3) ◽  
pp. 113
Author(s):  
Barbara Guidi ◽  
Andrea Michienzi

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.


2018 ◽  
Vol 115 (5) ◽  
pp. 927-932 ◽  
Author(s):  
Fuchen Liu ◽  
David Choi ◽  
Lu Xie ◽  
Kathryn Roeder

Community detection is challenging when the network structure is estimated with uncertainty. Dynamic networks present additional challenges but also add information across time periods. We propose a global community detection method, persistent communities by eigenvector smoothing (PisCES), that combines information across a series of networks, longitudinally, to strengthen the inference for each period. Our method is derived from evolutionary spectral clustering and degree correction methods. Data-driven solutions to the problem of tuning parameter selection are provided. In simulations we find that PisCES performs better than competing methods designed for a low signal-to-noise ratio. Recently obtained gene expression data from rhesus monkey brains provide samples from finely partitioned brain regions over a broad time span including pre- and postnatal periods. Of interest is how gene communities develop over space and time; however, once the data are divided into homogeneous spatial and temporal periods, sample sizes are very small, making inference quite challenging. Applying PisCES to medial prefrontal cortex in monkey rhesus brains from near conception to adulthood reveals dense communities that persist, merge, and diverge over time and others that are loosely organized and short lived, illustrating how dynamic community detection can yield interesting insights into processes such as brain development.


Author(s):  
Nicole Belinda Dillen ◽  
Aruna Chakraborty

One of the most important aspects of social network analysis is community detection, which is used to categorize related individuals in a social network into groups or communities. The approach is quite similar to graph partitioning, and in fact, most detection algorithms rely on concepts from graph theory and sociology. The aim of this chapter is to aid a novice in the field of community detection by providing a wider perspective on some of the different detection algorithms available, including the more recent developments in this field. Five popular algorithms have been studied and explained, and a recent novel approach that was proposed by the authors has also been included. The chapter concludes by highlighting areas suitable for further research, specifically targeting overlapping community detection algorithms.


Sign in / Sign up

Export Citation Format

Share Document