paper-with-me

Papers

Kernels for sequentially ordered data

2016-01-29 · Franz J. Király, Harald Oberhauser

We present a novel framework for kernel learning with sequential data of any kind, such as time series, sequences of graphs, or strings. Our approach is based on signature features which can be seen as an ordered variant of sample (cross-)moments; it allows to obtain a "sequentialized" version of any static kernel. The sequential kernels are efficiently computable for discrete sequences and are shown to approximate a continuous moment form in a sampling sense. A number of known kernels for sequences arise as "sequentializations" of suitable static kernels: string kernels may be obtained as a special case, and alignment kernels are closely related up to a modification that resolves their open non-definiteness issue. Our experiments indicate that our signature-based sequential kernel framework may be a promising approach to learning with sequential data, such as time series, that allows to avoid extensive manual pre-processing.

📄 PDF Abstract BibTeX arXiv:1601.08169

Code (0)

등록된 구현이 없습니다.

Tasks

Time SeriesTime Series Analysis

Similar Papers 제목 키워드 기반

The Signature Kernel is the solution of a Goursat PDE

2020-06-26 · Cristopher Salvi, Thomas Cass, James Foster, Terry Lyons 외

Recently, there has been an increased interest in the development of kernel methods for learning with sequential data. The signature kernel is a learning tool with potential to handle irregularly sampled, multivariate ti…

Dimensionality ReductionGPUTime Series AnalysisTime Series Classification

KONG: Kernels for ordered-neighborhood graphs

2018-05-25 · NeurIPS 2018 12 · Moez Draief, Konstantin Kutzkov, Kevin Scaman, Milan Vojnovic

We present novel graph kernels for graphs with node and edge labels that have ordered neighborhoods, i.e. when neighbor nodes follow an order. Graphs with ordered neighborhoods are a natural data representation for evolv…

Sparse Signature Coefficient Recovery via Kernels

2024-12-11 · Daniil Shmelev, Cristopher Salvi

Central to rough path theory is the signature transform of a path, an infinite series of tensors given by the iterated integrals of the underlying path. The signature poses an effective way to capture sequentially ordere…

Ordered Decompositional DAG Kernels Enhancements

2015-07-13 · Giovanni Da San Martino, Nicolò Navarin, Alessandro Sperduti

In this paper, we show how the Ordered Decomposition DAGs (ODD) kernel framework, a framework that allows the definition of graph kernels from tree kernels, allows to easily define new state-of-the-art graph kernels. Her…

General Classification

Wigner kernels: body-ordered equivariant machine learning without a basis

2023-03-07 · Filippo Bigi, Sergey N. Pozdnyakov, Michele Ceriotti

Machine-learning models based on a point-cloud representation of a physical object are ubiquitous in scientific applications and particularly well-suited to the atomic-scale description of molecules and materials. Among …

Formation Energy