On the stopping criteria for \(k\)-nearest neighbor in positive unlabeled time series classification problems (Q1750499)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the stopping criteria for k-nearest neighbor in positive unlabeled time series classification problems |
scientific article; zbMATH DE number 6870793
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the stopping criteria for \(k\)-nearest neighbor in positive unlabeled time series classification problems |
scientific article; zbMATH DE number 6870793 |
Statements
On the stopping criteria for \(k\)-nearest neighbor in positive unlabeled time series classification problems (English)
0 references
22 May 2018
0 references
\(k\)-nearest neighbor
0 references
self-training
0 references
positive unlabeled learning
0 references
time series classification
0 references
transductive learning
0 references
0.6914089322090149
0 references
0.6884559988975525
0 references
0.6804853081703186
0 references
0.6725577712059021
0 references
