Skip to main content

On Computing Tractable Variations of Unordered Tree Edit Distance with Network Algorithms

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNAI,volume 7258)

Abstract

The problem of computing the standard edit distance between unordered trees is known to be intractable. To circumvent this hardness result, several tractable variations have been proposed. The algorithms of these variations include the submodule of a network algorithm, either the minimum cost maximum flow algorithm or the maximum weighted bipartite matching algorithm. In this paper, we point out that these network algorithms are replaceable, and give the experimental results of computing these variations with both network algorithms.

Keywords

  • Time Complexity
  • Minimum Cost
  • Edit Distance
  • Complete Bipartite Graph
  • Edit Operation

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This work is partially supported by Grand-in-Aid for Scientific Research 20500126, 20240014, 21500145, 22240010 and 23300061 from the Ministry of Education, Culture, Sports, Science and Technology, Japan.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows. Prentice Hall (1993)

    Google Scholar 

  2. Chawathe, S.S.: Comparing hierarchical data in external memory. In: Proc. VLDB 1999, pp. 90–101 (1999)

    Google Scholar 

  3. Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for network problems. SIAM J. Comput. 18, 1013–1036 (1989)

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. 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)

    CrossRef  Google Scholar 

  5. Kuboyama, T.: Matching and learning in trees, Ph.D thesis, University of Tokyo (2007), http://tk.cc.gakushuin.ac.jp/doc/kuboyama2007phd.pdf

  6. Kuboyama, T., Shin, K., Kashima, H.: Flexible tree kernels based on counting the number of tree mappings. In: Proc. MLG 2006, pp. 61–72 (2006)

    Google Scholar 

  7. Lu, S.-Y.: A tree-to-tree distance and its application to cluster analysis. IEEE Trans. Pattern Anal. Mach. Intell. 1, 219–224 (1979)

    MATH  Google Scholar 

  8. Luke, S., Panait, L.: A survey and comparison of tree generation algorithms. In: Proc. GECCO 2001, pp. 81–88 (2001)

    Google Scholar 

  9. Selkow, S.M.: The tree-to-tree editing problem. Inform. Process. Lett. 6, 184–186 (1977)

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Tai, K.-C.: The tree-to-tree correction problem. J. ACM 26, 422–433 (1979)

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Wang, J.T.L., Zhang, K.: Finding similar consensus between trees: An algorithm and a distance hierarchy. Pattern Recog. 34, 127–137 (2001)

    CrossRef  MATH  Google Scholar 

  12. Wang, Y., DeWitt, D.J., Cai, J.-Y.: X-Diff: An effective change detection algorithm for XML documents. In: Proc. ICDE 2003, pp. 519–530 (2003)

    Google Scholar 

  13. Zhang, K.: Algorithms for the constrained editing distance between ordered labeled trees and related problems. Pattern Recog. 28, 463–474 (1995)

    CrossRef  Google Scholar 

  14. Zhang, K.: A constrained edit distance between unordered labeled trees. Algorithmica 15, 205–222 (1996)

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. Zhang, K., Jiang, T.: Some MAX SNP-hard results concerning unordered labeled trees. Inform. Process. Let. 49, 249–254 (1994)

    CrossRef  MathSciNet  MATH  Google Scholar 

  16. Zhang, K., Statman, R., Shasha, D.: On the editing distance between unordered labeled trees. Inform. Process. Let. 42, 133–139 (1992)

    CrossRef  MathSciNet  MATH  Google Scholar 

  17. Zhang, K., Wang, J., Shasha, D.: On the editing distance between undirected acyclic graphs. Int. J. Found. Comput. Sci. 7, 43–58 (1995)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamamoto, Y., Hirata, K., Kuboyama, T. (2012). On Computing Tractable Variations of Unordered Tree Edit Distance with Network Algorithms. In: Okumura, M., Bekki, D., Satoh, K. (eds) New Frontiers in Artificial Intelligence. JSAI-isAI 2011. Lecture Notes in Computer Science(), vol 7258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32090-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32090-3_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32089-7

  • Online ISBN: 978-3-642-32090-3

  • eBook Packages: Computer ScienceComputer Science (R0)