Skip to main content

Multi-graph Frequent Approximate Subgraph Mining for Image Clustering

  • Conference paper
  • First Online:
  • 1178 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 11047))

Abstract

In data mining, frequent approximate subgraph (FAS) mining techniques has taken the full attention of several applications, where some approximations are allowed between graphs for identifying important patterns. In the last four years, the application of FAS mining algorithms over multi-graphs has reported relevant results in different pattern recognition tasks like supervised classification and object identification. However, to the best of our knowledge, there is no reported work where the patterns identified by a FAS mining algorithm over multi-graph collections are used for image clustering. Thus, in this paper, we explore the use of multi-graph FASs for image clustering. Some experiments are performed over image collections for showing that by using multi-graph FASs under the bag of features image approach, the image clustering results reported by using simple-graph FAS can be improved.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Muñoz-Briseño, A., Lara-Alvarez, G., Gago-Alonso, A., Hernández-Palancar, J.: A novel geometric graph miner and its applications. Pattern Recognit. Lett. 84, 208–214 (2016)

    Article  Google Scholar 

  2. Ozaki, T., Etoh, M.: Closed and maximal subgraph mining in internally and extermally weighted graph databases. In: Proceedings of the IEEE Workshops of International Conference on Advanced Information Networking and Applications, pp. 626–631. IEEE Computer Society (2011)

    Google Scholar 

  3. Jia, Y., Zhang, J., Huan, J.: An efficient graph-mining method for complicated and noisy data with real-world applications. Knowl. Inf. Syst. 28(2), 423–447 (2011)

    Article  Google Scholar 

  4. Morales-González, A., Acosta-Mendoza, N., Gago-Alonso, A., García-Reyes, E., Medina-Pagola, J.: A new proposal for graph-based image classification using frequent approximate subgraphs. Pattern Recognit. 47(1), 169–177 (2014)

    Article  Google Scholar 

  5. 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 

  6. Flores-Garrido, M., Carrasco-Ochoa, J., Martínez-Trinidad, J.: Graph clustering via inexact patterns. In: Bayro-Corrochano, E., Hancock, E. (eds.) Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, pp. 391–398. Springer International Publishing, Cham (2014)

    Google Scholar 

  7. Acosta-Mendoza, N., Carrasco-Ochoa, J.A., Martínez-Trinidad, J.F., Gago-Alonso, A., Medina-Pagola, J.E.: Image clustering based on frequent approximate subgraph mining. In: Martínez-Trinidad, J.F., Carrasco-Ochoa, J.A., Olvera-López, J.A., Sarkar, S. (eds.) MCPR 2018. LNCS, vol. 10880, pp. 189–198. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-92198-3_19

    Chapter  Google Scholar 

  8. Flores-Garrido, M., Carrasco-Ochoa, J., Martínez-Trinidad, J.: Mining maximal frequent patterns in a single graph using inexact matching. Knowl.-Based Syst. 66, 166–177 (2014)

    Article  Google Scholar 

  9. Acosta-Mendoza, N., Gago-Alonso, A., Medina-Pagola, J.: Frequent approximate subgraphs as features for graph-based image classification. Knowl.-Based Syst. 27, 381–392 (2012)

    Article  Google Scholar 

  10. Neuhaus, M., Bunke, H.: Automatic learning of cost functions for graph edit distance. Inf. Sci. 177(1), 239–247 (2007)

    Article  MathSciNet  Google Scholar 

  11. Kropatsch, W., Haxhimusa, Y., Pizlo, Z., Langs, G.: Vision pyramids that do not grow too high. Pattern Recognit. Lett. 26, 319–337 (2005)

    Article  Google Scholar 

  12. Morales-González, A., García-Reyes, E.B.: Simple object recognition based on spatial relations and visual features represented using irregular pyramids. Multimed. Tools Appl. 63(3), 875–897 (2013)

    Article  Google Scholar 

  13. Acosta-Mendoza, N., Gago-Alonso, A., Carrasco-Ochoa, J., Martínez-Trinidad, J., Medina-Pagola, J.: Extension of canonical adjacency matrices for frequent approximate subgraph mining on multi-graph collections. Int. J. Pattern Recognit. Artif. Intell. 31(7), 25 (2017)

    MathSciNet  Google Scholar 

  14. Acosta-Mendoza, N., Gago-Alonso, A., Carrasco-Ochoa, J., Martínez-Trinidad, J., Medina-Pagola, J.: A new algorithm for approximate pattern mining in multi-graph collections. Knowl.-Based Syst. 109, 198–207 (2016)

    Article  Google Scholar 

  15. 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

    Chapter  Google Scholar 

  16. Acosta-Mendoza, N., Gago-Alonso, A., Carrasco-Ochoa, J.A., Martínez-Trinidad, J.F., Medina-Pagola, J.E.: Mining generalized closed patterns from multi-graph collections. In: Mendoza, M., Velastín, S. (eds.) CIARP 2017. LNCS, vol. 10657, pp. 10–18. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-75193-1_2

    Chapter  Google Scholar 

  17. O’Hara, S., Draper, B.: Introduction to the bag of features paradigm for image classification and retrieval. Computing Research Repository (CoRR) abs/1101.3354 (2011)

    Google Scholar 

  18. Finkel, R., Bentley, J.: Quad trees: a data structure for retrieval on composite keys. Acta Inform. 4, 1–9 (1974)

    Article  Google Scholar 

  19. Arthur, D., Vassilvitskii, S.: K-means: the advantages of carefull seeding. In: Proceedings of the eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1027–1035. ACM (2007)

    Google Scholar 

  20. Rand, M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846–850 (1971)

    Article  Google Scholar 

  21. Lazebnik, S., Schmid, C., Ponce, J.: Beyond bags of features: spatial pyramid matching for recognizing natural scene categories. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1–8. IEEE (2006)

    Google Scholar 

Download references

Acknowledgment

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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Niusvel Acosta-Mendoza .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Acosta-Mendoza, N., Carrasco-Ochoa, J.A., Gago-Alonso, A., Martínez-Trinidad, J.F., Medina-Pagola, J.E. (2018). Multi-graph Frequent Approximate Subgraph Mining for Image Clustering. In: Hernández Heredia, Y., Milián Núñez, V., Ruiz Shulcloper, J. (eds) Progress in Artificial Intelligence and Pattern Recognition. IWAIPR 2018. Lecture Notes in Computer Science(), vol 11047. Springer, Cham. https://doi.org/10.1007/978-3-030-01132-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-01132-1_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-01131-4

  • Online ISBN: 978-3-030-01132-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics