Hierarchical directed acyclic graph kernel

  1. Jun Suzuki1,2,
  2. Yutaka Sasaki1,†,
  3. Eisaku Maeda1

Article first published online: 12 JUL 2006

DOI: 10.1002/scj.20485

Issue

Systems and Computers in Japan

Systems and Computers in Japan

Volume 37, Issue 10, pages 58–68, September 2006

Additional Information

How to Cite

Suzuki, J., Sasaki, Y. and Maeda, E. (2006), Hierarchical directed acyclic graph kernel. Systems and Computers in Japan, 37: 58–68. doi: 10.1002/scj.20485

Author Information

  1. 1

    NTT Communication Science Laboratories, NTT Corporation, Kyoto, 619-0237 Japan

  2. 2

    Graduate School of Information Science, Nara Institute of Science and Technology, Nara, 630-0192 Japan

  1. †

    Presently with Spoken Language Translation Research Laboratories, Advanced Telecommunications Research Institute International, Kyoto, 619-0237 Japan

Publication History

  1. Issue published online: 12 JUL 2006
  2. Article first published online: 12 JUL 2006

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

Get PDF (607K)

Keywords:

  • kernel methods;
  • art of kernel functions;
  • hierarchical directed acyclic graph;
  • natural language processing

Abstract

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

Get PDF (607K)