Answers are grounded in this paper and cite their sources.
Learning from tree-structured data has received increasing interest with the rapid growth of tree-encodable data in the World Wide Web, in biology, and in other areas. Our kernel function measures the similarity between two trees by counting the number of shared sub-patterns called tree q-grams, and runs, in effect, in linear time with respect to the number of tree nodes. We apply our kernel function with a support vector machine (SVM) to classify biological data, the glycans of several blood components. The experimental results show that our kernel function performs as well as one exclusively tailored to glycan properties.
No takes yet. Share an insight, caveat, or question.
Kuboyama et al. (2007) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: