Biclique communities

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 78, Issue 1, 2008, Pages

  Lehmann, Sune ^a,b,c   Schwartz, Martin ^c,d   Hansen, Lars Kai ^c  

^a NORTHEASTERN UNIVERSITY   (United States)

^b HARVARD UNIVERSITY   (United States)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^d IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MODULAR CONSTRUCTION;

BICLIQUE; BIPARTITE NETWORKS; CLIQUE ALGORITHM; COMMUNITY DETECTION; MODULAR STRUCTURES; NODE SETS; STRUCTURAL INFORMATIONS;

SIGNAL DETECTION;

EID: 48349112329     PISSN: 15393755     EISSN: 15502376     Source Type: Journal    
DOI: 10.1103/PhysRevE.78.016108     Document Type: Article

References (41)

1. S. N. Dorogovtsev and J. F. F. Mendes, Adv. Phys. ADPHAH 0001-8732 10.1080/00018730110112519 51, 1079 (2002).
2. M. E. J. Newman, A.-L. Barabási, and D. J. Watts, The Structure and Dynamics of Networks (Princeton University Press, Princeton, 2006).
3. G. Caldarelli, Scale-Free Networks, Complex Webs in Nature and Technology (Oxford University Press, Oxford, 2007).
4. M. E. J. Newman, Eur. Phys. J. B EPJBFY 1434-6028 10.1140/epjb/e2004- 00124-y 38, 321 (2004).
5. L. Danon, J. Duch, A. Diaz-Guilera, and A. Arenas, J. Stat. Mech.: Theory Exp. ZZZZZZ 1742-5468 2005, P09008.
6. M. E. J. Newman and M. Girvan, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.69.026113 69, 026113 (2004).
7. G. Palla, I. Derényi, I. Farkas, and T. Vicsek, Nature (London) NATUAS 0028-0836 10.1038/nature03607 435, 814 (2005).
8. G. Palla, A.-L. Barabási, and T. Vicsek, Nature (London) NATUAS 0028-0836 10.1038/nature05670 446, 664 (2007).
9. I. S. Dhillon, in Knowledge Discovery and Data Mining, 2001 (unpublished), pp. 269.
10. J. Sinkkonen, J. Nikkila, L. Lahti, and S. Kaski, Helsinki University of Technology, Espoo, Finland, Technical Report No. A68, 2003 (unpublished).
11. C. Ding, Y. Zhang, T. Li, and S. R. Holbrook, in Proceedings of the Sixth IEEE International Conference on Data Mining (ICDM'06), 2006 (unpublished), p. 178.
12. D. Reiss, N. Baliga, and R. Bonneau, BMC Bioinf. BBMIC4 1471-2105 7, 280 (2006).
13. R. Guimera, M. Sales-Pardo, and L. A. N. Amaral, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.76.036102 76, 036102 (2007).
14. M. J. Barber, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.76.066102 76, 066102 (2007).
15. P. Zhang, J. Wang, X. Li, Z. Di, and Y. Fan, e-print arXiv:physics/0710. 0117.
16. M. E. J. Newman, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.64.016132 64, 016131 (2001).
17. M. E. J. Newman, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.64.016131 64, 016132 (2001).
18. R. Guimera, B. Uzzi, J. Spiro, and L. A. N. Amaral, Science SCIEAS 0036-8075 10.1126/science.1106340 308, 697 (2005).
19. Internet Movie Database, http://www.imdb.com/
20. Netflix, http://www.netflix.com/
21. Last Fm, http://www.last.fm/
22. R. Lambiotte and M. Ausloos, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.72.066107 72, 066107 (2005).
23. H. Jeong, B. Tombor, R. Albert, Z. Oltvai, and A.-L. Barabási, Nature (London) NATUAS 0028-0836 10.1038/35036627 407, 651 (2000).
24. K.-I. Goh, M. E. Cusick, D. Valle, B. Childs, M. Vidal, and A.-L. Barabasi, Proc. Natl. Acad. Sci. U.S.A. PNASA6 0027-8424 104, 8685 (2007).
25. M. A. Yildirim, K. I. Goh, M. E. Cusick, A.-L. Barabási, and M. Vidal, Nat. Biotechnol. NABIF9 1087-0156 10.1038/nbt1338 25, 1119 (2007).
26. Wordnet, http://wordnet.princeton.edu/
27. T. Hofmann and J. Puzicha, International Computer Science Institute, Berkeley, CA, Technical Report No. TR-98-042, 1998 (unpublished).
28. T. Hofmann and J. Puzicha, Massachusetts Institute of Technology, Technical Report No. AIM-1625, 1998 (unpublished).
29. T. Hofmann, in Proceedings of the 22nd Annual ACM SIGIR Conference on Research and Development in Information Retrieval, Berkeley, 1999 (ACM, New York, 1999).
30. In fact, most community detection methods assume that networks are unweighted and undirected, see, for example, Refs..
31. M. E. J. Newman, Proc. Natl. Acad. Sci. U.S.A. PNASA6 0027-8424 10.1073/pnas.0601602103 103, 8577 (2006).
32. In the following we will be discussing bipartite networks almost exclusively. For simplicity, we will drop the prefix "bi" and simply write "clique," when we mean "biclique," etc, when there is no danger of confusion.
33. BCFinder, A biclique detection tool. Program and instructions for use can be downloaded from the homepage. http://www2.imm.dtu.dk/~mhs/bcfinder/
34. T. Uno, M. Kiyomi, and H. Arimura, OSDM '05: Proceedings of the 1st International Workshop on Open Source Data Minig, Chicago, 2005 (ACM, New York, 2005).
35. LCM Ver. 4, http://research.nii.ac.jp/~uno/codes.htm
36. R. M. Karp, in Complexity of Computer Computations, edited by, R. E. Miller, and, J. W. Thatcher, (Plenum, San Francisco, 1972), p. 85.
37. R. Peeters, Discrete Appl. Math. DAMADU 0166-218X 131, 651 (2003).
38. G. Liu, K. S. H. Sim, and J. Li, in Lecture Notes in Computer Science (Springer, Berlin, 2006), Vol. 4081, p. 437.
39. S. Maslov and K. Sneppen, Science SCIEAS 0036-8075 10.1126/science. 1065103 296, 910 (2002).
40. arXiv Database, http://www.arxiv.org/
41. This result is accompanied by the caveat that the number of bicliques in very dense networks might not scale linearly with the number of nodes.