Edge-Ratio Network Clustering by Variable Neighborhood Search - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue The European Physical Journal B: Condensed Matter and Complex Systems Année : 2014

Edge-Ratio Network Clustering by Variable Neighborhood Search

(1) , (2) , (3)
1
2
3

Résumé

The analysis of networks and in particular the identification of communities, or clusters, is a topic of active research with application arising in many domains. Several models were proposed for its solution. In [Cafieri et al., Phys. Rev. E 81(2):026105, 2010], a criterion is proposed for a graph bipartition to be optimal: one seeks to maximize the minimum for both classes of the bipartition of the ratio of inner edges to cut edges (edge ratio), and it is used in a hierarchical divisive algorithm for community identification in networks. In this paper, we develop a VNS-based heuristic for hierarchical divisive edge ratio network clustering. A k-neighborhood is defined as move of k entities, i.e., k entities change their membership from one to another cluster. A local search is based on 1-changes and k-changes are used for shaking the incumbent solution. Computational results on datasets from the literature validate the proposed approach.
Fichier principal
Vignette du fichier
Cafieri_EPJB2014.pdf (231.81 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00979295 , version 1 (15-04-2014)

Identifiants

Citer

Sonia Cafieri, Pierre Hansen, Nenad Mladenovic. Edge-Ratio Network Clustering by Variable Neighborhood Search. The European Physical Journal B: Condensed Matter and Complex Systems, 2014, 87 (5), pp 116. ⟨10.1140/epjb/e2014-50026-4⟩. ⟨hal-00979295⟩
276 Consultations
2139 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More