scholarly journals Performance Evaluation of Community Detection Algorithms in Social Networks Analysis

2020 ◽  
Vol 13 (14) ◽  
pp. 388-393
Author(s):  
Prajakta Vispute
Author(s):  
Pietro A. Bianchi ◽  
Monika Causholli ◽  
Miguel Minutti-Meza ◽  
Raul Villamil-Otero

Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 443
Author(s):  
Inmaculada Gutiérrez ◽  
Juan Antonio Guevara ◽  
Daniel Gómez ◽  
Javier Castro ◽  
Rosa Espínola

In this paper, we address one of the most important topics in the field of Social Networks Analysis: the community detection problem with additional information. That additional information is modeled by a fuzzy measure that represents the risk of polarization. Particularly, we are interested in dealing with the problem of taking into account the polarization of nodes in the community detection problem. Adding this type of information to the community detection problem makes it more realistic, as a community is more likely to be defined if the corresponding elements are willing to maintain a peaceful dialogue. The polarization capacity is modeled by a fuzzy measure based on the JDJpol measure of polarization related to two poles. We also present an efficient algorithm for finding groups whose elements are no polarized. Hereafter, we work in a real case. It is a network obtained from Twitter, concerning the political position against the Spanish government taken by several influential users. We analyze how the partitions obtained change when some additional information related to how polarized that society is, is added to the problem.


Author(s):  
Christophe Thovex ◽  
Bénédicte LeGrand ◽  
Ofelia Cervantes ◽  
J. Alfredo Sánchez ◽  
Francky Trichet

Author(s):  
S Rao Chintalapudi ◽  
M. H. M. Krishna Prasad

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