Entropic one-class classifiers
Lorenzo Livi, Alireza Sadeghian, Witold Pedrycz

TL;DR
This paper introduces a novel one-class classifier that uses dissimilarity representation, entropy estimation, and graph-based decision regions to effectively identify target patterns across various data types.
Contribution
It presents a new one-class classification system combining dissimilarity measures, entropy estimation, and graph-based modeling, adaptable to different data types and providing both hard and soft decisions.
Findings
Effective on diverse benchmarking datasets
Accurate detection of target patterns
Outperforms existing methods in experiments
Abstract
The one-class classification problem is a well-known research endeavor in pattern recognition. The problem is also known under different names, such as outlier and novelty/anomaly detection. The core of the problem consists in modeling and recognizing patterns belonging only to a so-called target class. All other patterns are termed non-target, and therefore they should be recognized as such. In this paper, we propose a novel one-class classification system that is based on an interplay of different techniques. Primarily, we follow a dissimilarity representation based approach; we embed the input data into the dissimilarity space by means of an appropriate parametric dissimilarity measure. This step allows us to process virtually any type of data. The dissimilarity vectors are then represented through a weighted Euclidean graphs, which we use to (i) determine the entropy of the data…
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.
