A method based on total variation for network modularity optimization using the MBO scheme
From MaRDI portal
(Redirected from Publication:5408787)
Abstract: The study of network structure is pervasive in sociology, biology, computer science, and many other disciplines. One of the most important areas of network science is the algorithmic detection of cohesive groups of nodes called "communities". One popular approach to find communities is to maximize a quality function known as {em modularity} to achieve some sort of optimal clustering of nodes. In this paper, we interpret the modularity function from a novel perspective: we reformulate modularity optimization as a minimization problem of an energy functional that consists of a total variation term and an balance term. By employing numerical techniques from image processing and compressive sensing -- such as convex splitting and the Merriman-Bence-Osher (MBO) scheme -- we develop a variational algorithm for the minimization problem. We present our computational results using both synthetic benchmark networks and real data.
Recommendations
- Simplified energy landscape for modularity using total variation
- Total variation based community detection using a nonlinear optimization approach
- Using graph partitioning for efficient network modularity optimization
- Community detection via an efficient nonconvex optimization approach based on modularity
- Revealing network communities with a nonlinear programming method
Cited in
(24)- Consistency of modularity clustering on random geometric graphs
- Variational community partition with novel network structure centrality prior
- Graph MBO on star graphs and regular trees. With corrections to DOI 10.1007/s00032-014-0216-8
- An MBO scheme for minimizing the graph Ohta-Kawasaki functional
- Stochastic block models are a discrete surface tension
- From graph cuts to isoperimetric inequalities: convergence rates of Cheeger cuts on data clouds
- Mean curvature, threshold dynamics, and phase field theory on finite graphs
- Convergence of the graph Allen-Cahn scheme
- Representation of functions on big data associated with directed graphs
- Sparse representation on graphs by tight wavelet frames and applications
- Proximal gradient methods for general smooth graph total variation model in unsupervised learning
- Diffuse interface models on graphs for classification of high dimensional data
- Generalizing diffuse interface methods on graphs: nonsmooth potentials and hypergraphs
- Community detection in networks via nonlinear modularity eigenvectors
- Simplified energy landscape for modularity using total variation
- Mumford-Shah functionals on graphs and their asymptotics
- Total variation based community detection using a nonlinear optimization approach
- Modified Cheeger and ratio cut methods using the Ginzburg–Landau functional for classification of high-dimensional data
- Segmentation in Measure Spaces
- Batch active learning for multispectral and hyperspectral image segmentation using similarity graphs
- The Potts model with different piecewise constant representations and fast algorithms: a survey
- On the existence of solutions to adversarial training in multiclass classification
- An MBO method for modularity optimisation based on total variation and signless total variation
- Global binary optimization on graphs for classification of high-dimensional data
This page was built for publication: A method based on total variation for network modularity optimization using the MBO scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408787)
