Journal
PATTERN RECOGNITION LETTERS
Volume 143, Issue -, Pages 113-121Publisher
ELSEVIER
DOI: 10.1016/j.patrec.2021.01.003
Keywords
Graph kernels; Linear patterns; Python implementation
Categories
Funding
- CSC (China Scholarship Council) [20170180 0 094]
- French National Research Agency (ANR) [ANR-18-CE23-0014]
Ask authors/readers for more resources
This paper introduces graphkit-learn, the first Python library for efficient computation of graph kernels based on linear patterns. It provides strategies to address the computational complexity issue and experiments show the relevance of the proposed library.
This paper presents graphkit-learn , the first Python library for efficient computation of graph kernels based on linear patterns, able to address various types of graphs. Graph kernels based on linear patterns are thoroughly implemented, each with specific computing methods, as well as two well-known graph kernels based on non-linear patterns for comparative analysis. Since computational complexity is an Achilles' heel of graph kernels, we provide several strategies to address this critical issue, including parallelization, the trie data structure, and the FCSP method that we extend to other kernels and edge comparison. All proposed strategies save orders of magnitudes of computing time and memory usage. Moreover, all the graph kernels can be simply computed with a single Python statement, thus are appealing to researchers and practitioners. For the convenience of use, an advanced model selection procedure is provided for both regression and classification problems. Experiments on synthesized datasets and 11 real-world benchmark datasets show the relevance of the proposed library. (c) 2021 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available