Skip to main content
SpringerLink
Log in

The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections

  • Conference paper
  • First Online:
Similarity Search and Applications (SISAP 2021)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 13058))

Included in the following conference series:

  • 886 Accesses

Abstract

The inference of minimum spanning arborescences within a set of objects is a general problem which translates into numerous application-specific unsupervised learning tasks. We introduce a unified and generic structure called edit arborescence that relies on edit paths between data in a collection, as well as the Minimum Edit Arborescence Problem, which asks for an edit arborescence that minimizes the sum of costs of its inner edit paths. Through the use of suitable cost functions, this generic framework allows to model a variety of problems. In particular, we show that by introducing encoding size preserving edit costs, it can be used as an efficient method for compressing collections of labeled graphs. Experiments on various graph datasets, with comparisons to standard compression tools, show the potential of our method.

Supported by Agence Nationale de la Recherche (ANR), projects STAP ANR-17-CE23-0021 and DELCO ANR-19-CE23-0016. FY acknowledges the support of the ANR as part of the “Investissements d’avenir” program, reference ANR-19-P3IA-0001 (PRAIRIE 3IA Institute).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    https://brunl01.users.greyc.fr/CHEMISTRY/index.html.

  2. 2.

    https://www.kaggle.com/borismarjanovic/price-volume-data-for-all-us-stocks-etfs.

  3. 3.

    https://userpages.uni-koblenz.de/~ist/GXL/index.php.

  4. 4.

    https://github.com/lucasgneccoh/gedlib.

References

  1. Adler, M., Mitzenmacher, M.: Towards compressing web graphs. In: Proceedings of the Data Compression Conference, p. 203. IEEE Computer Society (2001). https://doi.org/10.5555/882454.875027

  2. Almodaresi, F., Pandey, P., Ferdman, M., Johnson, R., Patro, R.: An efficient, scalable, and exact representation of high-dimensional color information enabled using de bruijn graph search. J. Comput. Biol. 27(4), 485–499 (2020). https://doi.org/10.1089/cmb.2019.0322

  3. Besta, M., Hoefler, T.: Survey and taxonomy of lossless graph compression and space-efficient graph representations. CoRR arXive:1806.01799 [cs.DS] (2018)

    Google Scholar 

  4. Besta, M., et al.: Demystifying graph databases: analysis and taxonomy of data organization, system designs, and graph queries. CoRR arXive:1910.09017 [cs.DB] (2019)

    Google Scholar 

  5. Blumenthal, D.B.: New Techniques for Graph Edit Distance Computation. Ph.D. thesis, Free University of Bozen-Bolzano (2019)

    Google Scholar 

  6. Blumenthal, D.B., Boria, N., Gamper, J., Bougleux, S., Brun, L.: Comparing heuristics for graph edit distance computation. VLDB J. 29(1), 419–458 (2020). https://doi.org/10.1007/s00778-019-00544-1

  7. Blumenthal, D.B., Bougleux, S., Gamper, J., Brun, L.: GEDLIB: A C++ library for graph edit distance computation. In: Conte, D., Ramel, J.Y., Foggia, P. (eds.) Graph-Based Representations in Pattern Recognition. GbRPR 2019. Lecture Notes in Computer Science, 11510, 14–24. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-20081-7_2

  8. Boldi, P., Vigna, S.: The webgraph framework i: Compression techniques. In: WWW 2004, pp. 595–602 (2004). https://doi.org/10.1145/988672.988752

  9. Bookstein, A., Klein, S.: Compression of correlated bit-vectors. Inf. Syst. 16(4), 387–400 (1991). https://doi.org/10.1016/0306-4379(91)90030-D

  10. Chwatala, A.M., Raidl, G.R., Oberlechner, K.: Phylogenetic comparative methods. J. Math. Model. Algorithms 8, 293–334 (2009). https://doi.org/10.1007/s10852-009-9109-1

  11. Coelho, R., Gilmore, C.G., Lucey, B., Richmond, P., Hutzler, S.: The evolution of interdependence in world equity markets-evidence from minimum spanning trees. Physica A 376, 455–466 (2007). https://doi.org/10.1016/j.physa.2006.10.045

  12. Cornwell, W., Nakagawa, S.: Phylogenetic comparative methods. Curr. Biol. 27(9), R333–R336 (2017). https://doi.org/10.1016/j.cub.2017.03.049

  13. Edmonds, J.: Optimum branchings. J. Res. Natl. Bur. Stand. B 71(4), 233–240 (1967). https://doi.org/10.6028/jres.071b.032

  14. Fischetti, M., Toth, P.: An efficient algorithm for the min-sum arborescence problem on complete digraphs. INFORMS J. Comput. 5(4), 426–434 (1993). https://doi.org/10.1287/ijoc.5.4.426

  15. Gnecco, L., Boria, N., Bougleux, S., Yger, F., Blumenthal, D.B.: The minimum edit arborescence problem and its use in compressing graph collections [extended version] (2021). https://arxiv.org/abs/2107.14525

  16. Guralnik, V., Srivastava, J.: Event detection from time series data. In: Fayyad, U.M., Chaudhuri, S., Madigan, D. (eds.) SIGKDD 1999, pp. 33–42. ACM (1999). https://doi.org/10.1145/312129.312190

  17. Liu, T., Coletti, P., Dignös, A., Gamper, J., Murgia, M.: Correlation graph analytics for stock time series data. In: EDBT 2021 (2021). https://edbt2021proceedings.github.io/docs/p173.pdf

  18. Luo, J., Narasimhan, K., Barzilay, R.: Unsupervised learning of morphological forests. Trans. Assoc. Comput. Linguist. 5, 353–364 (2017)

    Google Scholar 

  19. Moschitti, A., Pighin, D., Basili, R.: Semantic role labeling via tree kernel joint inference. In: CoNLL 2006, pp. 61–68. ACL (2006)

    Google Scholar 

  20. Riesen, K.: Structural Pattern Recognition with Graph Edit Distance: Approximation, Algorithms and Applications. Advances in Computer Vision and Pattern Recognition. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-319-27252-8

  21. Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., et al. (eds.) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2008. Lecture Notes in Computer Science, 5342, 287–297. Springer, Berlin, Heidelberg (2008). https://doi.org/10.1007/978-3-540-89689-0_33

  22. Sourek, G., Zelezny, F., Kuzelka, O.: Lossless compression of structured convolutional models via lifting. CoRR (2021). arXiv:2007.06567 [cs.LG]

  23. Tarjan, R.E.: Finding optimum branchings. Networks 7(1), 25–35 (1977). https://doi.org/10.1002/net.3230070103

  24. Zeng, Z., Tung, A.K.H., Wang, J., Feng, J., Zhou, L.: Comparing stars: on approximating graph edit distance. Proc. VLDB Endow. 2(1), 25–36 (2009). https://doi.org/10.14778/1687627.1687631

  25. Zheng, W., Zou, L., Lian, X., Wang, D., Zhao, D.: Efficient graph similarity search over large graph databases. IEEE Trans. Knowl. Data Eng. 27(4), 964–978 (2015). https://doi.org/10.1109/TKDE.2014.2349924

