Metraipolis › archive › dc_b13fd545663e

Robust and Efficient Noisy-Label Time-Series Classification via Dynamic Time Warping Based Granular Ball Computing — arXiv:2608.11704

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.11704
License (as archived)
CC0-1.0
Archived
2026-10-19T05:16:06.683Z
SHA-256 of the archived text
77a123dc85c47ccc38856ea1cac836d4f172a6ecdbaf6dc772188d898617f971
Stable URL of this page
https://metraipolis.com/documento/dc_b13fd545663e

How to cite

Robust and Efficient Noisy-Label Time-Series Classification via Dynamic Time Warping Based Granular Ball Computing — arXiv:2608.11704 — arXiv (en), https://arxiv.org/abs/2608.11704 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b13fd545663e (Metraipolis archive dc_b13fd545663e, sha256 77a123dc85c47ccc38856ea1cac836d4f172a6ecdbaf6dc772188d898617f971)
BibTeX
@misc{dcb13fd545663e,
  title = {Robust and Efficient Noisy-Label Time-Series Classification via Dynamic Time Warping Based Granular Ball Computing — arXiv:2608.11704},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.11704},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b13fd545663e; sha256 77a123dc85c47ccc38856ea1cac836d4f172a6ecdbaf6dc772188d898617f971},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.11704. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Dynamic Time Warping (DTW)-based Nearest-Neighbor (NN) classifiers are effective for time-series classification but are vulnerable to mislabeled training samples and require numerous DTW computations during inference. We propose DTW-based Granular Ball Computing (DTW-GBC), which organizes temporally similar training samples into granular balls and performs classification at the granule level. We further develop two granular-ball construction strategies for DTW-GBC. Experiments on four benchmark datasets with symmetric label noise show that the two DTW-GBC variants generally mitigate the performance degradation caused by label noise while requiring substantially fewer comparisons than DTW-based 1-NN during inference. These findings suggest that DTW-GBC provides a favorable balance between classification robustness and inference efficiency.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-13 in cs.AI).
Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2608.11704 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T05:08:46.719Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).