Home /Research /WINkNN: Windowed Intervals’ Number kNN Classifier for Efficient Time-Series Applications
HRI

WINkNN: Windowed Intervals’ Number kNN Classifier for Efficient Time-Series Applications

Chris Lytridis, Anna Lekova, Christos Bazinas, Michail Manios, Vassilis G. Kaburlasos

Year
2020
Citations
12
Access
Open access

Abstract

Our interest is in time series classification regarding cyber–physical systems (CPSs) with emphasis in human-robot interaction. We propose an extension of the k nearest neighbor (kNN) classifier to time-series classification using intervals’ numbers (INs). More specifically, we partition a time-series into windows of equal length and from each window data we induce a distribution which is represented by an IN. This preserves the time dimension in the representation. All-order data statistics, represented by an IN, are employed implicitly as features; moreover, parametric non-linearities are introduced in order to tune the geometrical relationship (i.e., the distance) between signals and consequently tune classification performance. In conclusion, we introduce the windowed IN kNN (WINkNN) classifier whose application is demonstrated comparatively in two benchmark datasets regarding, first, electroencephalography (EEG) signals and, second, audio signals. The results by WINkNN are superior in both problems; in addition, no ad-hoc data preprocessing is required. Potential future work is discussed.

Keywords

Classifier (UML)Computer sciencePattern recognition (psychology)PreprocessorArtificial intelligenceTime seriesk-nearest neighbors algorithmParametric statisticsSeries (stratigraphy)Data mining

Related papers

Browse all HRI papers