A DC Programming Approach for Finding Communities in Networks
From MaRDI portal
Recommendations
- Detecting network communities: a new systematic and efficient algorithm
- COMMUNITY FINDING IN COMPLEX NETWORKS
- A density set algorithm for searching communities in complex networks
- Algorithms and Models for the Web-Graph
- An algorithm for detecting communities in social networks
- Community detection based on network communicability
- Visualizing network communities with a semi-definite programming method
Cites work
- scientific article; zbMATH DE number 5360792 (Why is no real title available?)
- scientific article; zbMATH DE number 3673370 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A DC programming approach for feature selection in support vector machines learning
- A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection
- A new efficient algorithm based on DC programming and DCA for clustering
- Binary classification via spherical separator by DC programming and DCA
- Community detection by modularity maximization using GRASP with path relinking
- Computing Communities in Large Networks Using Random Walks
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Fast unfolding of communities in large networks
- Finding community structures in complex networks using mixed integer optimisation
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
- Learning sparse classifiers with difference of convex functions algorithms
- Modularity-maximizing graph communities via mathematical programming
- Multicategory ψ-Learning
- Multilevel local search algorithms for modularity clustering
- Networks. An introduction.
- On Finding Graph Clusterings with Maximum Modularity
- On ψ-Learning
- Optimization based DC programming and DCA for hierarchical clustering
- Prior Learning and Convex-Concave Regularization of Binary Tomography
- The Concave-Convex Procedure
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Cited in
(16)- Community structure detection for directed networks through modularity optimisation
- Efficient nonnegative matrix factorization by DC programming and DCA
- New Douglas-Rashford splitting algorithms for generalized DC programming with applications in machine learning
- DC programming and DCA: thirty years of developments
- DC approximation approach for \(\ell_0\)-minimization in compressed sensing
- Simplified energy landscape for modularity using total variation
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
- Community detection in networks via nonlinear modularity eigenvectors
- DC programming and DCA for enhancing physical layer security via cooperative jamming
- DC programming and DCA for a novel resource allocation problem in emerging area of cooperative physical layer security
- Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation
- DCA for Gaussian kernel support vector machines with feature selection
- DC programming and DCA for enhancing physical layer security via relay beamforming strategies
- Open issues and recent advances in DC programming and DCA
- A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning
- Post-processing partitions to identify domains of modularity optimization
This page was built for publication: A DC Programming Approach for Finding Communities in Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5383809)
