Revealing network communities with a nonlinear programming method
From MaRDI portal
Recommendations
- Total variation based community detection using a nonlinear optimization approach
- Community detection in networks via nonlinear modularity eigenvectors
- Modularity maximization using completely positive programming
- Community detection via an efficient nonconvex optimization approach based on modularity
- Modularity-maximizing graph communities via mathematical programming
Cited in
(17)- Modularity maximization using completely positive programming
- A constrained power method for community detection in complex networks
- A divide-and-link algorithm for hierarchical clustering in networks
- Visualizing network communities with a semi-definite programming method
- Variational community partition with novel network structure centrality prior
- Maximizing modularity intensity for community partition and evolution
- Community detection in networks via nonlinear modularity eigenvectors
- Fast cluster detection in networks by first order optimization
- Total variation based community detection using a nonlinear optimization approach
- A framework of mapping undirected to directed graphs for community detection
- A method based on total variation for network modularity optimization using the MBO scheme
- A nonlinear programming approach to the study of social networks
- Subsampling-based modified Bayesian information criterion for large-scale stochastic block models
- Anti-modularity and anti-community detecting in complex networks
- Community detection via an efficient nonconvex optimization approach based on modularity
- Community structures of networks
- Finding community structures in complex networks using mixed integer optimisation
This page was built for publication: Revealing network communities with a nonlinear programming method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2510154)