Dynamic Labeling and Tree Kernels with Gap Penalties
Dynamic Labeling and Tree Kernels with Gap Penalties
复制标题
动态标签和具有间隙惩罚的树核
DOI：
10.1109/scis-isis.2012.6505348
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
T.Kuboyama
中科院分区：
文献类型：
--
作者：
K.Shin;T.Kuboyama
核函数的正定性和计算效率是核函数设计的两个重要因素。在本文中，我们专注于内核的树，并显示了一个重要的和有用的技术来设计正定树的内核，可以有效地计算的基础上的动态规划方法。我们称之为动态标签技术。结合可分割的字符串内核技术，这种技术产生了一个有用的框架来设计树内核，具有更广泛的应用范围相比，在文献中已知的框架。
Positive definiteness and computational efficiency are two important factors in designing kernels. In this paper, we focus on kernels for trees, and show an important and useful technique to design positive definite tree kernels that can be computed efficiently based on the dynamic programming methodology. We call the technique dynamic labeling. In combination with the partitionable string kernel technique, this technique yields a useful framework to design tree kernels that has a much wider range of application compared with the framework known in the literature.