An Optimization of Closed Frequent Subgraph Mining Algorithm

1. Demetrovics, J., V. D. Thi, N. L. Giang. On Finding All Reducts of Consistent Decision Tables. - Cybernetics and Information Technologies, Vol. 14, 2014, No 4, pp. 3-10.10.1515/cait-2014-0001Search in Google Scholar

2. Eppstein, D. Subgraph Isomorphism in Planar Graphs and Related Problems. - In SODA, Vol. 95, 1995, pp. 632-640.Search in Google Scholar

3. Garey, M. R., D. S. Johnso n. Computers and Intractability: An Introduction to the Theory of Np-Completeness. San Francisco, 1979.Search in Google Scholar

4. Han, J., H. Cheng, D. Xin, X. Yan. Frequent Pattern Mining: Current Status and Future Directions. - Data Mining and Knowledge Discovery, Vol. 15, 2007, No 1, pp. 55-86.10.1007/s10618-006-0059-1Search in Google Scholar

5. Hopcroft, J. E., R. E. Tarjan. Isomorphism of Planar Graphs. - In: Complexity of Computer Computations. Springer, 1972, pp. 131-152.10.1007/978-1-4684-2001-2_13Search in Google Scholar

6. Huan J., W. Wang, J. Prins. Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. - In: 3rd IEEE International Conference on Data Mining, 2003 (ICDM’2003), IEEE, 2003, pp. 549-552.Search in Google Scholar

7. Huan, J., W. Wang, J. Prins, J. Yang. Spin: Mining Maximal Frequent Subgraphs from Graph Databases. - In: Proc. of 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2004, pp. 581-586.Search in Google Scholar

8. Inokuchi, A., T. Washio, H. Motoda. An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. - In: European Conference on Principles of Data Mining and Knowledge Discovery, Springer, 2000, pp. 13-23.10.1007/3-540-45372-5_2Search in Google Scholar

9. Kuramochi M., G. Karypi s. Frequent Subgraph Discovery. - In: Proc. of IEEE International Conference on Data Mining, 2001. ICDM 2001, IEEE, 2001, pp. 313-320.Search in Google Scholar

10. Mc Kay, B. D., et al. Practical Graph Isomorphism. Department of Computer Science, Vanderbilt University Tennessee, US, 1981.Search in Google Scholar

11. Read, R. C., D. G. Cornei l. The Graph Isomorphism Disease. - Journal of Graph Theory, Vol. 1, 1977, No 4, pp. 339-363.10.1002/jgt.3190010410Search in Google Scholar

12. Savage, J. E. Models of Computation. Exploring the Power of Computing, 1998.Search in Google Scholar

13. Thi, V. D., N. L. Giang. A Method to Constructa Decision Table froma Relation Scheme. - Cybernetics and Information Technologies, Vol. 11, 2011, No 3, pp. 32-41.Search in Google Scholar

14. Thomas, L. T., S. R. Valluri, K. Karlapalem. Margin: Maximal Frequent Subgraph Mining. - ACM Transactions on Knowledge Discovery from Data (TKDD), Vol. 4, 2010, No 3, pp. 10.10.1145/1839490.1839491Search in Google Scholar

15. Ullmann, J. R. An Algorithm for Subgraph Isomorphism. - Journal of the ACM (JACM), Vol. 23, 1976, No 1, pp. 31-42.10.1145/321921.321925Search in Google Scholar

16. Washio, T., H. Motoda. State of the Art of Graph-Based Data Mining. - ACM Sigkdd Explorations Newsletter, Vol. 5, 2003, No 1, pp. 59-68.10.1145/959242.959249Search in Google Scholar

17. Yan, X., J. Han. GSPAN: Graph-Based Substructure Pattern Mining. - In: Proc. of 2002 IEEE International Conference on Data Mining, 2002. ICDM 2003, IEEE, 2002, pp. 721-724.Search in Google Scholar

18. Yan, X., J. Han. Closegraph: Mining Closed Frequent Graph Patterns. - In: Proc. of 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2003, pp. 286-295.Search in Google Scholar