A DC Programming Approach for Finding Communities in Networks

DOI10.1162/NECO_a_00673zbMath1415.68168OpenAlexW1984754588WikidataQ51034218 ScholiaQ51034218MaRDI QIDQ5383809

Tao Pham Dinh, Hoai An Le Thi, Manh Cuong Nguyen

Publication date: 20 June 2019

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/neco_a_00673

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (10)

A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning ⋮ Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model ⋮ DC programming and DCA for enhancing physical layer security via cooperative jamming ⋮ Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation ⋮ Open issues and recent advances in DC programming and DCA ⋮ Efficient Nonnegative Matrix Factorization by DC Programming and DCA ⋮ DC programming and DCA for enhancing physical layer security via relay beamforming strategies ⋮ DC programming and DCA: thirty years of developments ⋮ DC Approximation Approach for ℓ0-minimization in Compressed Sensing ⋮ DC Programming and DCA for a Novel Resource Allocation Problem in Emerging Area of Cooperative Physical Layer Security

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Community detection by modularity maximization using GRASP with path relinking
• Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
• Modularity-maximizing graph communities via mathematical programming
• Finding community structures in complex networks using mixed integer optimisation
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A new efficient algorithm based on DC programming and DCA for clustering
• Binary classification via spherical separator by DC programming and DCA
• A DC programming approach for feature selection in support vector machines learning
• Optimization based DC programming and DCA for hierarchical clustering
• Learning sparse classifiers with difference of convex functions algorithms
• Prior Learning and Convex-Concave Regularization of Binary Tomography
• On Finding Graph Clusterings with Maximum Modularity
• A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• The Concave-Convex Procedure
• On ψ-Learning
• Fast unfolding of communities in large networks
• Computing Communities in Large Networks Using Random Walks
• Multilevel local search algorithms for modularity clustering
• Multicategory ψ-Learning
• Networks

This page was built for publication: A DC Programming Approach for Finding Communities in Networks