Dynamic Barycenter Averaging Kernel in RBF Networks for Time Series Classification

19Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Radial basis function (RBF) network has been utilized in many applications due to its simple topological structure and strong capacity on function approximation. The core of RBF network is its static kernel function, which is based on the Euclidean distance and cannot obtain good performance for time series classification (TSC) due to the time-shift invariance, complex dynamics, and different length of temporal data.This paper proposed a new temporal kernel, namely, the dynamic barycenter averaging kernel (DBAK) and introduced it into the RBF network. First, we combine k-means clustering with a dynamic time warping (DTW)-based averaging algorithm called DTW barycenter averaging (DBA) to determine the center of DBAK. Then, in order to facilitate the stable gradient-training process in the whole network, a normalization term is added into the kernel formulation. By integrating the information of the whole time warping path, our DBAK-based RBF network performs efficiently for TSC tasks.

Cite

CITATION STYLE

APA

Shi, K., Qin, H., Sima, C., Li, S., Shen, L., & Ma, Q. (2019). Dynamic Barycenter Averaging Kernel in RBF Networks for Time Series Classification. IEEE Access, 7, 47564–47576. https://doi.org/10.1109/ACCESS.2019.2910017

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free