DESSIN: Mining dense subgraph patterns in a single graph

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

Volumn 6187 LNCS, Issue , 2010, Pages 178-195

  Li, Shirong ^a   Zhang, Shijie ^a   Yang, Jiong ^a  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APRIORI; AS GRAPH; AUTOMORPHISMS; CONNECTED GRAPH; DEPTH FIRST SEARCH; FREQUENT PATTERNS; PROTEIN INTERACTION NETWORKS; REACHABILITY; RESEARCH PROBLEMS; SINGLE GRAPH; SMALL-DIAMETER; SOCIAL NETWORKS; SUBGRAPHS; SYNTHETIC DATASETS;

GRAPH THEORY;

MANAGEMENT INFORMATION SYSTEMS;

EID: 77955023805     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13818-8_15     Document Type: Conference Paper

References (30)

1. Bader, G., Hogue, C.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4(2) (2003)
2. Bringmann, B., Nijssen, S.: What is Frequent in a Single Graph? In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.5012, pp. 858-863. Springer, Heidelberg (2008)
3. Chang, R., Podgurski, A., Yang, J.: Finding what's not there: a new approach to revealing neglected conditions in software. In: International symposium on software testing and analysis (2007)
4. Dehaspe, L., Toivonen, H., King, R.: Finding frequent substructures in chemical compounds. In: Proc. of KDD, New York, NY, USA (1998)
5. Fan, W., Zhang, K., Cheng, H., Yan, X., Han, J., Yu, P., Verscheure, O.: Direct mining of discriminative and essential frequent patterns via model-based search tree. In: Proc. of KDD, Las Vegas, Nevada, USA, pp. 230-238 (2008)
6. Fiedler, M., Borgelt, C.: Subgraph support in a single large graph. In: Proc. of ICDMW, pp. 399-404 (2007)
7. Gibson, D., Kumar, R., Tomkins, A.: Discovering Large Dense Subgraphs in Massive Graphs. In: Proc. of VLDB, Trondheim, Norway, pp. 721-732 (2005)
8. Hasan, M., Chaoji, V., Salem, S., Besson, J., Zaki, M.: ORIGAMI: Mining Representative Orthogonal Graph Patterns. In: Proc. of ICDM, pp. 153-162 (2007)
9. Hu, H., Yan, X., Huang, Y., Han, J., Zhou, X.: Mining coherent dense subgraphs across massive biological networks for functional discovery. In: Proc. of ISMB (Supplement of Bioinformatics), pp. 213-221 (2005)
10. Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraphs in the presence of isomorphism. In: Proc. of ICDM, Melbourne, Florida, USA, pp. 549-552 (2003)
11. Huan, J.,Wang,W., Prins, J., Yang, J.: SPIN: mining maximal frequent subgraphs from graph databases. In: Proc. of SIGKDD, Seattle, WA, USA, pp. 581-586 (2004)
12. Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Proc. of Principles of DataMining and Knowledge Discovery, pp. 13-23 (2000)
13. Ketkar, N., Holder, L., Cook, D.: Subdue: compression-based frequent pattern discovery in graph data. In: Proc. of the 1st international workshop on open source data mining: frequent pattern mining implementations, Chicago, Illinois, USA, pp. 71-76 (2005)
14. Koyuturk, M., Grama, A., Szpankowski, W.: An efficient algorithm for detecting frequent subgraphs in biological networks. Bioinformatics 21(16), 3401-3408 (2004)
15. Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proc. of ICDE, pp. 313-320 (2001)
16. Kuramochi, M., Karypis, G.: Finding Frequent Patterns in a Large Sparse Graph. DMKD 11(3), 243-271 (2005)
17. Moody, J.: Peer Influence Groups: Identifying Dense Clusters in Large Networks. Social Networks 23, 261-283 (2001)
18. Nijssen, S., Kok, J.: A quick start in frequent structure mining can make a difference. In: Proc. of KDD, Seattle, WA, US, pp. 647-652 (2004)
19. Palmer, C., Gibbons, P., Faloutsos, C.: ANF: A fast and scalable tool for data mining in massive graphs. In: Proc. of KDD, Edmonton, Alberta, Canada, pp. 81-90 (2002)
20. Pei, J., Jiang, D., Zhang, A.: On mining cross-graph quasi-cliques. In: Proc. of KDD, Chicago, Illinois, USA (2005)
21. Thomas, L., Valluri, S., Karlapalem, K.: MARGIN:Maximal Frequent Subgraph Mining. In: Proc. of ICDM, pp. 1097-1101 (2006)
22. Wang, J., Zeng, Z., Zhou, L.: CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases. In: Proc. of ICDE, vol.73 (2006)
23. Wang, N., Parthasarathy, S., Tan, K., Tung, A.: CSV: Visualizing and Mining Cohesive Subgraphs. In: Proc. of SIGMOD (2008)
24. Yan, X., Cheng, H., Han, J., Yu, P.: Mining significant graph patterns by leap search. In: Prof. of SIGMOD, Vancouver, Canada, pp. 433-444 (2008)
25. Zhang, S., Hu, M., Yang, J.: TreePi: a novel graph indexing method. In: Proc. of ICDE (2007)
26. Zhang, S., Li, S., Yang, J.: GADDI: Distance index base subgraph matching in biological networks. In: Proc. of EDBT (2009)
27. Zhang, S., Yang, J., Li, S.: RING: an integrated method for frequent representative subgraph mining. In: Proc. of ICDM (2009)
28. Zeng, Z.,Wang, J., Zhou, L., Karypis, G.: Coherent closed quasi-clique discovery from large dense graph databases. In: Proc. of KDD, Philadelphia, PA, USA, pp. 797-802 (2006) (Pubitemid 44535593)
29. Gene Ontology, http://www.geneontology.org/
30. Social Network, http://www-personal.umich.edu/∼mejn/netdata/