Fearghal O'Donncha, Albert Akhriev, et al.
Big Data 2021
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.
Fearghal O'Donncha, Albert Akhriev, et al.
Big Data 2021
Vicki L Hanson, Edward H Lichtenstein
Cognitive Psychology
Xiaoxiao Guo, Shiyu Chang, et al.
AAAI 2019
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI