Hadamard Code Graph Kernels for Classifying Graphs
Year: 2016
Type: conference-paper
Abstract: Kernel methods such as Support Vector Machines (SVMs) are becoming increasingly popular because of their high performance on graph classification problems. In this paper, we propose two novel graph kernels called the Hadamard Code Kernel (HCK) and the Shortened HCK (SHCK). These kernels are based on the Hadamard code, which is used in spread spectrum-based communication technologies to spread message signals. The proposed graph kernels are equivalent to the Neighborhood Hash Kernel (NHK), one of the fastest graph kernels, and comparable to the Weisfeiler-Lehman Subtree Kernel (WLSK), one of the most accurate graph kernels. The fundamental performance and practicality of the proposed graph kernels are evaluated using three real-world datasets.
Authors: Tetsuya Kataoka, Akihiro Inokuchi
Institution: Kwansei Gakuin University
Language: English
Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W2342762966
