Gang Liu, Michael Sun, et al.
ICLR 2025
We introduce a new convolution kernel for labeled ordered trees with arbitrary subgraph features, and an efficient algorithm for computing the kernel with the same time complexity as that of the parse tree kernel. The proposed kernel is extended to allow mutations of labels and structures without increasing the order of computation time. Moreover, as a limit of generalization of the tree kernels, we show a hardness result in computing kernels for unordered rooted labeled trees with arbitrary subgraph features.
Gang Liu, Michael Sun, et al.
ICLR 2025
Bing Zhang, Mikio Takeuchi, et al.
NAACL 2025
Ran Iwamoto, Kyoko Ohara
ICLC 2023
A. Manzalini, R. Minerva, et al.
ICIN 2013