A transitive aligned Weisfeiler-Lehman subtree kernel

Lu Bai, Luca Rossi, Lixin Cui, Edwin R. Hancock

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we develop a new transitive aligned Weisfeiler-Lehman subtree kernel. This kernel not only overcomes the shortcoming of ignoring correspondence information between isomorphic substructures that arises in existing R-convolution kernels, but also guarantees the transitivity between the correspondence information that is not available for existing matching kernels. Our kernel outperforms state-of-the-art graph kernels in terms of classification accuracy on standard graph datasets.

Original languageEnglish
Title of host publication2016 23rd International Conference on Pattern Recognition, ICPR
PublisherIEEE
Pages396-401
Number of pages6
ISBN (Electronic)978-1-5090-4847-2
DOIs
Publication statusPublished - 13 Apr 2017
Event23rd International Conference on Pattern Recognition: ICPR 2016 - Cancun, Mexico
Duration: 4 Dec 20168 Dec 2016

Conference

Conference23rd International Conference on Pattern Recognition
CountryMexico
CityCancun
Period4/12/168/12/16

Fingerprint

Convolution

Bibliographical note

-© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Cite this

Bai, L., Rossi, L., Cui, L., & Hancock, E. R. (2017). A transitive aligned Weisfeiler-Lehman subtree kernel. In 2016 23rd International Conference on Pattern Recognition, ICPR (pp. 396-401). IEEE. https://doi.org/10.1109/ICPR.2016.7899666
Bai, Lu ; Rossi, Luca ; Cui, Lixin ; Hancock, Edwin R. / A transitive aligned Weisfeiler-Lehman subtree kernel. 2016 23rd International Conference on Pattern Recognition, ICPR. IEEE, 2017. pp. 396-401
@inproceedings{9fb68c789c27452d81c90e6e2e1ba7f0,
title = "A transitive aligned Weisfeiler-Lehman subtree kernel",
abstract = "In this paper, we develop a new transitive aligned Weisfeiler-Lehman subtree kernel. This kernel not only overcomes the shortcoming of ignoring correspondence information between isomorphic substructures that arises in existing R-convolution kernels, but also guarantees the transitivity between the correspondence information that is not available for existing matching kernels. Our kernel outperforms state-of-the-art graph kernels in terms of classification accuracy on standard graph datasets.",
author = "Lu Bai and Luca Rossi and Lixin Cui and Hancock, {Edwin R.}",
note = "-{\circledC} 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.",
year = "2017",
month = "4",
day = "13",
doi = "10.1109/ICPR.2016.7899666",
language = "English",
pages = "396--401",
booktitle = "2016 23rd International Conference on Pattern Recognition, ICPR",
publisher = "IEEE",
address = "United States",

}

Bai, L, Rossi, L, Cui, L & Hancock, ER 2017, A transitive aligned Weisfeiler-Lehman subtree kernel. in 2016 23rd International Conference on Pattern Recognition, ICPR. IEEE, pp. 396-401, 23rd International Conference on Pattern Recognition, Cancun, Mexico, 4/12/16. https://doi.org/10.1109/ICPR.2016.7899666

A transitive aligned Weisfeiler-Lehman subtree kernel. / Bai, Lu; Rossi, Luca; Cui, Lixin; Hancock, Edwin R.

2016 23rd International Conference on Pattern Recognition, ICPR. IEEE, 2017. p. 396-401.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A transitive aligned Weisfeiler-Lehman subtree kernel

AU - Bai, Lu

AU - Rossi, Luca

AU - Cui, Lixin

AU - Hancock, Edwin R.

N1 - -© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

PY - 2017/4/13

Y1 - 2017/4/13

N2 - In this paper, we develop a new transitive aligned Weisfeiler-Lehman subtree kernel. This kernel not only overcomes the shortcoming of ignoring correspondence information between isomorphic substructures that arises in existing R-convolution kernels, but also guarantees the transitivity between the correspondence information that is not available for existing matching kernels. Our kernel outperforms state-of-the-art graph kernels in terms of classification accuracy on standard graph datasets.

AB - In this paper, we develop a new transitive aligned Weisfeiler-Lehman subtree kernel. This kernel not only overcomes the shortcoming of ignoring correspondence information between isomorphic substructures that arises in existing R-convolution kernels, but also guarantees the transitivity between the correspondence information that is not available for existing matching kernels. Our kernel outperforms state-of-the-art graph kernels in terms of classification accuracy on standard graph datasets.

UR - http://www.scopus.com/inward/record.url?scp=85019065361&partnerID=8YFLogxK

U2 - 10.1109/ICPR.2016.7899666

DO - 10.1109/ICPR.2016.7899666

M3 - Conference contribution

SP - 396

EP - 401

BT - 2016 23rd International Conference on Pattern Recognition, ICPR

PB - IEEE

ER -

Bai L, Rossi L, Cui L, Hancock ER. A transitive aligned Weisfeiler-Lehman subtree kernel. In 2016 23rd International Conference on Pattern Recognition, ICPR. IEEE. 2017. p. 396-401 https://doi.org/10.1109/ICPR.2016.7899666