1. E. Georgii, S. Dietmann, T. Uno, P. Pagel, K. Tsuda, Enumeration of condition-dependent dense modules in protein interaction networks. Bioinformatics 25(7), 933–940 (2009).
2. E.A. Akkoyunlu, The enumeration of maximal cliques of large graphs. SIAM J. Comput. 2(1), 1–6 (1973).
3. E. Georgii, K. Tsuda, B. Schölkopf, Multi-way set enumeration in real-valued tensors, in DMMT ’09: Proceedings of the 2nd Workshop on Data Mining using Matrices and Tensors, ACM, pp. 32–41 (Article No. 4), 2009.
4. E. Georgii, K. Tsuda, B. Schölkopf, Multi-way set enumeration in weight tensors. Mach. Learn. 82, 123–155 (2011).
5. X. Yan, J. Han, gSpan: graph-based substructure pattern mining, in ICDM ’02: Proceedings of the 2nd IEEE International Conference on Data Mining, IEEE Computer Society, pp. 721–724, 2002.
6. M. Kuramochi, G. Karypis, An efficient algorithm for discovering frequent subgraphs. IEEE Trans. Knowl. Data Eng. 16(9), 1038–1051 (2004).
7. S. Kramer, L. De Raedt, C. Helma, Molecular feature mining in HIV data, in KDD ’01: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 136–143, 2001.
8. H. Hu, X. Yan, Y. Huang, J. Han, X.J. Zhou, Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics 21(Suppl. 1), i213–i221 (2005).
9. X. Yan, X.J. Zhou, J. Han, Mining closed relational graphs with connectivity constraints, in KDD ’05: Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 324–333, 2005.
10. M. Kuramochi, G. Karypis, Finding frequent patterns in a large sparse graph. Data Min. Knowl. Discov. 11(3), 243–271 (2005).
11. R.M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, Plenum Press, pp. 85–103, 1972.
12. V. Spirin, L.A. Mirny, Protein complexes and functional modules in molecular networks. Proc. Natl. Acad. Sci. U.S.A. 100(21), 12123–12128 (2003).
13. G. Palla, I. Derenyi, I. Farkas, T. Vicsek, Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005).
14. J. Pei, D. Jiang, A. Zhang, Mining cross-graph quasi-cliques in gene expression and protein interaction data, in ICDE ’05: Proceedings of the 21st International Conference on Data Engineering, IEEE Computer Society, pp. 353–354, 2005.
15. Z. Zeng, J. Wang, L. Zhou, G. Karypis, Coherent closed quasi-clique discovery from large dense graph databases, in KDD ’06: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 797–802, 2006.
16. G. Liu, L. Wong, Effective pruning techniques for mining quasi-cliques, in ECML PKDD ’08: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases –Part II, Springer, pp. 33–49, 2008.
17. D. Jiang, J. Pei, Mining frequent cross-graph quasi-cliques. ACM Trans. Knowl. Discov. Data 2(4), 1–42 (2009).
18. T. Uno, An efficient algorithm for enumerating pseudo cliques, in Algorithms and Computation, Proceedings of the 18th International Symposium (ISAAC 2007), pp. 402–414, 2007.
19. Y. Asahiro, R. Hassin, K. Iwama, Complexity of finding dense subgraphs. Discrete Appl. Math. 121(1–3), 15–26 (2002).
20. Y. Asahiro, K. Iwama, H. Tamaki, T. Tokuyama, Greedily finding a dense subgraph. J. Algorithms 34(2), 203–221 (2000).
21. M. Charikar, Greedy approximation algorithms for finding dense components in a graph, in APPROX ’00: Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization, Springer, pp. 84–95, 2000.
22. U. Feige, G. Kortsarz, D. Peleg, The dense k-subgraph problem. Algorithmica 29(3), 59–78 (2001).
23. G.F. Georgakopoulos, K. Politopoulos, MAX-DENSITY revisited: a generalization and a more efficient algorithm. Comput. J. 50(3), 348–356 (2007).
24. L. Everett, L.S. Wang, S. Hannenhalli, Dense subgraph computation via stochastic search: application to detect transcriptional modules. Bioinformatics 22(14), e117–e123 (2006).
25. G.D. Bader, C.W. Hogue, An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinform. 4, 2 (2003).
26. M.T. Dittrich, G.W. Klau, A. Rosenwald, T. Dandekar, T.Müller, Identifying functional modules in protein–protein interaction networks: an integrated exact approach. Bioinformatics 24(13), i223–i231 (2008).
27. C. Faloutsos, K.S. McCurley, A. Tomkins, Fast discovery of connection subgraphs, in KDD ’04: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 118–127, 2004.
28. S.E. Schaeffer, Graph clustering. Comput. Sci. Rev. 1(1), 27–64 (2007).
29. B.W. Kernighan, S. Lin, An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(1), 291–307 (1970).
30. A. Clauset, M.E.J. Newman, C. Moore, Finding community structure in very large networks. Phys. Rev. E 70(6), 066111 (2004).
31. J. Hopcroft, O. Khan, B. Kulis, B. Selman, Natural communities in large linked networks, in KDD ’03: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 541–546, 2003.
32. A.W. Rives, T. Galitski, Modular organization of cellular networks. Proc. Natl. Acad. Sci. U.S.A. 100(3), 1128–1133 (2003).
33. T. Yamada, M. Kanehisa, S. Goto, Extraction of phylogenetic network modules from the metabolic network. BMC Bioinform. 7, 130 (2006).
34. E. Hartuv, R. Shamir, A clustering algorithm based on graph connectivity. Inform. Process. Lett. 76, 175–181 (1999).
35. M. Girvan, M.E. Newman, Community structure in social and biological networks. Proc. Natl. Acad. Sci. U.S.A. 99(12), 7821–7826 (2002).
36. J. Chen, B. Yuan, Detecting functional modules in the yeast protein–protein interaction network. Bioinformatics 22(18), 2283–2290 (2006).
37. F. Luo, Y. Yang, C.-F. Chen, R. Chang, J. Zhou, R.H. Scheuermann, Modular organization of protein interaction networks. Bioinformatics 23(2), 207–214 (2007).
38. J.W. Pinney, D.R. Westhead, Betweenness-based decomposition methods for social and biological networks, in Interdisciplinary Statistics and Bioinformatics, Leeds University Press, Leeds, pp. 87–90, 2006.
39. M.E. Newman, Modularity and community structure in networks. Proc. Natl. Acad. Sci. U.S.A 103(23), 8577–8582 (2006).
40. G. Karypis, V. Kumar, Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48, 96–129 (1998).
41. D. Medini, A. Covacci, C. Donati, Protein homology network families reveal step-wise diversification of type III and type IV secretion systems. PLoS Comput. Biol. 2(12) (2006).
42. U. von Luxburg, A tutorial on spectral clustering. Stat. Comput. 17(4), 395–416 (2007).
43. S. van Dongen, Graph Clustering by Flow Simulation, PhD thesis, University of Utrecht, 2000.
44. A.J. Enright, S. van Dongen, C.A. Ouzounis, An efficient algorithm for large-scale detection of protein families. Nucleic Acids Res. 30(7), 1575–1584 (2002).
45. E. Segal, H. Wang, D. Koller, Discovering molecular pathways from protein interaction and gene expression data. Bioinformatics 19(Suppl. 1), i264–i271 (2003).
46. W. Chu, Z. Ghahramani, R. Krause, D.L. Wild, Identifying protein complexes in high-throughput protein interaction screens using an infinite latent feature model, in Proceedings of the Pacific Symposium on Biocomputing, pp. 231–242, 2006.
47. J.A. Parkkinen, S. Kaski, Searching for functional gene modules with interaction component models. BMC Syst. Biol. 4, 4 (2010).
48. D. Hanisch, A. Zien, R. Zimmer, T. Lengauer, Co-clustering of biological networks and gene expression data. Bioinformatics 18(Suppl. 1), S145–S154 (2002).
49. A. Tanay, R. Sharan, M. Kupiec, R. Shamir, Revealing modularity and organization in the yeast molecular network by integrated analysis of highly heterogeneous genomewide data. Proc. Natl. Acad. Sci. U.S.A. 101(9), 2981–2986 (2004).
50. I. Ulitsky, R. Shamir, Identification of functional modules using network topology and high-throughput data. BMC Syst. Biol. 1, 8 (2007).
51. I. Ulitsky, R. Shamir, Identifying functional modules using expression profiles and confidence-scored protein interactions. Bioinformatics 25(9), 1158–1164 (2009).
52. T. Ideker, O. Ozier, B. Schwikowski, A.F. Siegel, Discovering regulatory and signalling circuits in molecular interaction networks. Bioinformatics 18(Suppl. 1), S233–S240 (2002).
53. Y. Huang, H. Li, H. Hu, X. Yan, M.S. Waterman, H. Huang, X.J. Zhou, Systematic discovery of functional modules and context-specific functional annotation of human genome. Bioinformatics 23(13), i222–i229 (2007).
54. X. Yan, M.R. Mehan, Y. Huang, M.S. Waterman, P.S. Yu, X.J. Zhou, A graph-based approach to systematically reconstruct human transcriptional regulatory modules. Bioinformatics 23(13), i577–i586 (2007).
55. S.C. Madeira, A.L. Oliveira, Biclustering algorithms for biological data analysis: A survey. IEEE/ACM Trans. Comput. Biol. Bioinform. 1(1), 24–45 (2004).
56. A. Preli
, S. Bleuler, P. Zimmermann, A. Wille, P. Bühlmann, W. Gruissem, L. Hennig, L. Thiele, E. Zitzler, A systematic comparison and evaluation of biclustering methods for gene expression data. Bioinformatics 22(9), 1122–1129 (2006).
57. A. Tanay, R. Sharan, R. Shamir, Biclustering algorithms: a survey, in Handbook of Computational Molecular Biology, Chapman and Hall, 2005.
58. G. Li, Q. Ma, H. Tang, A.H. Paterson, Y. Xu, QUBIC: a qualitative biclustering algorithm for analyses of gene expression data. Nucl. Acids Res. 37(15), e101 (2009).
59. I. Van Mechelen, H.H. Bock, P. De Boeck, Two-mode clustering methods: a structured overview. Stat. Methods Med. Res. 13(5), 363–394 (2004).
60. D. Jiang, C. Tang, A. Zhang, Cluster analysis for gene expression data: a survey. IEEE Trans. Knowl. Data Eng. 16(11), 1370–1386 (2004).
61. I.S. Dhillon, Co-clustering documents and words using bipartite spectral graph partitioning, in KDD ’01: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 269–274, 2001.
62. Y. Kluger, R. Basri, J.T. Chang, M. Gerstein, Spectral biclustering of microarray data: coclustering genes and conditions. Genome Res. 13(4), 703–716 (2003).
63. L. Lazzeroni, A. Owen, Plaid models for gene expression data. Stat. Sin. 12(1), 61–86 (2002).
64. P. Wang, C. Domeniconi, K.B. Laskey, Latent dirichlet bayesian co-clustering, in ECML PKDD ’09: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases, Springer, pp. 522–537, 2009.
65. A. Tanay, R. Sharan, R. Shamir, Discovering statistically significant biclusters in gene expression data. Bioinformatics 18(Suppl. 1), S136–S144 (2002).
66. K. Sim, J. Li, V. Gopalkrishnan, G. Liu, Mining maximal quasi-bicliques to co-cluster stocks and financial ratios for value investment, in ICDM ’06: Proceedings of the 6th International Conference on Data Mining, pp. 1059–1063, 2006.
67. C. Yan, J.G. Burleigh, O. Eulenstein, Identifying optimal incomplete phylogenetic data sets from sequence databases. Mol. Phylogenet. Evol. 35(3), 528–535 (2005).
68. J. Besson, C. Robardet, L. De Raedt, J.-F. Boulicaut, Mining bi-sets in numerical data, in KDID ’06: Knowledge Discovery in Inductive Databases, 5th International Workshop, Vol. 4747, Lecture Notes in Computer Science, Springer, pp. 11–23, 2006.
69. R. Agrawal, R. Srikant, Fast algorithms for mining association rules in large databases, in VLDB ’94: Proceedings of the 20th International Conference on Very Large Data Bases, Morgan Kaufmann, pp. 487–499, 1994.
70. C. Creighton, S. Hanash, Mining gene expression databases for association rules. Bioinformatics 19(1), 79–86 (2003).
71. T. Uno, M. Kiyomi, H. Arimura, LCM ver. 2: efficient mining algorithms for frequent/closed/maximal itemsets, in FIMI ’04, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2004.
72. L. Cerf, J. Besson, C. Robardet, J.-F. Boulicaut, Data Peeler: contraint-based closed pattern mining in n-ary relations, in SDM ’08: Proceedings of the 8th SIAM International Conference on Data Mining, pp. 37–48, 2008.
73. L. Cerf, J. Besson, C. Robardet, J.-F. Boulicaut, Closed patterns meet n-ary relations. ACM Trans. Knowl. Discov. Data 3(1), 1–36 (2009).
74. R. Jäschke, A. Hotho, C. Schmitz, B. Ganter, G. Stumme, TRIAS: an algorithm for mining iceberg tri-lattices, in ICDM ’06: Proceedings of the 6th International Conference on Data Mining, IEEE Computer Society, pp. 907–911, 2006.
75. L. Ji, K.-L. Tan, A.K.H, Tung, Mining frequent closed cubes in 3D datasets, in VLDB ’06: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB Endowment, pp. 811–822, 2006.
76. T.G. Kolda, B.W. Bader, J.P. Kenny, Higher-order web link analysis using multilinear algebra, in ICDM ’05: Proceedings of the 5th IEEE International Conference on Data Mining, IEEE Computer Society, pp. 242–249, 2005.
77. E. Acar, S. Çamtepe, B. Yener, Collective sampling and analysis of high order tensors for chatroom communications, in Intelligence and Security Informatics, Springer, pp. 213–224, 2006.
78. C.F. Beckmann, S.M. Smith, Tensorial extensions of independent component analysis for multisubject FMRI analysis. Neuroimage 25(1), 294–311 (2005).
79. E. Acar, C. Aykut-Bingol, H. Bingol, R. Bro, B. Yener, Multiway analysis of epilepsy tensors. Bioinformatics 23(13), i10–i18 (2007).
80. L. Zhao, M.J. Zaki, TRICLUSTER: an effective algorithm for mining coherent clusters in 3D microarray data, in SIGMOD ’05: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, ACM, pp. 694–705, 2005.
81. S.E. Baranzini, P. Mousavi, J. Rio, S.J. Caillier, A. Stillman, P. Villoslada, M.M. Wyatt, M. Comabella, L.D. Greller, R. Somogyi, X. Montalban, J.R. Oksenberg, Transcription-based prediction of response to IFNβ using supervised computational methods. PLoS Biol. 3(1), e2 (2004).
82. T.G. Kolda, B.W. Bader, Tensor decompositions and applications. Technical Report SAND2007-6702, Sandia National Laboratories, Albuquerque, NM and Livermore, CA, November 2007.
83. T.G. Kolda, J.Sun, Scalable tensor decompositions for multi-aspect data mining, in ICDM, 2008.
84. A. Banerjee, S. Basu, S. Merugu, Multi-way clustering on relation graphs, in SDM ’07: Proceedings of the 7th SIAM International Conference on Data Mining, 2007.
85. S. Jegelka, S. Sra, A. Banerjee, Approximation algorithms for tensor clustering, in Algorithmic Learning Theory, pp. 368–383, 2009.
86. C. Kemp, J.B. Tenenbaum, T.L. Griffiths, T. Yamada, N. Ueda, Learning systems of concepts with an infinite relational model, in AAAI ’06: Proceedings of the 21st National Conference on Artificial Intelligence, AAAI Press, pp. 381–388, 2006.
87. Y.-R. Lin, J. Sun, P. Castro, R. Konuru, H. Sundaram, A. Kelliher, MetaFac: community discovery via relational hypergraph factorization, in KDD ’09: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 527–536, 2009.
88. S. Džeroski, Multi-relational data mining: an introduction. SIGKDD Explor. Newsl. 5(1), 1–16 (2003).
89. D. Avis, K. Fukuda, Reverse search for enumeration. Discrete Appl. Math. 65, 21–46 (1996).
90. R. Rymon, Search through systematic set enumeration, in Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, pp. 539–550, 1992.
91. M.J. Zaki, S. Parthasarathy, M. Ogihara, W. Li, New algorithms for fast discovery of association rules, in KDD ’97: Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining, AAAI Press, pp. 283–286, 1997.
92. R.J. Bayardo Jr., Efficiently mining long patterns from databases, in SIGMOD ’98: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, ACM, pp. 85–93, 1998.
93. F. Zhu, X. Yan, J. Han, P.S. Yu, gPrune: a constraint pushing framework for graph pattern mining, in PAKDD ’07: Proceedings of the 11th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, Springer, pp. 388–400, 2007.
94. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms, 3rd edn., The MIT Press, 2009.
95. L.A. Goldberg, Efficient algorithms for listing unlabeled graphs. J. Algorithms 13(1), 128–143 (1992).
96. L.A. Goldberg, Polynomial space polynomial delay algorithms for listing families of graphs, in STOC ’93: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, ACM, pp. 218–225, 1993.
97. J. Ramon, S. Nijssen, Polynomial-delay enumeration of monotonic graph classes. J. Mach. Learn. Res. 10, 907–929 (2009).
98. S.-I. Nakano, T. Uno, Constant time generation of trees with specified diameter, in Graph-Theoretic Concepts in Computer Science, 30th International Workshop, Vol. 3353, Lecture Notes in Computer Science, Springer, pp. 33–45, 2004.
99. D. Gunopulos, H. Mannila, S. Saluja, Discovering all most specific sentences by randomized algorithms, in ICDT ’97: Proceedings of the 6th International Conference on Database Theory, Springer, pp. 215–229, 1997.
100. D.-I. Lin, Z.M. Kedem, Pincer search: a new algorithm for discovering the maximum frequent sets, in EDBT ’98: Proceedings of the 6th International Conference on Extending Database Technology, Springer, pp. 105–119, 1998.
101. K. Gouda, M.J. Zaki, Efficiently mining maximal frequent itemsets, in ICDM ’01: Proceedings of the IEEE International Conference on Data Mining, IEEE Computer Society, pp. 163–170, 2001.
102. G. Bejerano, N. Friedman, N. Tishby, Efficient exact p-value computation for small sample, sparse, and surprising categorical data. J. Comput. Biol. 11(5), 867–886 (2004).
103. M. Koyutürk, W. Szpankowski, A. Grama, Assessing significance of connectivity and conservation in protein interaction networks. J. Comput. Biol. 14(6), 747–764 (2007).
104. H.C.M. Leung, Q. Xiang, S.M. Yiu, F.Y.L. Chin, Predicting protein complexes from PPI data: a core-attachment approach. J. Comput. Biol. 16(2), 133–144 (2009).
105. R. Sharan, T. Ideker, B. Kelley, R. Shamir, R.M. Karp, Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data. J. Comput. Biol. 12(6), 835–846 (2005).
106. M.E.J. Newman, M. Girvan, Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004).
107. C. Robardet, Constraint-based pattern mining in dynamic graphs, in ICDM ’09: Proceedings of the 9th IEEE International Conference on Data Mining, IEEE Computer Society, pp. 950–955, 2009.
108. J. Long, C. Hartman, ODES: an overlapping dense sub-graph algorithm. Bioinformatics 26(21), 2788–2789 (2010).
109. P. Dao, R. Colak, R. Salari, F. Moser, E. Davicioni, A. Schönhuth, M. Ester, Inferring cancer subnetwork markers using density-constrained biclustering. Bioinformatics 26(18), i625–i631 (2010).
110. R. Bisiani, Beam search, in Encyclopedia of Articial Intelligence, Wiley, pp. 56–58, 1987.
111. N. Mishra, D. Ron, R. Swaminathan, A new conceptual clustering framework. Mach. Learn. 56(1–3), 115–151 (2004).