Identification of network modules by optimization of ratio association
- 21 May 2007
- journal article
- research article
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 17 (2) , 023114
- https://doi.org/10.1063/1.2732162
Abstract
We introduce a novel method for identifying the modular structures of a network based on the maximization of an objective function: the ratio association. This cost function arises when the communities detection problem is described in the probabilistic autoencoder frame. An analogy with kernel k-means methods allows us to develop an efficient optimization algorithm, based on the deterministic annealing scheme. The performance of the proposed method is shown on real data sets and on simulated networks. (c) 2007 American Institute of Physics.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Modularity and community structure in networksProceedings of the National Academy of Sciences, 2006
- Synchronization Reveals Topological Scales in Complex NetworksPhysical Review Letters, 2006
- Complex networks: Structure and dynamicsPhysics Reports, 2006
- Community detection in complex networks using extremal optimizationPhysical Review E, 2005
- Functional cartography of complex metabolic networksNature, 2005
- Detecting Fuzzy Community Structures in Complex Networks with a Potts ModelPhysical Review Letters, 2004
- Detecting community structure in networksZeitschrift für Physik B Condensed Matter, 2004
- Community structure in social and biological networksProceedings of the National Academy of Sciences, 2002
- Social Network AnalysisPublished by Cambridge University Press (CUP) ,1994
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990