On fast enumeration of pseudo bicliques

Authors:
Zareen Alamgir;Saira Karim;Syed Husnine
Affiliations:
National University of Computer and Emerging Sciences, Lahore, Pakistan;National University of Computer and Emerging Sciences, Lahore, Pakistan;National University of Computer and Emerging Sciences, Lahore, Pakistan
Venue:
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Year:
2010

Citing 6
Cited 0

Reverse search for enumeration

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Massive Quasi-Clique Detection

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Information-theoretic co-clustering

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
A New Conceptual Clustering Framework

Machine Learning
Discovering large dense subgraphs in massive graphs

VLDB '05 Proceedings of the 31st international conference on Very large data bases
An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem

Algorithmica - Special Issue: Algorithms and Computation; Guest Editor: Takeshi Tokuyama

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pseudo bicliques relax the rigid connectivity requirement of bicliques to effectively deal with missing data. In this paper, we propose an algorithm based on reverse search to generate all pseudo bicliques in a given graph. We introduce various enhancements to our algorithm based on the structure of pseudo bicliques and underlying bipartite graph. We perform composite analysis using theoretical bounds and computational experiments, to show that these improvements significantly reduce the running time of our algorithm. Our algorithm is optimal in the sense that it takes average linear time to generate each pseudo biclique.