• Corpus ID: 235727804

Augmented Sparsifiers for Generalized Hypergraph Cuts with Applications to Decomposable Submodular Function Minimization

  title={Augmented Sparsifiers for Generalized Hypergraph Cuts with Applications to Decomposable Submodular Function Minimization},
  author={Austin R. Benson and Jon M. Kleinberg and Nate Veldt},
In recent years, hypergraph generalizations of many graph cut problems and algorithms have been introduced and analyzed as a way to better explore and understand complex systems and datasets characterized by multiway relationships. The standard cut function for a hypergraph H = (V, E) assigns the same penalty to a cut hyperedge, regardless of how its nodes are separated by a partition of V . Recent work in theoretical computer science and machine learning has made use of a generalized… 

Figures and Tables from this paper


Decomposable Submodular Function Minimization via Maximum Flow
This paper bridges discrete and continuous optimization approaches for decomposable submodular function minimization, in both the standard and parametric settings. We provide improved running times
Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances
New randomized algorithms with improved runtimes for solving linear programs with two-sided constraints with dynamic data structures for efficiently maintaining approximations to variants of Lewis-weights, a fundamental importance measure for matrices which generalize leverage scores and effective resistances are provided.
Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning
A new diffusion-based hypergraph clustering algorithm that solves a quadratic hypergraph cut based objective akin to a hypergraph analog of Andersen-Chung-Lang personalized PageRank clustering for graphs is proposed and it is proved that, for graphs with fixed maximum hyperedge size, this method is strongly local, meaning that its runtime only depends on the size of the output instead of thesize of the hypergraph and is highly scalable.
Hypergraph clustering by iteratively reweighted modularity maximization
A null model for graphs generated by hypergraph reduction is introduced and its equivalence to the configuration model for undirected graphs is proved and the proposed graph reduction technique preserves the node degree sequence from the original hypergraph.
Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs
This work introduces the first constant-factor approximation for bicluster deletion, the task of removing a minimum number of edges to partition a bipartite graph into disjoint bi-cliques, and highlights the flexibility of the framework and the diversity of results that can be obtained in different parameter settings.
Minimizing Localized Ratio Cut Objectives in Hypergraphs
This work presents a framework for local hypergraph clustering based on minimizing localized ratio cut objectives and uses it to effectively identify clusters in hypergraphs of real-world data with millions of nodes, millions of hyperedges, and large average hyperedge size with runtimes ranging between a few seconds and a few minutes.
A simple bipartite graph projection model for clustering in networks
A random graph model is proposed and analyzed to study what properties the authors can expect from the projection step, and it is shown that common network properties such as sparsity, heavy-tailed degree distributions, local clustering at nodes, the inverse relationship between node degree, and global transitivity can be explained and analyzed through this simple model.
Hypergraph Cuts with General Splitting Functions
This work develops a framework for hypergraph cuts by considering the problem of separating two terminal nodes in a hypergraph in a way that minimizes a sum of penalties at split hyperedges, and identifies a natural class of cardinality-based hyperedge splitting functions that depend only on the number of nodes on each side of the split.
Graph Clustering in All Parameter Regimes
Resolution parameters in graph clustering represent a size and quality trade-off. We address the task of efficiently solving a parameterized graph clustering objective for all values of a resolution
New Notions and Constructions of Sparsification for Graphs and Hypergraphs
A weaker notion of sparsification is studied, in which the number of cut edges in each cut (S, S) is not approximated within a multiplicative factor (1+ε), but is, instead, approximated up to an additive term bounded by ε times d⋅|S| + vol (S), where d is the average degree of the graph andVol (S) is the sum of the degrees of the vertices in S.