On Fast Enumeration of Pseudo Bicliques
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.
Unable to display preview. Download preview PDF.
- 2.Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. In: Proceedings of the 31st Conference on VLDB (2006)Google Scholar
- 3.Dhillon, I.S., Mallela, S., Modha, D.S.: Information-theoretic co-clustering. In: Proceedings of the 9th ACM SIGKDD (2003)Google Scholar
- 5.Li, J., Sim, K., Liu, G., Wong, L.: Maximal quasi-bicliques with balanced noise tolerance: Concepts and co-clustering applications. In: Proceedings of SDM 2008 (2008)Google Scholar