An Efficient Quadratic Penalty Method for a Class of Graph Clustering Problems

Abstract

Community-based graph clustering is one of the most popular topics in the analysis of complex social networks. This type of clustering involves grouping vertices that are considered to share more connections, whereas vertices in different groups share fewer connections. A successful clustering result forms densely connected induced subgraphs. This paper studies a specific form of graph clustering problems that can be formulated as semi-assignment problems, where the objective function exhibits block properties. We reformulate these problems as sparse-constrained optimization problems and relax them to continuous optimization models. We then apply the quadratic penalty method and the quadratic penalty regularized method to the relaxation problem, respectively. Extensive numerical experiments demonstrate that both methods effectively solve graph clustering tasks for both synthetic and real-world network datasets. For small-scale problems, the quadratic penalty regularized method demonstrates greater efficiency, whereas the quadratic penalty method proves more suitable for large-scale cases.

30 pages, 6 figures, submitted to Optimization and Engineering

References in corpus (15)

• Community structure in social and biological networks
• Finding and evaluating community structure in networks
• Community detection in graphs
• Resolution limit in community detection
• Analysis of weighted networks
• Community detection in networks: A user guide
• The performance of modularity maximization in practical contexts
• Narrow scope for resolution-limit-free community detection
• A Bayesian Approach to Network Modularity
• A Method to Find Community Structures Based on Information Centrality
• Local resolution-limit-free Potts model for community detection
• Think Locally, Act Locally: The Detection of Small, Medium-Sized, and Large Communities in Large Networks
• On Proximity and Structural Role-based Embeddings in Networks: Misconceptions, Techniques, and Applications
• Identifying Banking Transaction Descriptions via Support Vector Machine Short-Text Classification Based on a Specialized Labelled Corpus
• Graph clustering with Boltzmann machines