Distance measures for hidden Markov models based on Hilbert space embeddings for time series classification

In order to build a classification scheme for sequences based on HMMs, the design of an appropriate distance is critical in both theoretical and practical fields. The Kullback-Leibler (KL) and Hidden Markov Stationary Distance (HSD) measures have been used to build classification schemes for sequences based on HMMs. However, it is well known that the KL measure is not a true metric and the metric HSD is for univariate data. Inspired by the recent emergence of metrics of probability measures in Reproducible Kernel Hilbert Spaces (RKHS), we introduce two new metrics between two stationary HMMs. The difference in the metrics based on RKHS with respect to the HSD metric is that our metrics can be calculated analytically and can be used for multivariate data. We evaluate the performance of the two metrics in the task of time-series classification, using the metrics within a K-Nearest Neighbor (KNN) classifier. The performance of the two metrics is evaluated in the voice database of the Massachusetts Eye and Ear Infirmary Disordered Voice Database from the Kay Elemetrics company. Results show that the proposed metrics provide competitive classification accuracies when compared to the KL, HSD and DTW measure.

Authors

Institutions

Publication Details

Journal
Statistics Optimization & Information Computing
Published
2025-01-10
DOI
https://doi.org/10.19139/soic-2310-5070-2184
Primary Topic
Time Series Analysis and Forecasting
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distance measures for hidden Markov models based on Hilbert space embeddings for time series classification

Carlos Alberto Ramírez-Vanegas, Oscar Danilo Montoya, Edgar Alirio Valencia-Angulo
Statistics Optimization & Information Computing
Time Series Analysis and Forecasting
article

Distance measures for hidden Markov models based on Hilbert space embeddings for time series classification

Carlos Alberto Ramírez-Vanegas, Oscar Danilo Montoya, Edgar Alirio Valencia-Angulo
article en

Abstract

In order to build a classification scheme for sequences based on HMMs, the design of an appropriate distance is critical in both theoretical and practical fields. The Kullback-Leibler (KL) and Hidden Markov Stationary Distance (HSD) measures have been used to build classification schemes for sequences based on HMMs. However, it is well known that the KL measure is not a true metric and the metric HSD is for univariate data. Inspired by the recent emergence of metrics of probability measures in Reproducible Kernel Hilbert Spaces (RKHS), we introduce two new metrics between two stationary HMMs. The difference in the metrics based on RKHS with respect to the HSD metric is that our metrics can be calculated analytically and can be used for multivariate data. We evaluate the performance of the two metrics in the task of time-series classification, using the metrics within a K-Nearest Neighbor (KNN) classifier. The performance of the two metrics is evaluated in the voice database of the Massachusetts Eye and Ear Infirmary Disordered Voice Database from the Kay Elemetrics company. Results show that the proposed metrics provide competitive classification accuracies when compared to the KL, HSD and DTW measure.

Statistics Optimization & Information ComputingVol. 13(4)
Technological University of Pereira (CO), Universidad Distrital Francisco José de Caldas (CO)
Universidad Tecnológica de Pereira
Openalex Percentile: Top 95%
Time Series Analysis and Forecasting
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.