Optimised one-class classification performance
Oliver Urs Lenz, Daniel Peralta, Chris Cornelis

TL;DR
This paper thoroughly evaluates hyperparameter optimization methods for five one-class classifiers, demonstrating that ALP and SVM perform best after optimization, with ALP being more efficient and suitable as a default choice.
Contribution
It introduces an efficient hyperparameter optimization approach for multiple one-class classifiers and compares their performance across extensive datasets.
Findings
ALP and SVM outperform other classifiers after optimization.
ALP can be optimized more efficiently than SVM.
NND is the least computationally demanding option.
Abstract
We provide a thorough treatment of one-class classification with hyperparameter optimisation for five data descriptors: Support Vector Machine (SVM), Nearest Neighbour Distance (NND), Localised Nearest Neighbour Distance (LNND), Local Outlier Factor (LOF) and Average Localised Proximity (ALP). The hyperparameters of SVM and LOF have to be optimised through cross-validation, while NND, LNND and ALP allow an efficient form of leave-one-out validation and the reuse of a single nearest-neighbour query. We experimentally evaluate the effect of hyperparameter optimisation with 246 classification problems drawn from 50 datasets. From a selection of optimisation algorithms, the recent Malherbe-Powell proposal optimises the hyperparameters of all data descriptors most efficiently. We calculate the increase in test AUROC and the amount of overfitting as a function of the number of hyperparameter…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSupport Vector Machine
