On Speeding up Frequent Approximate Subgraph Mining

  • Niusvel Acosta-Mendoza
  • Andrés Gago-Alonso
  • José E. Medina-Pagola
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7441)


Frequent approximate subgraph (FAS) mining has become an interesting task with wide applications in several domains of science. Most of the previous studies have been focused on reducing the search space or the number of canonical form (CF) tests. CF-tests are commonly used for duplicate detection; however, these tests affect the efficiency of mining process because they have high computational complexity. In this paper, two prunes are proposed, which allow decreasing the label space, the number of candidates and the number of CF-tests. The proposed prunes are already used and validated in two reported FAS miners by speeding up their mining processes in artificial graph collections.


Approximate graph mining approximate graph matching frequent approximate subgraphs labeled graphs 


  1. 1.
    Acosta-Mendoza, N., Gago-Alonso, A., Medina-Pagola, J.E.: Frequent Approximate Subgraphs as Features for Graph-Based Image Classification. Knowledge-Based Systems 27, 381–392 (2012)CrossRefGoogle Scholar
  2. 2.
    Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: In Proceedings of the 1994 International Conference on Very Large Data Bases (VLDB 1994), Santiago, Chile, pp. 487–499 (1994)Google Scholar
  3. 3.
    Borgelt, C.: Canonical Forms for Frequent Graph Mining. In: Proceedings of the 30th Annual Conference of the Gesellschaft für Klassifikation e.V., pp. 8–10. Universitat Berlin (2006)Google Scholar
  4. 4.
    Chen, C., Yan, X., Zhu, F., Han, J.: gApprox: Mining Frequent Approximate Patterns from a Massive Network. In: IEEE International Conference on Data Mining, ICDM 2007, pp. 445–450 (2007)Google Scholar
  5. 5.
    Holder, L.B., Cook, D.J., Bunke, H.: Fuzzy substructure discovery. In: Proceedings of the 9th International Workshop on Machine Learning, San Francisco, CA, USA, pp. 218–223 (1992)Google Scholar
  6. 6.
    Jia, Y., Zhang, J., Huan, J.: An Efficient Graph-Mining Method for Complicated and Noisy Data with Real-World Applications. Knowledge Information Systems 28(2), 423–447 (2011)CrossRefGoogle Scholar
  7. 7.
    Jiang, C., Coenen, F., Zito, M.: A Survey of Frequent Subgraph Mining Algorithms. To appear: Knowledge Engineering Review (2012)Google Scholar
  8. 8.
    Song, Y., Chen, S.: Item Sets Based Graph Mining Algorithm and Application in Genetic Regulatory Networks. In: Proceedings of the IEEE International Conference on Granular Computing, Atlanta, GA, USA, pp. 337–340 (2006)Google Scholar
  9. 9.
    Xiao, Y., Wu, W., Wang, W., He, Z.: Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination. In: Haritsa, J.R., Kotagiri, R., Pudi, V. (eds.) DASFAA 2008. LNCS, vol. 4947, pp. 452–460. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  10. 10.
    Zhang, S., Yang, J.: RAM: Randomized Approximate Graph Mining. In: Ludäscher, B., Mamoulis, N. (eds.) SSDBM 2008. LNCS, vol. 5069, pp. 187–203. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  11. 11.
    Zou, Z., Li, J., Gao, H., Zhang, S.: Mining Frequent Subgraph Patterns from Uncertain Graph Data. IEEE Transactions on Knowledge and Data Engineering 22(9), 1203–1218 (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Niusvel Acosta-Mendoza
    • 1
  • Andrés Gago-Alonso
    • 1
  • José E. Medina-Pagola
    • 1
  1. 1.Advanced Technologies Application Center (CENATAV)HavanaCuba

Personalised recommendations