Hierarchical directed acyclic graph kernel

Jun Suzuki, Yutaka Sasaki, Eisaku Maeda

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)58-68
Number of pages11
JournalSystems and Computers in Japan
Issue number10
Publication statusPublished - 2006 Sept


  • Art of kernel functions
  • Hierarchical directed acyclic graph
  • Kernel methods
  • Natural language processing


Dive into the research topics of 'Hierarchical directed acyclic graph kernel'. Together they form a unique fingerprint.

Cite this