• Aucun résultat trouvé

Community detection in networks based on minimum spanning tree and modularity

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

Academic year: 2021

Partager "Community detection in networks based on minimum spanning tree and modularity"

Copied!
1
0
0

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

Texte intégral

(1)

Community detection in networks based on minimum

spanning tree and modularity

Authors

Bilal Saoud, Abdelouahab Moussaoui

Publication date

2016/10/15

Journal

Physica A: Statistical Mechanics and its Applications

Volume 460 Pages 230-234 Publisher North-Holland Description

In this paper we propose a novel splitting and merging method for community detection in which a minimum spanning tree (MST) of dissimilarity between nodes in graph is employed. In the splitting process, edges with high dissimilarity in the MST are removed to construct small disconnected subgroups of nodes from the same community. In the merging process, subgroup pairs are iteratively merged to identify the final community structure maximizing the modularity. The proposed method requires no parameter. We provide a general framework for implementing such a method. Experimental results obtained by applying the method on computer-generated networks and different real-world networks show the effectiveness of the proposed method.

Références

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

Documents relatifs

ON MINIMUM SPANNING TREE STREAMING FOR IMAGE ANALYSIS

The computation of minimum spanning tree (MST) on the gradient of an image is one of the main ingredients for the characterization of structures in different image processing

TD4 ALGORES Spanning-Tree and MST

Consider the graph in Figure 2 where the weights on the edges represent the fiability of the corresponding communication link (where 0 is the minimum and 1 is the maximum fiability

Fast Self-Stabilizing Minimum Spanning Tree Construction

Macro RecoverEdge(v) returns the local internal edge of v which has the common ancestor nearest from the root among the internal edges that were not taken into account by its

Contextual Sources of Perceived Group Threat: Negative Immigration-Related News Reports, Immigrant Group Size and their Interaction, Spain 1996-2007

We attempt to expand upon earlier work in this field by specifying and testing three hypotheses to what extent (i) immigrant group size, (ii) negative immigration- related news

A Generalization of the Minimum Branch Vertices Spanning Tree Problem

Computational results based on randomly generated graphs show that the number of k -branch vertices included in the spanning tree increases with the size of the vertex set V,

A Distributed Algorithm for the Minimum Diameter Spanning Tree Problem

Moreover, when used for xed classes G of graphs having optimum (APSPs) compact routing schemes, the construction of an MDST of G ∈ G may be performed by using interval, linear

A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree

Therefore, having a spanning tree with minimum diameter of arbitrary networks makes it possible to design a wide variety of time- efficient distributed algorithms.. In order

A Uniform Self-Stabilizing Minimum Diameter Spanning Tree Algorithm

The first stage is a uniform randomized stabilizing unique naming protocol, and the second stage is a stabilizing MDST protocol, designed as a fair composition of