著者

片岡哲也 猪口 明博 Kataoka Tetsuya Inokuchi Akihiro

雑誌

SIG-DOCMAS = SIG-DOCMAS

巻号頁・発行日

vol.9, no.1, pp.1-7, 2015-02-27

---

In this paper, we propose a novel graph kernel based on Hadamard cords. Our idea is based on the Walsh-Hadamard matrix and uneven division of xed-length bit string that expresses each vertex label. By updating all vertex labels in graphs iteratively with their adjacent vertices, each vertex is expressed as the bit string including features of its vertex label and vertex labels within h steps from the vertex. The time complexity of the proposed graph kernel is linear in the number of vertices of graphs and the length of the bit string. According to experiments we have conducted, our kernel outperforms state-of-the-art graph kernels with respect to both scalability and expressiveness.