GraphRank: Statistical modeling and mining of significant subgraphs in the feature space

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 885-890

  He, Huahai ^a   Singh, Ambuj K ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FEATURE VECTORS; ITEMSET MINING;

DATA MINING; DATA STRUCTURES; DATABASE SYSTEMS; FEATURE EXTRACTION; STATISTICAL METHODS; VECTORS;

GRAPH THEORY;

EID: 84878102536     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.79     Document Type: Conference Paper

References (17)

1. E. Rahm and P. Bernstein. A survey of approaches to automatic schema matching. VLDB J. 10(4): 334-350 (2001).
2. S. Berretti, A. D. Bimbo, and E. Vicario. Efficient matching and indexing of graph models in content-based retrieval. In IEEE Trans. on Pattern Analysis and Machine Intelligence, volume 23, 2001.
3. S. White and P. Smyth. Algorithms for estimating relative importance in networks. In KDD, 2003.
4. J. Hu, X. Shen, Y. Shao, C. Bystroff, and M. J. Zaki. Mining protein contact maps. In BIOKDD, 2002.
5. R. Sharan, S. Suthram, R. M. Kelley, T. Kuhn, S. McCuine, P. Uetz, T. Sittler, R. M. Karp, and T. Ideker. Conserved patterns of protein interaction in multiple species. In Proc Natl Acad Sci, 2005.
6. S. Kramer, L. D. Raedt, and C. Helma. Molecular feature mining in HIV data. In KDD, 2001.
7. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Principles of Data Mining and Knowledge Discovery, pages 13-23, 2000.
8. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, pages 313-320, 2001.
9. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In ICDM, 2002.
10. X. Yan and J. Han. CloseGraph: Mining closed frequent graph patterns. In KDD, 2003.
11. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraph in the presence of isomorphism. In ICDM, 2003.
12. J. Huan, W. Wang, J. Prins, and J. Yang. SPIN: Mining maximal frequent subgraphs from graph databases. In KDD, 2004.
13. N. Vanetik, E. Gudes, and S. E. Shimony. Computing frequent graph patterns from semistructured data. In Proceedings of ICDM, 2002.
14. N. Vanetik and E. Gudes. Mining frequent labeled and partially labeled graph patterns. In ICDE, 2004.
15. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. Network motifs: Simple building blocks of complex networks. Science, October 2002.
16. S. Theodoridis and K. Koutroumbas. Pattern Recognition, chapter 5, pages 181-183. Academic press, second edition, 2003.
17. Huahai He and Ambuj K. Singh. GraphRank: Statistical modeling and mining of significant subgraphs in the feature space. Technical report, department of computer science, University of California at Santa Barbara, 2006.