An aligned subtree kernel for weighted graphs

Bai, Lu, Rossi, Luca, Zhang, Zhihong and Hancock, Edwin R. (2015). An aligned subtree kernel for weighted graphs. IN: Proceedings of the 32nd International Conference on Machine Learning. Bach, Francis and Blei, David (eds) JMLR workshop and conference proceedings . UNSPECIFIED.

Abstract

In this paper, we develop a new entropic matching kernel for weighted graphs by aligning depth-based representations. We demonstrate that this kernel can be seen as an aligned subtree kernel that incorporates explicit subtree correspondences, and thus addresses the drawback of neglecting the relative locations between substructures that arises in the R-convolution kernels. Experiments on standard datasets demonstrate that our kernel can easily outperform state-of-the-art graph kernels in terms of classification accuracy.

Divisions: Engineering & Applied Sciences
Engineering & Applied Sciences > Systems analytics research institute (SARI)
Additional Information: © The authors
Event Title: 32nd International Conference on Machine Learning
Event Type: Other
Event Location: Lille Grand Palais
Event Dates: 2015-07-06 - 2015-07-11
Full Text Link: http://jmlr.org ... s/v37/bai15.pdf
Related URLs:
Published Date: 2015
Authors: Bai, Lu
Rossi, Luca ( 0000-0002-6116-9761)
Zhang, Zhihong
Hancock, Edwin R.

Download

[img]

Version: Published Version


Export / Share Citation


Statistics

Additional statistics for this record