On the stopping criteria for \(k\)-nearest neighbor in positive unlabeled time series classification problems
From MaRDI portal
Publication:1750499
DOI10.1016/j.ins.2015.07.061zbMath1390.62174MaRDI QIDQ1750499
Publication date: 22 May 2018
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2015.07.061
transductive learning; time series classification; \(k\)-nearest neighbor; self-training; positive unlabeled learning
62M10: Time series, auto-correlation, regression, etc. in statistics (GARCH)
62H30: Classification and discrimination; cluster analysis (statistical aspects)
60G40: Stopping times; optimal stopping problems; gambling theory
Uses Software