paper-with-me

Papers

Linear-time One-Class Classification with Repeated Element-wise Folding

2024-08-21 · Jenni Raitoharju

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.

📄 PDF Abstract BibTeX arXiv:2408.11412

Code (1)

jenniraitoharju/ref 공식 구현

Tasks

ClassificationOne-Class Classification

Similar Papers 제목 키워드 기반

Repeated Observations for Classification

2023-07-19 · Hüseyin Afşer, László Györfi, Harro Walk

We study the problem nonparametric classification with repeated observations. Let $\bX$ be the $d$ dimensional feature vector and let $Y$ denote the label taking values in $\{1,\dots ,M\}$. In contrast to usual setup wit…

Classification

Fast Swap-Based Element Selection for Multiplication-Free Dimension Reduction

2026-02-14 · Nobutaka Ono arxiv

In this paper, we propose a fast algorithm for element selection, a multiplication-free form of dimension reduction that produces a dimension-reduced vector by simply selecting a subset of elements from the input. Dimens…

Detection, Rectification and Segmentation of Coplanar Repeated Patterns

2014-06-01 · CVPR 2014 6 · James Pritts, Ondrej Chum, Jiri Matas

This paper presents a novel and general method for the detection, rectification and segmentation of imaged coplanar repeated patterns. The only assumption made of the scene geometry is that repeated scene elements are ma…

MaxSketch: Robust Distinct Counting in Streams via Random Projections

2026-05-15 · Nikos Tsikouras, Constantine Caramanis, Christos Tzamos arxiv

Estimating the number of distinct elements in a data stream is well understood when repeated elements are identical. In modern settings, however, observations are high-dimensional and noisy, so repeated instances of the …

Representation Learning

RENT -- Repeated Elastic Net Technique for Feature Selection

2020-09-27 · Anna Jenul, Stefan Schrunner, Kristian Hovde Liland, Ulf Geir Indahl 외

Feature selection is an essential step in data science pipelines to reduce the complexity associated with large datasets. While much research on this topic focuses on optimizing predictive performance, few studies invest…

Binary Classificationfeature selection