基于几何的字符串子序列核的高效计算
Efficient Geometric-based Computation of the String Subsequence Kernel
摘要:
核方法是机器学习中的有力工具。它们必须在计算上高效。在本文中,我们提出了一种新的基于几何的方法来计算字符串子序列核(SSK)。我们的主要思想是将SSK计算归结为范围查询问题。我们首先构造一个匹配列表$L(s,t)=\{(i,j):s_{i}=t_{j}\}$,其中$s$和$t$是要比较的字符串;这样的匹配列表只包含对结果有贡献的所需数据。为了有效地计算SSK,我们将分层范围树数据结构扩展为分层范围和树,即范围聚合数据结构。整个过程需要$ O(p|L|\log|L|)$时间和$O(|L|\log|L|)$空间,其中$|L|$是匹配列表的大小,$p$是SSK的长度。我们提出了经验评估我们的方法对动态和稀疏编程方法都综合生成的数据和新闻专线的文章数据。这样的实验表明,我们的方法的效率,除了很短的字符串大的字母大小。此外,与稀疏动态方法相比,所提出的方法在长字符串上绝对优于稀疏动态方法。
英文摘要:
Kernel methods are powerful tools in machine learning. They have to be computationally efficient. In this paper, we present a novel Geometric-based approach to compute efficiently the string subsequence kernel (SSK). Our main idea is that the SSK computation reduces to range query problem. We started by the construction of a match list $L(s,t)=\{(i,j):s_{i}=t_{j}\}$ where $s$ and $t$ are the strings to be compared; such match list contains only the required data that contribute to the result. To compute efficiently the SSK, we extended the layered range tree data structure to a layered range sum tree, a range-aggregation data structure. The whole process takes $ O(p|L|\log|L|)$ time and $O(|L|\log|L|)$ space, where $|L|$ is the size of the match list and $p$ is the length of the SSK. We present empiric evaluations of our approach against the dynamic and the sparse programming approaches both on synthetically generated data and on newswire article data. Such experiments show the efficiency of our approach for large alphabet size except for very short strings. Moreover, compared to the sparse dynamic approach, the proposed approach outperforms absolutely for long strings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。