• Aucun résultat trouvé

Node similarity and modularity for finding communities in networks

N/A
N/A
Info
Télécharger
Protected

Academic year: 2021

Partager "Node similarity and modularity for finding communities in networks"

Copied!
1
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

Node similarity and modularity for finding communities in

networks

Authors

Bilal Saoud, Abdelouahab Moussaoui

Publication date 2018/2/15

Journal

Physica A: Statistical Mechanics and Its Applications

Volume 492 Pages 1958-1966 Publisher North-Holland Description

Community detection in networks has become a very important axis of research for

understanding the structure of networks. Several methods have been proposed to detect the most optimal community structure in networks. In this article, we present a novel method for detecting community structure ComDBNS (Community Detection Based on Node Similarity) for unweighted and undirected networks; it performs in two steps. The first step uses the similarity between endpoints of each link to find the inter-community links to remove in order to create basic groups of nodes properly connected. In the second step we propose a strategy to merge these initial groups to identify the final community structure (with k

communities or the structure that maximizes the modularity in Community Detection Based on Node Similarity and Modularity Q (ComDBNSQ)). The proposed method is tested on the real and computer-generated …

Références

Télécharger maintenant ( PDF - 1 Page - 242.86 KB )

Documents relatifs

One-mode Projection-based Multilevel Approach for Community Detection in Bipartite Networks

While previous multi- level methods consider only unipartite networks, our one-mode projection-based multilevel method enables handling bipartite networks with standard

Community Detection in Networks: Algorithms and Challenges

The Strength algorithm [8] has a strategy which is to find an initial partial community with maximal node strength and expand by adding tight nodes to the partial

Towards a New Approach for Community Detection Algorithm in Social Networks

Our approach proposes an algorithm for the detection of communities in social networks, especially the detection of leader nodes (influencer’s nodes) without a

Detecting community structure in complex networks via node similarity

Based on node similarity, a fast and efficient method for detecting community structure is proposed, which discovers the community structure by iteratively incorporating the

Combined neighborhood tabu search for community detection in complex networks

The proposed algorithm, called CNTS for combined neighborhood tabu search (CNTS), relies on a joint use of vertex move and merge operators to improve the quality of the

Modularity maximization to find community structure in complex networks

To evaluate our method to find community structures in networks, we have tested it on computer-generated and several real networks (Zackary's Karate Club [11], Amer- ican

Agent-based Broadcast Protocols for Wireless Heterogeneous Node Networks

The second protocol uses an optimal complexity of memory space for each thing to achieve the permutation routing with a parallel broadcasting using less number of channels.. We give

Finding Influential Nodes in Networks with Community Structure

In our previous work 4 , we show that the centrality of a node in a network with non-overlapping communities de- pends on two features: Its local influence on the nodes belonging to