George Manias, Dimitris Apostolopoulos, et al.
DCOSS-IoT 2023
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.
George Manias, Dimitris Apostolopoulos, et al.
DCOSS-IoT 2023
Segev Shlomov, Avi Yaeli
CHI 2024
Aditya Malik, Nalini Ratha, et al.
CAI 2024
Joseph Y. Halpern
aaai 1996