Community detection via an efficient nonconvex optimization approach based on modularity
type: Item
instance of: scholarly article
title: Community detection via an efficient nonconvex optimization approach based on modularity
author: Quan Yuan
author: Binghui Liu
published in: Computational Statistics and Data Analysis
publication date: 2021-05-07T00:00:00Z
Mathematics Subject Classification ID: 62-XX
zbMATH DE Number: 7345846
zbMATH Keywords: community detection
zbMATH Keywords: DC programming
zbMATH Keywords: modularity
zbMATH Keywords: subset selection
zbMATH Keywords: truncated \(L_1\) penalty
describes a project that uses: GraphBase
MaRDI profile type: Publication
full work available at URL: j.csda.2020.107163
OpenAlex ID: W3115448423
cites work: Pseudo-likelihood methods for community detection in large sparse networks
cites work: On semidefinite relaxations for the block model
cites work: Convexified modularity maximization for degree-corrected stochastic block models
cites work: Diffusion-based method for producing density-equalizing maps
cites work: Latent Space Approaches to Social Network Analysis
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Q3140399
cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
cites work: Consistency of spectral clustering in stochastic block models
cites work: Network cross-validation by edge sampling
cites work: A novel and efficient algorithm for de novo discovery of mutated driver pathways in cancer
cites work: Likelihood-Based Selection and Sharp Parameter Estimation
cites work: Collective dynamics of ‘small-world’ networks
cites work: Estimating network edge probabilities by neighbourhood smoothing
DOI: 10.1016/J.CSDA.2020.107163
description: scientific article; zbMATH DE number 7345846