Defying the gravity of learning curve: a characteristic of nearest neighbour anomaly detectors
From MaRDI portal
Publication:2360971
Recommendations
- Algorithmic Learning Theory
- Learning algorithms may perform worse with increasing training set size: algorithm-data incompatibility
- A classification framework for anomaly detection
- scientific article; zbMATH DE number 2215881
- On one extremal problem of adaptive machine learning for detection of anomalies
Cites work
- scientific article; zbMATH DE number 47593 (Why is no real title available?)
- scientific article; zbMATH DE number 4001209 (Why is no real title available?)
- scientific article; zbMATH DE number 2102225 (Why is no real title available?)
- A simple generalisation of the area under the ROC curve for multiple class classification problems
- Asymptotic moments of near–neighbour distance distributions
- LiNearN: a new approach to nearest neighbour density estimator
This page was built for publication: Defying the gravity of learning curve: a characteristic of nearest neighbour anomaly detectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2360971)