Defying the gravity of learning curve: a characteristic of nearest neighbour anomaly detectors

DOI10.1007/S10994-016-5586-4zbMATH Open1412.68193OpenAlexW2507487910MaRDI QIDQ2360971FDOQ2360971

Authors: Kai Ming Ting, Takashi Washio, Jonathan R. Wells, Sunil Aryal 

Publication date: 29 June 2017

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-016-5586-4

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

zbMATH Keywords

AUCanomaly detectioncomputational geometrynearest neighbourlearning curve

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• A simple generalisation of the area under the ROC curve for multiple class classification problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymptotic moments of near–neighbour distance distributions
• LiNearN: a new approach to nearest neighbour density estimator

Cited In (1)

• Homophily outlier detection in non-IID categorical data

Uses Software

• UCI-ml
• WEKA
• HandTill2001
• LOF
• LeSiNN
• Orca
• IsolationForest

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)