Mining frequent cross-graph quasi-cliques

ACM Transactions on Knowledge Discovery from Data

Volumn 2, Issue 4, 2009, Pages

  Jiang, Daxin ^a,c   Pei, Jian ^b  

^a MICROSOFT RESEARCH ASIA   (China)

^b SIMON FRASER UNIVERSITY   (Canada)

^c 4F Sigma Building ^*  (China)

Author keywords

Bioinformatics; Clique; Graph mining; Joint mining

Indexed keywords

BIOLOGICAL PROCESS; CLIQUE; CUSTOMER SEGMENTATION; DATA MINING METHODS; DATA MINING PROBLEMS; DATA SETS; EXPRESSION PATTERNS; GENE EXPRESSION DATA; GENERAL MODEL; GRAPH MINING; JOINT MINING; MULTIPLE GENES; PERFORMANCE STUDY; PRACTICAL ALGORITHMS; PROTEIN-PROTEIN INTERACTIONS; SINGLE SOURCE; SOCIAL NETWORK ANALYSIS; SYNTHETIC AND REAL DATA; WEB MINING;

BIOACTIVITY; BIOINFORMATICS; DATA MINING; ELECTRIC NETWORK ANALYSIS; GENE EXPRESSION; INFORMATION MANAGEMENT; MINING;

GRAPH THEORY;

EID: 67549083110     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1460797.1460799     Document Type: Article

References (56)

