Defying the gravity of learning curve: a characteristic of nearest neighbour anomaly detectors (Q2360971)
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: Defying the gravity of learning curve: a characteristic of nearest neighbour anomaly detectors |
scientific article; zbMATH DE number 6737048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Defying the gravity of learning curve: a characteristic of nearest neighbour anomaly detectors |
scientific article; zbMATH DE number 6737048 |
Statements
Defying the gravity of learning curve: a characteristic of nearest neighbour anomaly detectors (English)
0 references
29 June 2017
0 references
learning curve
0 references
anomaly detection
0 references
nearest neighbour
0 references
computational geometry
0 references
AUC
0 references
0 references
0.6660144925117493
0 references
0.6521921753883362
0 references
0.6339744329452515
0 references
0.6301740407943726
0 references
