Four metrics for efficiently comparing attributed trees
Andrea Torsello, D. Hidovic, Marcello Pelillo · Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004. · 2004
We address the problem of comparing attributed trees and propose four novel distance metrics centered around the notion of a maximal similarity common subtree, and hence can be computed in polynomial time. We experimentally validate the usefulness of our metrics on shape matching tasks, and compare them with edit-distance.