A New Community Detection Problem Based on Bipolar Fuzzy Measures

Author(s):  
Inmaculada Gutiérrez ◽  
Daniel Gómez ◽  
Javier Castro ◽  
Rosa Espínola
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):  
Amany A. Naem ◽  
Neveen I. Ghali

Antlion Optimization (ALO) is one of the latest population based optimization methods that proved its good performance in a variety of applications. The ALO algorithm copies the hunting mechanism of antlions to ants in nature. Community detection in social networks is conclusive to understanding the concepts of the networks. Identifying network communities can be viewed as a problem of clustering a set of nodes into communities. k-median clustering is one of the popular techniques that has been applied in clustering. The problem of clustering network can be formalized as an optimization problem where a qualitatively objective function that captures the intuition of a cluster as a set of nodes with better in ternal connectivity than external connectivity is selected to be optimized. In this paper, a mixture antlion optimization and k-median for solving the community detection problem is proposed and named as K-median Modularity ALO. Experimental results which are applied on real life networks show the ability of the mixture antlion optimization and k-median to detect successfully an optimized community structure based on putting the modularity as an objective function.


2019 ◽  
Vol 33 (10) ◽  
pp. 1950089
Author(s):  
Fatemeh Alimadadi ◽  
Ehsan Khadangi ◽  
Alireza Bagheri

The emergence of online social networks has revolutionized millions of web users’ behavior so that their interactions with each other produce huge amounts of data on different activities. Community detection, herein, is one of the most important tasks. The very recent trend is to detect meaningful communities based on users’ interactions or the activity network. However, in many of such studies, authors consider the basic network model while almost ignoring the model of the interactions in the multi-layer network. In this research, an experimental study is done to compare community detection in Facebook friendship network to that of activity network, considering different activities in Facebook OSN such as sharing. Then, a new community detection evaluation metric based on homophily is proposed. Eventually, a new method of community detection based on different activities in Facebook social network is presented. In this method, we generalized three familiar similarity methods, Jaccard, Common Neighbors and Adamic-Adar for multi-layered network model.


Sign in / Sign up

Export Citation Format

Share Document