Linear-time One-Class Classification with Repeated Element-wise Folding
Not on the map. Why?
Abstract (arXiv)
This paper proposes an easy-to-use method for one-class classification: Repeated Element-wise Folding (REF). The algorithm consists of repeatedly standardizing and applying an element-wise folding operation on the one-class training data. Equivalent mappings are performed on unknown test items and the classification prediction is based on the item's distance to the origin of the final distribution. As all the included operations have linear time complexity, the proposed algorithm provides a linear-time alternative for the commonly used computationally much more demanding approaches. Furthermore, REF can avoid the challenges of hyperparameter setting in one-class classification by providing robust default settings. The experiments show that the proposed method can produce similar classification performance or even outperform the more complex algorithms on various benchmark datasets. Matlab codes for REF are publicly available at https://github.com/JenniRaitoharju/REF.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 8 of its 18 references that are in the map. First posted on arXiv 21 Aug 2024.
Builds on
8 of 18 references.
References · 8
- 2020DROCC: Deep Robust One-Class Classificationcited by 121
- 2014On the folded normal distributioncited by 31
- 2018Subspace Support Vector Data Descriptioncited by 31
- 2019Multimodal Subspace Support Vector Data Descriptioncited by 15
- 2021Graph-Embedded Subspace Support Vector Data Descriptioncited by 13
- 2020Boosting rare benthic macroinvertebrates taxa identification with one-class classificationcited by 11
- 2022Generalized Reference Kernel for One-class Classificationcited by 2
- 2017On The Construction of Extreme Learning Machine for Online and Offline One-Class Classification - An Expanded Toolboxcited by 1
Built on by
Not cited yet.