Variable Neighborhood Search for Edge-Ratio Network Clustering

Abstract : Edge-ratio clustering was introduced in [Cafieri et al., Phys.Rev. E 81(2):026105, 2010], as a criterion for optimal graph bipartitioning in hierarchical divisive algorithms for cluster identification in networks. Exact algorithms to perform bipartitioning maximizing the edge-ratio were shown to be too time consuming to be applied to large datasets. In this paper, we present a Variable Neighborhood Search (VNS)-based heuristic for hierarchical divisive edge ratio network clustering. We give a full description including the structure of some algorithmic procedures which are used to implement the main steps of the heuristic. Computational results show that the proposed algorithm is very efficient in terms of quality of the bipartitions, moreover the computing time is much smaller than that one for exact algorithms.
Document type :
Book sections
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal-enac.archives-ouvertes.fr/hal-01017978
Contributor : Céline Smith <>
Submitted on : Thursday, July 3, 2014 - 2:54:36 PM
Last modification on : Friday, January 10, 2020 - 9:08:59 PM
Long-term archiving on: Friday, October 3, 2014 - 11:29:06 AM

File

Cafieri_NATO2014.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01017978, version 1

Citation

Sonia Cafieri, Pierre Hansen, Nenad Mladenovic. Variable Neighborhood Search for Edge-Ratio Network Clustering. S. Butenko et al. Examining Robustness and Vulnerability of Networked Systems, IOS Press, pp 51-64, 2014, NATO Science for Peace and Security Series - D : Information and Communication Security, Volume 37, 978-1-61499-390-2. ⟨hal-01017978⟩

Share

Metrics

Record views

462

Files downloads

143