LGCVDec 25, 2023

Lp-Norm Constrained One-Class Classifier Combination

arXiv:2312.15769v1h-index: 16
Originality Incremental advance
AI Analysis

This is an incremental improvement for boosting one-class classification performance in diverse applications.

The paper tackled the problem of one-class classifier fusion by modeling ensemble sparsity/uniformity with an Lp-norm constraint on weights, resulting in improved performance across multiple datasets compared to existing methods.

Classifier fusion is established as an effective methodology for boosting performance in different settings and one-class classification is no exception. In this study, we consider the one-class classifier fusion problem by modelling the sparsity/uniformity of the ensemble. To this end, we formulate a convex objective function to learn the weights in a linear ensemble model and impose a variable Lp-norm constraint on the weight vector. The vector-norm constraint enables the model to adapt to the intrinsic uniformity/sparsity of the ensemble in the space of base learners and acts as a (soft) classifier selection mechanism by shaping the relative magnitudes of fusion weights. Drawing on the Frank-Wolfe algorithm, we then present an effective approach to solve the formulated convex constrained optimisation problem efficiently. We evaluate the proposed one-class classifier combination approach on multiple data sets from diverse application domains and illustrate its merits in comparison to the existing approaches.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes