Hierarchical directed acyclic graph kernel
Hierarchical directed acyclic graph kernel
复制标题
分层有向无环图内核
DOI：
10.1002/scj.20485
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
Eisaku Maeda
中科院分区：
文献类型：
--
作者：
Jun Suzuki;Yutaka Sasaki;Eisaku Maeda
本文设计了一种新的核函数的自然语言处理任务。新的内核，称为分层有向无环图（HDAG）内核，直接接受其节点可能包含图的图。HDAG数据结构需要充分反映自然语言数据固有的语法和语义结构。在本文中，我们定义了核函数，并描述了如何实现高效的计算。实验结果表明，所提出的核函数上级其他核函数，序列核，依赖结构核和词袋核。© 2006 Wiley Periodicals，Inc. Syst Comp Jpn，37（10）：58-68，2006;在线发表于Wiley InterScience（www.interscience.wiley.com）。DOI 10.1002/scj.20485
This paper devises a novel kernel function for natural language processing tasks. The new kernels, called Hierarchical Directed Acyclic Graph (HDAG) kernels, directly accept graphs whose nodes could contain graphs. HDAG data structures are needed to fully reflect the syntactic and semantic structures inherently possessed by natural language data. In this paper, we define the kernel function and describe how to achieve efficient calculation. Experimental results demonstrate that the proposed kernels are superior to other kernel functions, sequence kernels, dependency structure kernels, and bag‐of‐words kernels. © 2006 Wiley Periodicals, Inc. Syst Comp Jpn, 37(10): 58–68, 2006; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.20485