A comparative survey of algorithms for frequent subgraph discovery

Current Science

Volumn 100, Issue 2, 2011, Pages 190-198

  Krishna, Varun ^a   Ranga Suri, N N R ^a   Athithan, G ^a  

^a Defense Research and Development Organization   (India)

Author keywords

Algorithms; Frequent subgraphs; Graph mining; Subgraph discovery

Indexed keywords

EID: 79851478861     PISSN: 00113891     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Review

References (41)

1. Hanneman, R. and Riddle, M., Introduction to social network methods; http://faculty.ucr.edu/hanneman/
2. Newman, M., Watts, D. and Strogatz, S., Random graph models of social networks. In Proceedings of the Self-Organized Complexity in the Physical, Biological, and Social Sciences, National Academy of Sciences, USA, 2002, vol. 99, pp. 2566-2572.
3. Bharat, K., Chang, B., Henzinger, M. and Ruhl, M., Who links to whom: mining linkage between web sites. In Proceedings of the 2001 IEEE International Conference on Data Mining, California, USA, 2001.
4. Li, Z., Lei, J., Wang, L. and Li, D., A data mining approach to generating network attack graph for intrusion prediction. In Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, 2007, vol. 4.
5. Aggarwal, C. and Wang, H., Managing and Mining Graph Data, Springer Publishing Company, Incorporated, 2010, 1st edn.
6. Tan, P., Steinbach, M. and Kumar, V., Introduction to Data Mining, Pearson Education Inc., 2006.
7. Washio, T. and Motoda, H., State of the art of graph-based data mining. Acm. Sigkdd Explor. Newsl., 2003, 5(1), 59-68.
8. Papadopoulos, A., Lyritsis, A. and Manolopoulos, Y., Skygraph: an algorithm for important subgraph discovery in relational graphs. Data Min. Knowledge Discovery, 2008, 17(1), 57-76.
9. Andersen, R., A local algorithm for finding dense subgraphs. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008.
10. Gibson, D., Kumar, R. and Tomkins, A., Discovering large dense subgraphs in massive graphs. In Proceedings of the 31st International Conference on Very Large Databases, 2005, vol. 2, pp. 721-732.
11. Aluru, S. (ed.), Handbook of Computational Molecular Biology, Chapman and Hall/CRC, 2006.
12. Ciriello, G. and Guerra, C., A review on models and algorithms for motif discovery in protein-protein interaction networks. Brief. Funct. Genomics, 2008, 7(2), 147-156.
13. Huan, J., Wang, W., Bandyopadhyay, D., Snoeyink, J., Prins, J. and Tropsha, A., Mining protein family specific residue packing patterns from protein structure graphs. In Proceedings of the Eighth Annual International Conference on Research in Computational Molecular Biology, ACM, New York, 2005, pp. 308-315.
14. Dehaspe, L. and Toivonen, H., Discovery of frequent datalog patterns. Data Min. Knowledge Discovery, 1999, 3(1), 7-36.
15. Corley, C., Cook, D., Holder, L. and Singh, K., Graph-based data mining in epidemia and terrorism data; www.eecs.wsu.edu/holder/pubs.
16. Last, M., Markov, A. and Kandel, A., Multilingual detection of terrorist content on the web. In Lecture Notes in Computer Science, Springer, Berlin, 2006.
17. Cook, J. and Holder, L., Substructure discovery using minimum description length and background knowledge. J. Artif. Intell. Res., 1994, 1, 231-255.
18. Agrawal, R. and Srikant, R., Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases, San Francisco, CA, USA, 1994, pp. 487-499.
19. Muggleton, S., Inductive Logic Programming, Academic Press, 1992.
20. Lavrac, N. and Dzeroski, S., Inductive Logic Programming: Techniques and Applications, Ellis Horwood, 1994.
21. Han, J., Pei, J. and Yin, Y., Mining frequent patterns without candidate generation. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (SIGMOD '00), ACM, New York, NY, USA.
22. Worlein, M., Meinl, T., Fischer, I. and Philippsen, M., A quantitative comparison of the subgraph miners MoFa, gSpan, FFSMC, and Gaston. Lecture Notes in Computer Science, 2005, 3721, 392-403.
23. Kuramochi, M. and Karypis, G., Finding frequent patterns in a large sparse graph. Data Min. Knowledge Discovery, 2005, 11(3), 243-271.
24. Huan, J., Wang, W. and Prins, J., Efficient mining of frequent subgraphs in the presence of isomorphism. In Proceedings of the Third IEEE International Conference on Data Mining, ICDM '03, IEEE Computer Society, Washington DC, USA, 2003.
25. Kuramochi, M. and Karypis, G., Frequent subgraph discovery. In Proceedings of the 2001 IEEE International Conference on Data Mining (ICDM '01), 2001, pp. 313-320.
26. Yan, X. and Han, J., gSpan: graph-based substructure pattern mining. In Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM '02, IEEE Computer Society, Washington, DC, USA, 2002, p. 721.
27. Yan, X. and Han, J., ClosegGaph: mining closed frequent graph patterns. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD'03, ACM, New York, USA, 2003, pp. 286-295.
28. Nijssen, S. and Kok, J., A quickstart in frequent structure mining can make a difference. In Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2004, pp. 647-652.
29. Nijssen, S. and Kok, J., Faster association rules for multiple relations. In IJCAI'01: Seventeenth International Joint Conference on Artificial Intelligence, 2001, vol. 2, pp. 891-896.
30. Thomas, L., Valluri, S. and Karlapalem, K., Isg: Itemset based subgraph mining. Technical Report, IIIT, Hyderabad, December 2009.
31. Kuramochi, M. and Karypis, G., GREW - a scalable frequent subgraph discovery algorithm. In Proceedings of the Fourth IEEE International Conference on Data Mining (ICDM'04), 2004.
32. McKay, B., Practical Graph Isomorphism, Citeseer, 1981.
33. Al Hasan, M., Chaoji, V., Salem, S., Besson, J. and Zaki, M., Origami: mining representative orthogonal graph patterns. In Seventh IEEE International Conference on Data Mining, 2007, IEEE, 2008, pp. 153-162.
34. Scholkopf, B. and Smola, A., Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond, MIT Press, 2002.
35. Saigo, H. and Tsuda, K., Iterative subgraph mining for principal component analysis. In Conference on Data Mining, ICDM'08, 2008.
36. Lanczos, C., An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Natl. Bur. Stand., 1950, 45, 255-282.
37. Nguyen, T., Nguyen, H., Pham, N., Al-Kofahi, J. and Nguyen, T., Graph-based mining of multiple object usage patterns. In Proceedings of the 7th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on The Foundations of Software Engineering, ACM, 2009, pp. 383-392.
38. Termier, A., Tamada, Y., Numata, K., Imoto, S., Washio, T. and Higuchi, T., DIGDAG, a first algorithm to mine closed frequent embedded sub-DAGs. In Proceedings of Mining and Learning with Graphs Workshop (MLG'07), Citeseer, 2007, pp. 41-45.
39. Li, Y., Lin, Q., Zhong, G., Duan, D., Jin, Y. and Bi, W., A directed labeled graph frequent pattern mining algorithm based on minimum code. In Third International Conference on Multimedia and Ubiquitous Engineering, 2009. MUE'09, Centre for Artificial Intelligence and Robotics, Bangalore, IEEE, 2009, pp. 353-359.
40. DTP human tumour cell line screen. http://dtp.nci.nih.gov/cancer/cancer_data.html
41. DTP aids antiviral screen. http://dtp.nci.nih.gov/aids/aids_data.html