Identification of network modules by optimization of ratio association
From MaRDI portal
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 to develop an efficient optimization algorithm, based on the deterministic annealing scheme. The performance of the proposed method is shown on a real data set and on simulated networks.
Cites work
- A deterministic annealing approach to clustering
- Community structure in social and biological networks
- Complex networks: structure and dynamics
- Cost functions for pairwise data clustering
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3304505 (Why is no real title available?)
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Pattern classification.
Cited in
(5)- Balanced centrality of networks
- A frequency domain approach for local module identification in dynamic networks
- scientific article; zbMATH DE number 5899441 (Why is no real title available?)
- Improving spectral bounds for clustering problems by Lagrangian relaxation
- Partitioning networks into clusters and residuals with average association
This page was built for publication: Identification of network modules by optimization of ratio association
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624790)
