A new algorithm for communities detection in social networks with node attributes.

Autor: Gmati, Haifa, Mouakher, Amira, Gonzalez-Pardo, Antonio, Camacho, David
Zdroj: Journal of Ambient Intelligence & Humanized Computing; Feb2024, Vol. 15 Issue 2, p1779-1791, 13p
Abstrakt: Revealing the community structure in social networks witnessed a determined effort. In this respect, a different category of social network can be handled, such as, dynamic social networks, social networks with node attributes, etc. In this article, we introduce a new method to solve this thriving issue in the social network with node attributes. This latter can be represented by a bipartite graph, which consists of a two sets of nodes and edges connecting these nodes. The tendency of people with similar node attributes leads to the hidden information of clusters or communities. A wealthy number of community-detection algorithms have been proposed for bipartite graphs and applied to several domains in the literature. To palliate some of the highlighted shortcomings, we introduce a new approach, called Fast-Bi Community Detection (FBCD), that aims to an efficient community detection in social networks. The main idea of this approach is to explore the set of maximum matching in the bipartite graph in order to reduce the complexity of our algorithm. The carried out experiments show the high quality of the obtained communities versus those by the pioneering ones of the literature. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index
Externí odkaz: