open access

https://hdl.handle.net/2115/62276

Cartesian Kernel : An Efficient Alternative to the Pairwise Kernel

英語

link prediction

2010-10

Institute of Electronics, Information and Communication Engineers

IEICE Transactions on Information and Systems

E93-D(10)

2672-2679

Pairwise classification has many applications including network prediction, entity resolution, and collaborative filtering. The pairwise kernel has been proposed for those purposes by several research groups independently, and has been used successfully in several fields. In this paper, we propose an efficient alternative which we call a Cartesian kernel. While the existing pairwise kernel (which we refer to as the Kronecker kernel) can be interpreted as the weighted adjacency matrix of the Kronecker product graph of two graphs, the Cartesian kernel can be interpreted as that of the Cartesian graph, which is more sparse than the Kronecker product graph. We discuss the generalization bounds of the two pairwise kernels by using eigenvalue analysis of the kernel matrices. Also, we consider the N-wise extensions of the two pairwise kernels. Experimental results show the Cartesian kernel is much faster than the Kronecker kernel, and at the same time, competitive with the Kronecker kernel in predictive performance.

学術雑誌論文

Version of Record

Copyright ©2010 The Institute of Electronics, Information and Communication Engineers

0916-8532

1745-1361