Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs

02/21/2020
by   Nate Veldt, et al.
0

Graph clustering objective functions with tunable resolution parameters make it possible to detect different types of clustering structure in the same graph. These objectives also provide a unifying view of other non-parametric objectives, which often can be captured as special cases. Previous research has largely focused on parametric objectives for standard graphs, in which all nodes are of the same type, and edges model pairwise relationships. In our work, we introduced parameterized objective functions and approximation algorithms specifically for clustering bipartite graphs and hypergraphs, based on correlation clustering. This enables us to develop principled approaches for clustering datasets with different node types (bipartite graphs) or multiway relationships (hypergraphs). Our hypergraph objective is related to higher-order notions of modularity and normalized cut, and is amenable to approximation algorithms via hypergraph expansion techniques. Our bipartite objective generalizes standard bipartite correlation clustering, and in a certain parameter regime is equivalent to bicluster deletion, i.e., removing a minimum number of edges to separate a bipartite graph into disjoint bicliques. The problem in general is NP-hard, but we show that in a certain parameter regime it is equivalent to a bipartite matching problem, meaning that it is polynomial time solvable in this regime. For other regimes, we provide approximation guarantees based on LP-rounding. Our results include the first constant factor approximation algorithm for bicluster deletion. We illustrate the flexibility of our framework in several experiments. This includes clustering a food web and an email network based on higher-order motif structure, detecting clusters of retail products in product review hypergraph, and evaluating our algorithms across a range of parameter settings on several real world bipartite graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/15/2017

Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering

We present and analyze a new framework for graph clustering based on a s...
research
10/14/2019

Graph Clustering in All Parameter Regimes

Resolution parameters in graph clustering represent a size and quality t...
research
02/09/2023

Partial Optimality in Cubic Correlation Clustering

The higher-order correlation clustering problem is an expressive model, ...
research
06/08/2023

Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling

Graph clustering is a fundamental task in network analysis where the goa...
research
10/22/2019

Hypergraph clustering with categorical edge labels

Graphs and networks are a standard model for describing data or systems ...
research
11/05/2018

Motif and Hypergraph Correlation Clustering

Motivated by applications in social and biological network analysis, we ...
research
01/24/2021

Generative hypergraph clustering: from blockmodels to modularity

Hypergraphs are a natural modeling paradigm for a wide range of complex ...

Please sign up or login with your details

Forgot password? Click here to reset