Fairness-aware Maximal Biclique Enumeration on Bipartite Graphs

by   Ziqi Yin, et al.

Maximal biclique enumeration is a fundamental problem in bipartite graph data analysis. Existing biclique enumeration methods mainly focus on non-attributed bipartite graphs and also ignore the fairness of graph attributes. In this paper, we introduce the concept of fairness into the biclique model for the first time and study the problem of fairness-aware biclique enumeration. Specifically, we propose two fairness-aware biclique models, called  and  respectively. To efficiently enumerate all s, we first present two non-trivial pruning techniques, called fair α-β core pruning and colorful fair α-β core pruning, to reduce the graph size without losing accuracy. Then, we develop a branch and bound algorithm, called , to enumerate all single-side fair bicliques on the reduced bipartite graph. To further improve the efficiency, we propose an efficient branch and bound algorithm with a carefully-designed combinatorial enumeration technique. Note that all of our techniques can also be extended to enumerate all bi-side fair bicliques. We also extend the two fairness-aware biclique models by constraining the ratio of the number of vertices of each attribute to the total number of vertices and present corresponding enumeration algorithms. Extensive experimental results on five large real-world datasets demonstrate our methods' efficiency, effectiveness, and scalability.


Fairness-aware Maximal Clique Enumeration

Cohesive subgraph mining on attributed graphs is a fundamental problem i...

Efficient Algorithms for Maximal k-Biplex Enumeration

Mining maximal subgraphs with cohesive structures from a bipartite graph...

Scaling Up Maximal k-plex Enumeration

Finding all maximal k-plexes on networks is a fundamental research probl...

Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs

Bipartite graphs model relationships between two different sets of entit...

Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach

Enumerating maximal k-biplexes (MBPs) of a bipartite graph has been used...

Fair-by-design algorithms: matching problems and beyond

In discrete search and optimization problems where the elements that may...

The KL-Divergence between a Graph Model and its Fair I-Projection as a Fairness Regularizer

Learning and reasoning over graphs is increasingly done by means of prob...

Please sign up or login with your details

Forgot password? Click here to reset