Advertisement

On Fast Enumeration of Pseudo Bicliques

  • Zareen Alamgir
  • Saira Karim
  • Syed Husnine
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6460)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Applied Mathematics 65, 21–46 (1996)CrossRefzbMATHGoogle Scholar
  2. 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. 3.
    Dhillon, I.S., Mallela, S., Modha, D.S.: Information-theoretic co-clustering. In: Proceedings of the 9th ACM SIGKDD (2003)Google Scholar
  4. 4.
    Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, p. 598. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 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
  6. 6.
    Mishra, N., Ron, D., Swaminathan, R.: A new conceptual clustering framework. Machine Learning 56, 115–151 (2004)CrossRefzbMATHGoogle Scholar
  7. 7.
    Uno, T.: An efficient algorithm for solving pseudo clique enumeration problem. Algorithmica 56, 3–16 (2010)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Zareen Alamgir
    • 1
  • Saira Karim
    • 1
  • Syed Husnine
    • 1
  1. 1.National University of Computer and Emerging SciencesLahorePakistan

Personalised recommendations