Download references

Author information

Authors and Affiliations

  1. PSL Université Paris-Dauphine, LAMSADE, Paris, France

    Lucas Gnecco, Nicolas Boria & Florian Yger

  2. UNICAEN, ENSICAEN, CNRS, GREYC, Caen, France

    Sébastien Bougleux

  3. Department Artificial Intelligence in Biomedical Engineering (AIBE), Friedrich-Alexander University Erlangen-Nürnberg (FAU), Erlangen, Germany

    David B. Blumenthal

Authors
  1. Lucas Gnecco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicolas Boria
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sébastien Bougleux
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Florian Yger
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. David B. Blumenthal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lucas Gnecco .

Editor information

Editors and Affiliations

  1. National University of San Luis, San Luis, Argentina

    Nora Reyes

  2. University of St Andrews, St Andrews, UK

    Richard Connor

  3. University of Vienna, Vienna, Austria

    Nils Kriege

  4. Kiel University, Kiel, Germany

    Daniyal Kazempour

  5. University of Bologna, Bologna, Italy

    Ilaria Bartolini

  6. TU Dortmund University, Dortmund, Germany

    Erich Schubert

  7. TU Dortmund University, Dortmund, Germany

    Jian-Jia Chen

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gnecco, L., Boria, N., Bougleux, S., Yger, F., Blumenthal, D.B. (2021). The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections. In: Reyes, N., et al. Similarity Search and Applications. SISAP 2021. Lecture Notes in Computer Science(), vol 13058. Springer, Cham. https://doi.org/10.1007/978-3-030-89657-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-89657-7_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-89656-0

  • Online ISBN: 978-3-030-89657-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation