The Path Kernel: A Novel Kernel for Sequential Data
Lists
Only you see this
Abstract
We define a novel kernel function for finite sequences of arbitrary length which we call the path kernel. We evaluate this kernel in a classification scenario using synthetic data sequences and show that our kernel can outperform state of the art sequential similarity measures. Furthermore, we find that, in our experiments, a clustering of data based on the path kernel results in much improved interpretability of such clusters compared to alternative approaches such as dynamic time warping or the global alignment kernel.
BibTeX
@inproceedings{baisero2013path,
author = {Andrea Baisero and Florian T. Pokorny and Danica Kragic and Carl Henrik Ek},
title = {{The Path Kernel: A Novel Kernel for Sequential Data}},
booktitle = {ICPRAM (Selected Papers)},
year = {2013},
doi = {10.1007/978-3-319-12610-4\_5},
}Loading related content...