1. ABELLO, J., RESENDE, M., AND SUDARSKY, S. 2002. Massive quasi-clique detection. Proceedings of the Latin-American Symposium on Theoretical Intormatics, 598-612.
2. ALON, U., BARKAI, N., NOTTERMAN, D., GISH, K., YBARRA, S., MACK, D., AND LEVINE, A. 1999. Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide array. Proc. Natl. Acad. Sci. 96, 12, 6745-6750.
3. BADER, G. AND HOGUE, C. 2003. An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4, 1, 2.
4. BARABÁSI, A. AND ALBERT, R. 1999. Emergence of scaling in random networks. Science 286.
5. BAYADA, D., SIMPSON, R., AND JOHNSON, A. 1992. An algorithm for the multiple common subgraph problem. J. Chemi. Inform. Comput. Sci., 680-685.
6. BEISSBARTH, T., FELLENBERG, K., BRORS, B., ET AL. 2000. Processing and quality control of DNA array hybridization data. Bioinformatics 16, 1014-1022.
7. BEN-DOR, A., SHAMIR, R., AND YAKHINI, Z. 1999. Clustering gene expression patterns. J. Computati. Biol. 6, 3/4, 281-297.
8. BRAZMA, A. AND VILO, J. 2000. Minireview: Gene expression data analysis. Federation European Biochemical Societies 480, 17-24.
9. BU, D., ZHAO, Y., CAI, L., ET AL. 2003. Topological structure analysis of the protein-protein interaction network in budding yeast. Nucl. Acids Research. 31, 9, 2443-2450.
10. CHO, R., CAMPBELL, M., WINZELER, E., ET AL. 1998. A genome-wide transcriptional analysis of the mitotic cell cycle. Mole. Cell 2, 1, 65-73.
11. CHOI, K., SATTERBERG, B., LYONS, D., AND ELION, E. 1994. Ste5 tethers multiple protein kinases in the map kinase cascade required for mating in S. cerevisiae. Cell 78, 499-C512.
12. CHU, S., DERISI, J., EISEN, M., MULHOLLAND, J., BOTSTEIN, D., BROWN, P., AND HERSKOWITZ, I. 1998. The transcriptional program of sporulation in budding yeast. Science 282, 5389, 699-705.
13. DERISI, J., IYER, V., AND BROWN, P. 1997. Exploring the metabolic and genetic control of gene expression on a genomic scale. Science, 680-686.
14. DING, C., HE, X., ZHA, H., GU, M., AND SIMON, H. 2001. A min-max cut algorithm for graph partitioning and data clustering. In Proceedings of the 1st IEEE International Conference on Data Mining. 107-114.
15. DONGEN, S. 2000. Graph clustering by flow simulation. PhD Thesis, University of Utrecht, The Netherlands.
16. DZEROSKI, S. AND RAEDT, L. D. 2003. On multi relational data mining (mrdm). SIGKDD Explorations 5, 1.
17. EISEN, M., SPELLMAN, P., BROWN, P., AND BOTSTEIN, D. 1998. Cluster analysis and display of genomewide expression patterns. Proc. Natl. Acad. Sci. 95, 14863-14868.
18. ENRIGHT, A., DONGEN, S., AND OUZOUNIS, C. 2002. An efficient algorithm for large-scale detection of protein families. Nucl. Acids Resear. 30, 7, 1575-1584.
19. FALOUTSOS, C ., MCCURLEY, K., AND TOMKINS, A. 2004. Fast discovery of connection subgraphs. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD'O4).
20. GAREY, M. AND JOHNSON, D. 1979. Computers and Intractability: a Guide to The Theory of NP-Completeness. Freeman and Company, New York.
21. GASCH, A., HUANG, M., METZNER, S., BOTSTEIN, D., ELLEDGE, S., AND BROWN, P. 2001. Genomic expression responses to DNA-damaging agents and the regulatory role of the yeast ATR homolog Meclp. Mol. Biol. Cell 12, 10, 2987-3003.
22. GASCH, A., SPELLMAN, P., KAO, C., CARMEL-HAREL, O., EISEN, M., STORZ, G, BOTSTEIN, D., AND BROWN, P. 2000. Genomic expression programs in the response of yeast cells to environmental changes. Mol. Biol. Cell 11, 12, 4241-4257.
23. GAVIN, A., BOSCHE, M., KRAUSE, R., AND ET. AL. 2002. Functional organization of the yeast proteome by systematic analysis of protein complexes. Nature 415, 6868, 123-124.
24. HARTUV, E. AND SHAMIR, R. 2000. A clustering algorithm based on graph connectivity. Inform. Process. Lett. 76, 4-6, 175-181.
25. HO, Y, GRUHLER, A., HEILBUT, A., ET AL. 2002. Systematic identification of protein complexes in saccharomyces cerevisiae by mass spectrometry Nature 415, 180-183.
26. HOLDER, L., COOK, D., AND DJOKO, S. 1994. Substructure discovery in the subdue system. In Proceedings of the AAAT94 Workshop on Knowledge Discvoery in Databases (KDD'94). 359-370.
27. INOKUCHI, A., WASHIO, T, AND MOTODA, H. 2000. An apriori-based algorithm for mining frequent substructures from graph data. In Proceedings of the European Symposium on Principle of Data Mining and Knolwedge Discovery (PKDD'OO). 12-23.
28. ITO, T, TASHIRO, K., MUTA, S., OZAWA, R., CHIBA, T, NISHIZAWA, M., YAMAMOTO, K., KUHARA, S., AND SAKAKI, Y Toward a protein-protein interaction map of the budding yeast: A comprehensive system to examine twohybrid interactions in all possible combinations between the yeast proteins. Proc. Natl. Acad. Sci.
29. JEH, G. AND WIDOM, J. 2004. Mining the space of graph properties. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'04).
30. KUEAMOCHI, M. AND KARYPIS, G. 2001. Frequent subgraph discovery. In Proceedings of the International Conference on Data Mining (ICDM'01). 313-320.
31. LEE, H., HSU, A., SAJDAK, J., QIN, J., AND PAVLIDIS, P. 2004. Coexpression analysis of human genes across many microarray data sets. Genome Resear. 14, 1085-1094.
32. LYONS, D., MAHANTY, S., CHOI, K., MANANDHAR, M., AND ELION, E. 1996. The Sh3-domain protein Beml coordinates mitogen-activated protein kinase cascade activation with cell cycle control in Saccharomyces cerevisiae. Mol. Cell Biol. 16, 4095-C4106.
33. MATSUDA, M., ISHIHARA, T., AND HASHIMOTO, A. 1999. Classifying molecular sequences using a linkage graph with their pairwise similarities. Theor. Comput. Sci. 210, 2, 305-325.
34. MEWES, H., FRISHMAN, D., MAYER, K, ET AL. 2006. MIPS: Analysis and annotation of proteins from whole genomes in 2005. Nucl. Acids Resear. 34 (Supplement 1), D169-D172.
35. MOREAU, Y., AERTS, S., MOOR, B., STROOPER, B., AND DABROWSKI, M. 2003. Comparison and metaanalysis of microarray data: From the bench to the computer desk. TRENDS Genetics 19, 570-577.
36. NG, A., JORDAN, M., AND WEISS, Y. 2001. On spectral clustering: analysis and an algorithm. Adv. Neural Inform. Process. Syst. 14.
37. PAGE, D. AND CRAVEN, M. 2003. Biological applications of multi-relational data mining. SIGKDD Explor. 5, 1, 69-79.
38. PALMER, C., GIBBONS, P., AND FALOUTSOS, C. 2002. ANF: A fast and scalable tool for data mining in massive graphs. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD'O2).
39. PEI, J., JIANG, D., AND ZHANG, A. 2005. On mining cross-graph quasi-cliques. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'O5).
40. RYMON, R. 1992. Search through systematic set enumeration. In Proceedings of International Conference on Principles of Knowledge Representation Reasoning (RR'92).
41. SEGAL, E., WANG, H., AND KOLLEE, D. 2003. Discovering molecular pathways from protein interaction and gene expression data. Bioinformatics 19, i264-i272.
42. SHAMIE, R. AND SHABAN, R. 2000. Click: A clustering algorithm for gene expression analysis. In Proceedings of Intelligent Systems for Molecular Biology Conference (ISMB'00).
43. SPELLMAN, P., SHEELOCK, G, ZHANG, M., IYEE, V., ANDEES, K., EISEN, M., BEOWN, P., BOTSTEIN, D., AND FUTCHEE, B. 1998. Exploring the metabolic and genetic control of gene expression on a genomic scale. Mol. Biol. Cell 3273.
44. STUART, J., SEGAL, E., KOLLEE, D., AND KIM, S. 2003. A gene-coexpression network for global discovery of conserved genetic modules. Science 302, 249-255.
45. TAKAHASHI, Y, SATOH, Y., AND SASAKI, S. 1987. Recognition of largest common fragment among a variety of chemical structures. Analyt. Sci., 23-28.
46. TAMAYO, P., SOLNI, D., MESIEOV, J., ZHU, Q., KITAEEEWAN, S., DMITEOVSKY, E., LANDEE, E., AND GOLUB, T. 1999. Interpreting patterns of gene expression with self-organizing maps: Methods and application to hematopoietic differentiation. Proc. Natl. Acad. Sci. 96, 6, 2907-2912.
47. TAVAZOIE, S., HUGHES, D., CAMPBELL, M., CHO, R., AND CHURCH, G 1999. Systematic determination of genetic network architecture. Nature Genet. 281-285.
48. TONG, A. H., EVANGELISTA, M., PAESONS, A. B., AND ET AL. 2001. Systematic genetic analysis with ordered arrays of yeast deletion mutants. Science 294, 2364-2368.
49. TONG, A. H. Y, LESAGE, G., BADEE, G. D., AND ET AL. 2004. Global mapping of the yeast genetic interaction network. Science 303, 808-813.
50. TSENG, G., OH, M., ROHLIN, L., LIAO, J., AND WONG, W 2001. Issues in cDNA microarray analysis: Quality filtering, channel normalization, models of variations and assessment of gene effects. Nucleic Acids Resear. 29, 2549-2557.
51. UETZ, P., GIOT, L., CAGNEY, G., AND ET. AL. 2000. A comprehensive analysis of protein-protein interactions in Saccharomyces Cerevisiae. Nature 403 , 6770, 601-603.
52. WANG, C., WANG, W, PEI, J., ZHU, Y, AND SHI, B. 2004. Scalable mining of large disk-based graph databases. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'O4).
53. XU, Y, OLMAN, V., AND XU, D. 2002. Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees. Bioinformatics 18, 536-545.
54. YAN, X. AND HAN, J. 2000. gspan: Graph-based substructure pattern mining. In Proceedings of the International Conference on Data Mining (ICDM'O2).
55. YAN, X. AND HAN, J. 2003. Closegraph: Mining closed frequent graph patterns. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'O3).
56. YAN, X., Yu, P., AND HAN, J. 2004. Graph indexing: A frequent structure-based approach. In Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data (SIG-MOD'O4).