On a Family of Decomposable Kernels on Sequences
원문 초록
In many applications data is naturally presented in terms of orderings of some basic elements or symbols. Reasoning about such data requires a notion of similarity capable of handling sequences of different lengths. In this paper we describe a family of Mercer kernel functions for such sequentially structured data. The family is characterized by a decomposable structure in terms of symbol-level and structure-level similarities, representing a specific combination of kernels which allows for efficient computation. We provide an experimental evaluation on sequential classification tasks comparing kernels from our family of kernels to a state of the art sequence kernel called the Global Alignment kernel which has been shown to outperform Dynamic Time Warping
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Support Vector Machines with Time Series Distance Kernels for Action Classification
ActAlign: Zero-Shot Fine-Grained Video Classification via Language-Guided Sequence Alignment
TimePoint: Accelerated Time Series Alignment via Self-Supervised Keypoint and Descriptor Learning
Semi-Supervised Image-Based Narrative Extraction: A Case Study with Historical Photographic Records
Using Instruction-Tuned Large Language Models to Identify Indicators of Vulnerability in Police Incident Narratives
Automatic Differentiation-based Full Waveform Inversion with Flexible Workflows
토론
이 논문과 연결된 포럼 글이 아직 없습니다.