Robust and Efficient Noisy-Label Time-Series Classification via Dynamic Time Warping Based Granular Ball Computing
This work addresses the susceptibility of dynamic time warping (DTW)-based nearest neighbor classifiers to label noise and their high computational cost during inference in time series classification. To mitigate these issues, the authors propose a granular-ball-based classification framework that aggregates temporally similar training samples into granular balls and performs classification at the granularity level. Two DTW-driven strategies for constructing granular balls are introduced. Experimental results on four benchmark datasets demonstrate that the proposed method significantly enhances robustness against symmetric label noise while substantially reducing the number of DTW computations required during inference. The approach thus achieves a favorable trade-off between classification accuracy, computational efficiency, and noise resilience.