WIGM: Discovery of subgraph patterns in a large weighted graph

Proceedings of the 12th SIAM International Conference on Data Mining, SDM 2012

Volumn , Issue , 2012, Pages 1083-1094

  Yang, Jiong ^a   Su, Wei ^a   Li, Shirong ^b   Dalkilic, Mehmet M ^c  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

^b AMAZON   (United States)

^c INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; SPACE DIVISION MULTIPLE ACCESS;

BIOLOGICAL NETWORKS; EFFECTIVENESS AND EFFICIENCIES; LOGARITHMIC TRANSFORMATIONS; MASSIVE DATA SETS; MODELS AND ALGORITHMS; MONOTONIC PROPERTIES; SYNTHETIC DATASETS; UNWEIGHTED GRAPHS;

DATA MINING;

EID: 84872806274     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972825.93     Document Type: Conference Paper

References (19)

1. C. Borgelt and M. Fiedler. Graph Mining: Repository vs. Canonical Form. Proc. of Annual Conference of the German Classification Society, 2007.
2. B. Bringmann, and S. Nijssen: What Is Frequent in a Single Graph? PAKDD, 2008.
3. J. Costello and M. Dalkilic, S. Beason, R. Patwardhan, S. Middha, B. Eads, and J. Andrews. Gene networks in Drosophila melanogaster: integrating experimental data to predict gene function. Genome Biology, vol. 10, no. 9, 2009.
4. Fiedler and Borgelt. Support computation for mining frequent subgraphs in a single graph. MLG, 2007.
5. The Gene Ontology Consortium. The Gene Ontology project in 2008. Nucleic Acids Research, vol. 36, 2008.
6. X. He, M. Sarma, X. Ling, B. Chee, C. Zhai, and B. Schatz. Identifying overrepresented concepts in gene lists from literature: A statistical approach based on Poisson mixture model. BMC Bioinformatics, vol. 11, 2010.
7. J. Huan, W.Wang, J. Prins, and J. Yang. SPIN: mining maximal frequent subgraphs from graph databases. Proc. of KDD, 2004.
8. C. Jiang, F. Coenen, M. Zito. Frequent Sub-graph Mining on Edge Weighted Graphs. DAWAK, 2010.
9. M. Kuramochi, G. Karypis. Finding Frequent Patterns in a Large Sparse Graph. Data Mining and Knowledge Discovery, 2005.
10. M. Kanehisa and S. Goto. KEGG: Kyoto Encyclopedia of Genes and Genomes. Nucleic Acids Res, vol. 28, 2000.
11. M. Kuramochi, and G. Karypis, Finding Frequent Patterns in a Large Sparse Graph. DMKD, 2005.
12. E. Marcotte, M. Pellegrini, M. Thompson, T. Yeates, and D. Eisenberg. A combined algorithm for genomewide prediction of protein function. Nature, vol. 402, 1999.
13. S. Nijssen and J. Kok. A quickstart in frequent structure mining can make a difference, Proc of KDD, 2004.
14. M. Shinoda, T. Ozaki, and T. Ohkawa. Weighted Frequent Subgraph Mining in Weighted Graph Databases. ICDM workshop on Domain Driven Data Mining, 2009.
15. N. Vanetik, S. E. Shimony and E. Gudes. Support measures for graph data. Data Min. Knowl. Discov., 2006.
16. X. Yan and J. Han. gSpan: graph-based substructure pattern mining, Proc. of ICDM, 2002.
17. J. Yang, W. Su, S. Li, and M. M. Dalkil. WIGM: Discovery of Subgraph Patterns in a Large Weighted Graph. Technical Report, Case Western Reserve University. Available at http://beijing.case.edu/wigm.pdf.
18. S. Zhang, S. Li, and J. Yang. GADDI: distance index based subgraph matching in biological networks. Proc. of EDBT, 2009.
19. gengraph win. Available at http://www.cs.sunysb.edu/&tild;algorith/ implement/viger/distrib/.