Flexible tree matching

Authors:
Ranjitha Kumar;Jerry O. Talton;Salman Ahmad;Tim Roughgarden;Scott R. Klemmer
Affiliations:
Stanford University, Department of Computer Science;Stanford University, Department of Computer Science;Stanford University, Department of Computer Science;Stanford University, Department of Computer Science;Stanford University, Department of Computer Science
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Year:
2011

Citing 7
Cited 2

On the editing distance between unordered labeled trees

Information Processing Letters
Meaningful change detection in structured data

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
A survey on tree edit distance and related problems

Theoretical Computer Science
Discriminative training methods for hidden Markov models: theory and experiments with perceptron algorithms

EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
An optimal decomposition algorithm for tree edit distance

ACM Transactions on Algorithms (TALG)
Bricolage: example-based retargeting for web design

Proceedings of the SIGCHI Conference on Human Factors in Computing Systems

Data-driven interactions for web design

Adjunct proceedings of the 25th annual ACM symposium on User interface software and technology
3D Diff: an interactive approach to mesh differencing and conflict resolution

SIGGRAPH Asia 2012 Technical Briefs

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tree-matching problems arise in many computational domains. The literature provides several methods for creating correspondences between labeled trees; however, by definition, tree-matching algorithms rigidly preserve ancestry. That is, once two nodes have been placed in correspondence, their descendants must be matched as well. We introduce flexible tree matching, which relaxes this rigid requirement in favor of a tunable formulation in which the role of hierarchy can be controlled. We show that flexible tree matching is strongly NP-complete, give a stochastic approximation algorithm for the problem, and demonstrate how structured prediction techniques can learn the algorithm's parameters from a set of example matchings. Finally, we present results from applying the method to tasks in Web design.