Polynomial-Time Metrics for Attributed Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fuzzy Measures on the Gene Ontology for Gene Product Similarity
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Moment-Based Pattern Representation Using Shape and Grayscale Features
IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I
Decision trees for error-tolerant graph database filtering
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Similarity measure models and algorithms for hierarchical cases
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
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.