Fast cluster detection in networks by first order optimization
From MaRDI portal
Publication:5065475
Numerical mathematical programming methods (65K05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Abstract: Cluster detection plays a fundamental role in the analysis of data. In this paper, we focus on the use of s-defective clique models for network-based cluster detection and propose a nonlinear optimization approach that efficiently handles those models in practice. In particular, we introduce an equivalent continuous formulation for the problem under analysis, and we analyze some tailored variants of the Frank-Wolfe algorithm that enable us to quickly find maximal s-defective cliques. The good practical behavior of those algorithmic tools, which is closely connected to their support identification properties, makes them very appealing in practical applications. The reported numerical results clearly show the effectiveness of the proposed approach.
Recommendations
- Continuous cubic formulations for cluster detection problems in networks
- Total variation based community detection using a nonlinear optimization approach
- A fast and efficient algorithm to identify clusters in networks
- Revealing network communities with a nonlinear programming method
- Optimization via low-rank approximation for community detection in networks
Cites work
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 956839 (Why is no real title available?)
- A complementary pivoting approach to the maximum weight clique problem
- A general regularized continuous formulation for the maximum clique problem
- A review on algorithms for maximum clique problems
- Active set complexity of the away-step Frank-Wolfe algorithm
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- An extended Frank-Wolfe method with ``in-face directions, and its application to low-rank matrix completion
- Computing maximum \(k\)-defective cliques in massive graphs
- Continuous cubic formulations for cluster detection problems in networks
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Evolution towards the maximum clique
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
- First-order methods almost always avoid strict saddle points
- Genetic engineering via negative fitness: Evolutionary dynamics for global optimization
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Nonlinear programming
- On clique relaxation models in network analysis
- On copositive programming and standard quadratic optimization problems
- On standard quadratic optimization problems
- Proofs from THE BOOK
- Regularity versus Degeneracy in Dynamics, Games, and Optimization: A Unified Approach to Different Aspects
- Some comments on Wolfe's ‘away step’
- The largest eigenvalue of a graph: A survey
Cited in
(4)- Continuous cubic formulations for cluster detection problems in networks
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
- Finite convergence of sum-of-squares hierarchies for the stability number of a graph
- scientific article; zbMATH DE number 5556003 (Why is no real title available?)
This page was built for publication: Fast cluster detection in networks by first order optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5065475)
