RAM: Randomized approximate graph mining

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5069 LNCS, Issue , 2008, Pages 187-203

  Zhang, Shijie ^a   Yang, Jiong ^a  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; APPROXIMATION ALGORITHMS; DATABASE SYSTEMS; ERROR ANALYSIS; MANAGEMENT INFORMATION SYSTEMS; RANDOM ACCESS STORAGE; STATISTICAL METHODS;

A-PRIORI; DATABASE MANAGEMENT; EXACT MATCHING; FEATURE RETRIEVAL; FREQUENT PATTERNS; GRAPH DATABASE; GRAPH MINING; INACCURATE INFORMATION; INTERNATIONAL CONFERENCES; RANDOMIZED ALGORITHMS; SUB-GRAPHS; SYNTHETIC DATA SETS;

GRAPH THEORY;

EID: 49049116974     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69497-7_14     Document Type: Conference Paper

References (23)

1. Bader, J., Chaudhuri, A., Rothberg, J., Chant, J.: Gaining confidence in high-throughput protein interaction networks. Nature Biotechnology 22(1), 78-85 (2004)
2. Chang, R., Podgurski, A., Yang, J.: Finding What's not there: a new approach to revealing neglected conditions in software. In: Proc. of ISSTA (2007)
3. Cong, G., Yi, L., Liu, B., Wang, K.: Discovering frequent substructures from hierarchical semi-structured data. In: Proc of SDM (2002)
4. Gunopulos, D., Mannila, H., Saluja, S.: Discovering All Most Specific Sentences by Randomized Algorithms Source. LNCS 1997(1997)
5. Hasan, M., Chaoji, V., Salem, S., Besson, J., Zaki, M.: ORIGAMI: Mining Representative Orthogonal Graph Patterns. In: Perner, P. (ed.) ICDM 2007. LNCS (LNAI), vol. 4597. Springer, Heidelberg (2007)
6. Holder, L., Cook, D., Djoko, S.: Substructure discovery in the subdue system. In: Proc. AAAI (1994)
7. Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraphs in the presence of isomorphism. In: Proc. of ICDM (2003)
8. Huan, J., Wang, W., Prins, J., Yang, J.: SPIN: mining maximal frequent subgraphs from graph databases. In: Proc. of KDD (2004)
9. Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Proceedings of PDKK (2000)
10. Koyuturk, M., Grama, A., Szpankowski, W.: An efficient algorithm for detecting frequent subgraphs in bioloical networks. Bionformatics 20, 200-207 (2004)
11. Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proc. of ICDE (2001)
12. Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph. Data Min. Knowl. Discov. (2005)
13. Nijssen, S., Kok, J.: A quickstart in frequent structure mining can make a difference. In: Proc of KDD (2004)
14. Pei, J., Jiang, D., Zhang, A.: On Mining Cross-Graph Quasi-Cliques. In: Proc. of KDD (2005)
15. Park, J., Chen, M., Yu, P.: An effective hash based algorithm for mining association rules. In: Proc. SIGMOD, pp. 175-186 (1995)
16. Thomas, L., Valluri, S., Karlapalem, K.: MARGIN:Maximal Frequent Subgraph Mining. In: Proc. of ICDM (2006)
17. Yan, X., Han, J.: CloseGraph: Mining closed frequent graph patterns. In: Proc. of SIGKDD (2003)
18. Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: Proc. of ICDM (2002)
19. Yan, X., Yu, P., Han, J.: Substructure similarity search in graph databases. In: Proc. of SIGMOD (2005)
20. Liu, J., Paulsen, S., Xu, X., Wang, W., Nobel, A., Prins, J.: Mining approximate frequent itemset from noisy data. In: ICDM (2005)
21. Zaki, M.: Efficiently mining frequent trees in a forest: algorithms and applications. In: IEEE TKDE (2005)
22. Kyoto Encyclopedia of Genes and Genomes, http://www.genome.jp/kegg/
23. Metabolic pathway categories in KEGG, http://www.kegg.com/kegg/pathway/ map/map01100.html