Susan L. Spraragen
International Conference on Design and Emotion 2010
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.
Susan L. Spraragen
International Conference on Design and Emotion 2010
Miao Guo, Yong Tao Pei, et al.
WCITS 2011
Barry K. Rosen
SWAT 1972
Yehuda Naveli, Michal Rimon, et al.
AAAI/IAAI 2006