Community detection via an efficient nonconvex optimization approach based on modularity
From MaRDI portal
Publication:830497
Recommendations
- Total variation based community detection using a nonlinear optimization approach
- Revealing network communities with a nonlinear programming method
- Searching graph communities by modularity maximization via convex optimization
- A sparse completely positive relaxation of the modularity maximization for community detection
- Modularity maximization using completely positive programming
Cites work
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- A novel and efficient algorithm for de novo discovery of mutated driver pathways in cancer
- An Efficient Heuristic Procedure for Partitioning Graphs
- Collective dynamics of `small-world' networks
- Consistency of spectral clustering in stochastic block models
- Convexified modularity maximization for degree-corrected stochastic block models
- Diffusion-based method for producing density-equalizing maps
- Estimating network edge probabilities by neighbourhood smoothing
- Latent Space Approaches to Social Network Analysis
- Likelihood-based selection and sharp parameter estimation
- Network cross-validation by edge sampling
- On semidefinite relaxations for the block model
- Pseudo-likelihood methods for community detection in large sparse networks
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Cited in
(11)- Convexified modularity maximization for degree-corrected stochastic block models
- Searching graph communities by modularity maximization via convex optimization
- An efficient community detection algorithm using greedy surprise maximization
- Total variation based community detection using a nonlinear optimization approach
- A method based on total variation for network modularity optimization using the MBO scheme
- Detecting communities in complex networks using triangles and modularity density
- Community detection in networks via nonlinear modularity eigenvectors
- A sparse completely positive relaxation of the modularity maximization for community detection
- Modularity maximization using completely positive programming
- Optimization via low-rank approximation for community detection in networks
- Revealing network communities with a nonlinear programming method
This page was built for publication: Community detection via an efficient nonconvex optimization approach based on modularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q830497)
