Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
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.
Joseph Y. Halpern
aaai 1996
Sashi Novitasari, Takashi Fukuda, et al.
INTERSPEECH 2025
Zhikun Yuen, Paula Branco, et al.
DSAA 2023
Hannah Kim, Celia Cintas, et al.
IJCAI 2023