Mining Generalized Closed Patterns from Multi-graph Collections

  • Niusvel Acosta-Mendoza
  • Andrés Gago-Alonso
  • Jesús Ariel Carrasco-Ochoa
  • José Francisco Martínez-Trinidad
  • José Eladio Medina-Pagola
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10657)

Abstract

Frequent approximate subgraph (FAS) mining has become an important technique into the data mining. However, FAS miners produce a large number of FASs affecting the computational performance of methods using them. For solving this problem, in the literature, several algorithms for mining only maximal or closed patterns have been proposed. However, there is no algorithm for mining FASs from multi-graph collections. For this reason, in this paper, we introduce an algorithm for mining generalized closed FASs from multi-graph collections. The proposed algorithm obtains more patterns than the maximal ones, but less than the closed one, covering patterns with small frequency differences. In our experiments over two real-world multi-graph collections, we show how our proposal reduces the size of the FAS set.

Keywords

Approximate graph mining Frequent multi-graph mining Generalized frequent patterns 

Notes

Acknowledgements

This work was partly supported by the National Council of Science and Technology of Mexico (CONACyT) through the scholarship grant 287045.

References

  1. 1.
    Acosta-Mendoza, N., Carrasco-Ochoa, J.A., Martínez-Trinidad, J.F., Gago-Alonso, A., Medina-Pagola, J.E.: A New method based on graph transformation for FAS mining in multi-graph collections. In: Carrasco-Ochoa, J.A., Martínez-Trinidad, J.F., Sossa-Azuela, J.H., Olvera López, J.A., Famili, F. (eds.) MCPR 2015. LNCS, vol. 9116, pp. 13–22. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-19264-2_2 CrossRefGoogle Scholar
  2. 2.
    Acosta-Mendoza, N., Gago-Alonso, A., Carrasco-Ochoa, J.A., Martínez-Trinidad, J.F., Medina-Pagola, J.E.: A new algorithm for approximate pattern mining in multi-graph collections. Knowl.-Based Syst. 109, 198–207 (2016)CrossRefGoogle Scholar
  3. 3.
    Acosta-Mendoza, N., Gago-Alonso, A., Carrasco-Ochoa, J.A., Martínez-Trinidad, J.F., Medina-Pagola, J.E.: Improving graph-based image classification by using emerging patterns as attributes. Eng. Appl. Artif. Intell. 50, 215–225 (2016)CrossRefGoogle Scholar
  4. 4.
    Acosta-Mendoza, N., Gago-Alonso, A., Carrasco-Ochoa, J.A., Martínez-Trinidad, J.F., Medina-Pagola, J.E.: Extension of canonical adjacency matrices for frequent approximate subgraph mining on multi-graph collections. Int. J. Pattern Recogn. Artif. Intell. 31(7), 25 (2017)MathSciNetGoogle Scholar
  5. 5.
    Boley, M., Horváth, T., Wrobel, S.: Efficient discovery of interesting patterns based on strong closedness. Stat. Anal. Data Min. 2(5–6), 346–360 (2009)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Bringmann, B., Nijssen, S., Zimmermann, A.: Pattern-based classification: a unifying perspective, p. 15. arXiv preprint arXiv:1111.6191 (2011)
  7. 7.
    Cheng, J., Ke, Y., Ng, W.: Effective elimination of redundant association rules. Data Min. Knowl. Discov. 16(2), 221–249 (2008)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Demetrovics, J., Quang, H.M., Anh, N.V., Thi, V.D.: An optimization of closed frequent subgraph mining algorithm. Cybern. Inf. Technol. 17(1), 1–13 (2017)MathSciNetGoogle Scholar
  9. 9.
    Emmert-Streib, F., Dehmer, M., Shi, Y.: Fifty years of graph matching, network alignment and network comparison. Inf. Sci. Int. J. 346(C), 180–197 (2016).  https://doi.org/10.1016/j.ins.2016.01.074 MathSciNetGoogle Scholar
  10. 10.
    Gay, D., Selmaoui-Folcher, N., Boulicaut, J.F.: Application-independent feature construction based on almost-closedness properties. Knowl. Inf. Syst. 30(1), 87–111 (2012)CrossRefGoogle Scholar
  11. 11.
    Li, R., Wang, W.: REAFUM: representative approximate frequent subgraph mining. In: SIAM International Conference on Data Mining, Vancouver, BC, Canada, pp. 757–765. SIAM (2015)Google Scholar
  12. 12.
    Liu, M., Gribskov, M.: MMC-Marging: identification of maximum frequent subgraphs by metropolis Monte Carlos sampling. In: IEEE International Conference on Big Data, pp. 849–856. IEEE (2015)Google Scholar
  13. 13.
    Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. Orlando, USA, pp. 208–297 (2008)Google Scholar
  14. 14.
    Shu-Jing, L., Yi-Chung, C., Li-Don, Y., Jungpin, W.: Discovering long maximal frequent pattern. In: 8th International Conference on Advanced Computational Intelligence, Chiang Mai, Thailand, pp. 136–142. IEEE. 14–16 February 2016Google Scholar
  15. 15.
    Takigawa, I., Mamitsuka, H.: Efficiently mining \(\delta \)-tolerance closed frequent subgraphs. Mach. Learn. 82(2), 95–121 (2011)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Verma, A., Bharadwaj, K.K.: Identifying community structure in a multi-relational network employing non-negative tensor factorization and GA k-means clustering. Wiley Interdisc. Rev. Data Min. Knowl. Discov. 7(1), 1–22 (2017)CrossRefGoogle Scholar
  17. 17.
    Wang, H., Ma, W., Shi, H., Xia, C.: An interval algebra-based modeling and routing method in bus delay tolerant network. KSII Trans. Internet Inf. Syst. 9(4), 1376–1391 (2015)Google Scholar
  18. 18.
    Wu, D., Ren, J., Sheng, L.: Uncertain maximal frequent subgraph mining algorithm based on adjacency matrix and weight. Int. J. Mach. Learn. Cybern. (2017).  https://doi.org/10.1007/s13042-017-0655-y. ISSN 1868-808X

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Advanced Technologies Application Center (CENATAV)HavanaCuba
  2. 2.Instituto Nacional de Astrofísica, Óptica y Electrónica (INAOE)PueblaMexico

Personalised recommendations