Bianca Wackersreuther
ABSTRACT
In many application domains, graphs are utilized to model entities and their relationships, and graph mining is important to detect patterns within these relationships. While the majority of recent data mining techniques deal with static graphs that do not change over time, recent years have witnessed the advent of an increasing number of time series of graphs. In this paper, we define a novel framework to perform frequent subgraph discovery in dynamic networks. In particular, we are considering dynamic graphs with edge insertions and edge deletions over time. Existing subgraph mining algorithms can be easily integrated into our framework to make them handle dynamic graphs. Finally, an extensive experimental evaluation on a large real-world case study confirms the practical feasibility of our approach.
- J. Aach, W. Rindone, and G. M. Church. Systematic Management and Analysis of Yeast Gene Expression Data. Genome Res., 10:431--445, Feb 2000.Google Scholar
Cross Ref
- 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.Google ScholarCross Ref
- K. M. Borgwardt, H.-P. Kriegel, and P. Wackersreuther. Pattern Mining in Frequent Dynamic Subgraphs. In ICDM, pages 818--822, 2006. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- D. J. Cook and L. B. Holder. Substructure Discovery Using Minimum Description Length and Background Knowledge. JAIR, 1:231--255, 1994. Google ScholarDigital Library
- P. Desikan and J. Srivastava. Mining Temporally Evolving Graphs. In WebKDD Workshop, 2004.Google Scholar
- M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- L. C. K. Hui. Color set size problem with application to string matching. In CPM, pages 230--243, 1992. Google ScholarDigital Library
- A. Inokuchi, T. Washio, and H. Motoda. Complete Mining of Frequent Patterns from Graphs: Mining Graph Data. Machine Learning, 50(3):321--354, 2003. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- M. Kuramochi and G. Karypis. Frequent Subgraph Discovery. In ICDM, pages 313--320, 2001. Google ScholarDigital Library
- M. Kuramochi and G. Karypis. Finding Frequent Patterns in a Large Sparse Graph. In SDM, 2004.Google ScholarCross Ref
- M. Kuramochi and G. Karypis. GREW-A Scalable Frequent Subgraph Discovery Algorithm. In ICDM, pages 439--442, 2004. Google ScholarDigital Library
- M. Lahiri and T. Y. Berger-Wolf. Structure Prediction in Temporal Networks using Frequent Subgraphs. In CIDM, pages 35--42, 2007.Google ScholarCross Ref
- J. Leskovec, J. M. Kleinberg, and C. Faloutsos. Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations. In KDD, pages 177--187, 2005. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- S. Wernicke. Efficient Detection of Network Motifs. TCBB, 3(4):347--359, 2006. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- X. Yan and J. Han. gSpan: Graph-Based Substructure Pattern Mining. In ICDM, pages 721--724, 2002. Google ScholarDigital Library
Index Terms
- Frequent subgraph discovery in dynamic networks
Recommendations
An Optimization of Closed Frequent Subgraph Mining Algorithm
AbstractGraph mining isamajor area of interest within the field of data mining in recent years. Akey aspect of graph mining is frequent subgraph mining. Central to the entire discipline of frequent subgraph mining is the concept of subgraph ...
Frequent Subgraph Discovery
ICDM '01: Proceedings of the 2001 IEEE International Conference on Data MiningAs data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the requirement of these domains. An alternate way of modeling the objects in ...
Frequent subgraph discovery in large attributed streaming graphs
BIGMINE'14: Proceedings of the 3rd International Conference on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications - Volume 36The problem of finding frequent subgraphs in large dynamic graphs has so far only considered a dynamic graph as being represented by a series of static snapshots taken at various points in time. This representation of a dynamic graph does not lend ...
Comments