Frequent subgraph discovery in dynamic networks

Proceedings of the 8th Workshop on Mining and Learning with Graphs, MLG'10

Volumn , Issue , 2010, Pages 155-162

  Wackersreuther, Bianca ^a   Wackersreuther, Peter ^a   Oswald, Annahita ^a   Böhm, Christian ^a   Borgwardt, Karsten M ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b MPIs for Developmental Biology and Biological Cybernetics   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION DOMAINS; DATA MINING TECHNIQUES; DYNAMIC GRAPH; DYNAMIC NETWORK; EXPERIMENTAL EVALUATION; FREQUENT SUBGRAPHS; GRAPH MINING; MODEL ENTITIES; REAL-WORLD; SUBGRAPH MINING;

DATA MINING; TIME SERIES;

GRAPHIC METHODS;

EID: 77956256145     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1830252.1830272     Document Type: Conference Paper

References (22)

1. J. Aach, W. Rindone, and G. M. Church. Systematic Management and Analysis of Yeast Gene Expression Data. Genome Res., 10:431-445, Feb 2000.
2. M. Ashburner, C. A. Ball, J. A. Blake, D. Botstein, H. Butler, J. M. Cherry, A. P. Davis, K. Dolinski, S. S. Dwight, J. T. Eppig, M. A. Harris, D. P. Hill, L. Issel-Tarver, A. Kasarskis, S. Lewis, J. C. Matese, J. E. Richardson, M. Ringwald, G. M. Rubin, and G. Sherlock. Gene ontology: tool for the unification of biology. The Gene Ontology Consortium. Nat Genet., 25:25-29, 2000.
3. K. M. Borgwardt, H.-P. Kriegel, and P. Wackersreuther. Pattern Mining in Frequent Dynamic Subgraphs. In ICDM, pages 818-822, 2006.
4. R. Cho, M. Campbell, E. Winzeler, L. Steinmetz, A. Conway, L. Wodicka, T. Wolfsberg, A. Gabrielian, D. Landsman, D. Lockhart, and R. Davis. A genome-wide transcriptional analysis of the mitotic cell cycle. Mol. Cell, 2:65-73, Jul 1998.
5. D. J. Cook and L. B. Holder. Substructure Discovery Using Minimum Description Length and Background Knowledge. JAIR, 1:231-255, 1994.
6. P. Desikan and J. Srivastava. Mining Temporally Evolving Graphs. In WebKDD Workshop, 2004.
7. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
8. E. L. Hong, R. Balakrishnan, Q. Dong, K. R. Christie, J. Park, G. Binkley, M. C. Costanzo, S. S. Dwight, S. R. Engel, D. G. Fisk, J. E. Hirschman, B. C. Hitz, C. J. Krieger, M. S. Livstone, S. R. Miyasato, R. S. Nash, R. Oughtred, M. S. Skrzypek, S. Weng, E. D. Wong, K. K. Zhu, K. Dolinski, D. Botstein, and J. M. Cherry. Gene Ontology annotations at SGD: new data sources and annotation methods. Nucleic Acids Res., 36:D577-81, 2008. PMID: 17982175.
9. L. C. K. Hui. Color set size problem with application to string matching. In CPM, pages 230-243, 1992.
10. A. Inokuchi, T. Washio, and H. Motoda. Complete Mining of Frequent Patterns from Graphs: Mining Graph Data. Machine Learning, 50(3):321-354, 2003.
11. N. Kashtan, S. Itzkovitz, R. Milo, and U. Alon. Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics, 20(11):1746-1758, 2004.
12. M. Kuramochi and G. Karypis. Frequent Subgraph Discovery. In ICDM, pages 313-320, 2001.
13. M. Kuramochi and G. Karypis. Finding Frequent Patterns in a Large Sparse Graph. In SDM, 2004.
14. M. Kuramochi and G. Karypis. GREW-A Scalable Frequent Subgraph Discovery Algorithm. In ICDM, pages 439-442, 2004.
15. M. Lahiri and T. Y. Berger-Wolf. Structure Prediction in Temporal Networks using Frequent Subgraphs. In CIDM, pages 35-42, 2007.
16. J. Leskovec, J. M. Kleinberg, and C. Faloutsos. Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations. In KDD, pages 177-187, 2005.
17. M. Remm, C. E. V. Storm, and E. L. L. Sonnhammer. Automatic Clustering of Orthologs and In-paralogs from Pairwise Species Comparisons. J. Mol. Biol., 314:1041-1052, Oct 2001.
18. S. S. Shen-Orr, R. Milo, S. Mangan, and U. Alon. Network motifs in the transcriptional regulation network of Escherichia coli. Nat Genet., 31(1):64-68, May 2002.
19. S. Wernicke. Efficient Detection of Network Motifs. TCBB, 3(4):347-359, 2006.
20. S. Wuchty, Z. N. Oltvai, and A. L. Barabasi. Evolutionary conservation of motif constituents in the yeast protein interaction network. Nat Genet., 35(2):176-179, Oct 2003.
21. I. Xenarios, L. Salwinski, X. J. Duan, P. Higney, S. M. Kim, and D. Eisenberg. DIP, the Database of Interacting Proteins: a research tool for studying cellular networks of protein interactions. Nucleic Acids Res., 30(1):303-305, Jan 2002.
22. X. Yan and J. Han. gSpan: Graph-Based Substructure Pattern Mining. In ICDM, pages 721-724, 2002.