Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
From MaRDI portal
Publication:5883297
DOI10.1137/20M1333055OpenAlexW4319662821MaRDI QIDQ5883297
No author found.
Publication date: 30 March 2023
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.09608
Programming involving graphs or networks (90C35) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30) Computer science (68-XX)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Statistical ranking using the \(\ell^{1}\)-norm on graphs
- Random walks and local cuts in graphs
- Maximum flows and minimum cuts in the plane
- Computing heat kernel PageRank and a local clustering algorithm
- Auction dynamics: a volume constrained MBO scheme
- Variational perspective on local graph clustering
- A data structure for dynamic trees
- Least angle regression. (With discussion)
- A combined evolutionary search and multilevel optimisation approach to graph-partitioning
- Network analysis. Methodological foundations.
- Efficient graph-based image segmentation
- Diffuse Interface Models on Graphs for Classification of High Dimensional Data
- PageRank Beyond the Web
- Opinion Dynamics and the Evolution of Social Power in Influence Networks
- Communicability Angle and the Spatial Efficiency of Networks
- A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
- Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty
- Relax, No Need to Round
- Network Properties Revealed through Matrix Functions
- Engineering Multilevel Graph Partitioning Algorithms
- Beyond the flow decomposition barrier
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Almost Optimal Local Graph Clustering Using Evolving Sets
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- The maximum concurrent flow problem
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Maximal flow through a domain
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
- Community Detection and Stochastic Block Models
- Multistate Dynamical Processes on Networks: Analysis through Degree-Based Approximation Frameworks
- Configuring Random Graph Models with Fixed Degree Sequences
- Clustering Objects on Subsets of Attributes (with Discussion)
- A Fast Parametric Maximum Flow Algorithm and Applications
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- A Matrix Iteration for Dynamic Network Summaries
- Hypergraph Cuts with General Splitting Functions
- Faster energy maximization for faster maximum flow
- Semi-Supervised Learning in Network-Structured Data via Total Variation Minimization
- Dynamics over Signed Networks
- Network Modularity in the Presence of Covariates
- Fast unfolding of communities in large networks
- A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant
- Core-Periphery Structure in Networks (Revisited)
- Network Flow Algorithms
- Flow-Based Algorithms for Local Graph Clustering
- A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
- Euclidean Distance Geometry and Applications
- Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator
- Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
- Overlapping community detection in networks
- A new approach to computing maximum flows using electrical flows
- Max flows in O(nm) time, or better
- On Nonlinear Fractional Programming
- An r-Dimensional Quadratic Placement Algorithm
- Integer Programming and Combinatorial Optimization
- Expander flows, geometric embeddings and graph partitioning
- Graph partitioning using single commodity flows
- Networks
- ILP-Based Local Search for Graph Partitioning
This page was built for publication: Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
