Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
A training algorithm for optimal margin classifiers
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
The nature of statistical learning theory
The nature of statistical learning theory
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Relational Data Mining
Kernels for Semi-Structured Data
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
A New Measure of Edit Distance between Labeled Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Kernel Methods for Pattern Analysis
Kernel Methods for Pattern Analysis
Kernels and Distances for Structured Data
Machine Learning
Analysis of tree edit distance algorithms
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
A theoretical analysis of alignment and edit problems for trees
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Hi-index | 0.00 |
We often meet the tree decomposition task in the tree kernel computing. And tree decomposition tends to vary under different tree mapping constraint. In this paper, we first introduce the general tree decomposition function, and compare the three variants of the function corresponding to different tree mapping. Then we will give a framework to generalize the kernels based on tree-to-tree decomposition with the decomposition function.