Imperial College London

Professor Christopher Hankin

Faculty of EngineeringDepartment of Computing

Professor of Computing
 
 
 
//

Contact

 

c.hankin Website

 
 
//

Location

 

Sherfield BuildingSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@inproceedings{Le:2012,
author = {Le, Martelot E and Hankin, C},
title = {Multi-scale Community Detection using Stability as Optimisation Criterion in a Greedy Algorithm},
url = {http://www.elemartelot.org/},
year = {2012}
}

RIS format (EndNote, RefMan)

TY  - CPAPER
AB - Whether biological, social or technical, many real systems are represented as networks whose structure can be very informative regarding the original system's organisation. In this respect the field of community detection has received a lot of attention in the past decade. Most of the approaches rely on the notion of modularity to assess the quality of a partition and use this measure as an optimisation criterion. Recently stability was introduced as a new partition quality measure encompassing former partition quality measures such as modularity. The work presented here assesses stability as an optimisation criterion in a greedy approach similar to modularity optimisation techniques and enables multi-scale analysis using Markov time as resolution parameter. The method is validated and compared with other popular approaches against synthetic and various real data networks and the results show that the method enables accurate multi-scale network analysis.
AU - Le,Martelot E
AU - Hankin,C
PY - 2012///
TI - Multi-scale Community Detection using Stability as Optimisation Criterion in a Greedy Algorithm
UR - http://www.elemartelot.org/
ER -