Advertisement

Earth Mover’s Distance Between Rooted Labeled Unordered Trees Formulated from Complete Subtrees

  • Taiga Kawaguchi
  • Takuya Yoshino
  • Kouichi HirataEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11351)

Abstract

In this paper, we introduce earth mover’s distances (EMDs, for short) for rooted labeled trees formulated from complete subtrees. First, we formulate the EMDs whose signatures are all of the pairs of a complete subtree and the ratio of its frequency and whose ground distances are either the tractable variations of the tree edit distance, provided from the restricted mappings in the Tai mapping hierarchy, or the complete subtree histogram distance. Then, we show that all of the EMDs are metrics and we can compute them in \(O(n^3\log n)\) time, where n is the maximum number of nodes in given two trees. Finally, we give experimental results of computing EMDs for several data, by comparing the EMDs with their ground distances.

References

  1. 1.
    Akutsu, T., Fukagawa, D., Halldórsson, M.M., Takasu, A., Tanaka, K.: Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees. Theoret. Comput. Sci. 470, 10–22 (2013)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Chawathe, S.S.: Comparing hierarchical data in external memory. In: Proceedings of VLDB 1999, pp. 90–101 (1999)Google Scholar
  3. 3.
    Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Trans. Algo. 6(1), 2 (2009)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Gollapudi, S., Panigrahy, S.: The power of two min-hashes for similarity search among hierarchical data objects. In: Proceedings of PODS 2008, pp. 211–219 (2008)Google Scholar
  5. 5.
    Hirata, K., Yamamoto, Y., Kuboyama, T.: Improved MAX SNP-hard results for finding an edit distance between unordered trees. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 402–415. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-21458-5_34CrossRefGoogle Scholar
  6. 6.
    Jiang, T., Wang, L., Zhang, K.: Alignment of trees - an alternative to tree edit. Theoret. Comput. Sci. 143, 137–148 (1995)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Kawaguchi, T., Hirata, K.: On earth mover’s distance based on complete subtrees for rooted labeled trees. In: Proceedings of SISA 2017, pp. 225–228 (2017)Google Scholar
  8. 8.
    Kawaguchi, T., Hirata, K.: Earth mover’s distance for rooted labeled unordered trees based on Tai mapping hierarchy. In: Proceedings of ICPRAM 2018, pp. 159–168 (2018)Google Scholar
  9. 9.
    Kuboyama, T.: Matching and learning in trees. Ph.D. thesis, University of Tokyo (2007)Google Scholar
  10. 10.
    Rubner, Y., Tomasi, C., Guibas, L.J.: The earth mover’s distance as a metric for image retrieval. Int. J. Comput. Vision 40, 99–121 (2007)CrossRefGoogle Scholar
  11. 11.
    Selkow, S.M.: The tree-to-tree editing problem. Inform. Process. Lett. 6, 184–186 (1977)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Tai, K.-C.: The tree-to-tree correction problem. J. ACM 26, 422–433 (1979)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Valiente, G.: An efficient bottom-up distance between trees. In: Proceedings of SPIRE 2001, pp. 212–219 (2001)Google Scholar
  14. 14.
    Yamamoto, Y., Hirata, K., Kuboyama, T.: Tractable and intractable variations of unordered tree edit distance. Int. J. Found. Comput. Sci. 25, 307–329 (2014)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Yoshino, T., Hirata, K.: Tai mapping hierarchy for rooted labeled trees through common subforest. Theory Comput. Syst. 60, 759–783 (2017)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Zhang, K.: Algorithms for the constrained editing distance between ordered labeled trees and related problems. Pattern Recog. 28, 463–474 (1995)CrossRefGoogle Scholar
  17. 17.
    Zhang, K.: A constrained edit distance between unordered labeled trees. Algorithmica 15, 205–222 (1996)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Zhang, K., Jiang, T.: Some MAX SNP-hard results concerning unordered labeled trees. Inform. Process. Lett. 49, 249–254 (1994)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Zhang, K., Wang, J., Shasha, D.: On the editing distance between undirected acyclic graphs. Int. J. Found. Comput. Sci. 7, 43–58 (1996)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Taiga Kawaguchi
    • 1
  • Takuya Yoshino
    • 2
  • Kouichi Hirata
    • 2
    Email author
  1. 1.Graduate School of Computer Science and Systems EngineeringKyushu Institute of TechnologyIizukaJapan
  2. 2.Department of Artificial IntelligenceKyushu Institute of TechnologyIizukaJapan

Personalised recommendations