Informed Decision-Making through Advancements in Open Set Recognition and Unknown Sample Detection

• URL: http://arxiv.org/abs/2405.05836v1
• Date: Thu, 9 May 2024 15:15:34 GMT
• Title: Informed Decision-Making through Advancements in Open Set Recognition and Unknown Sample Detection
• Authors: Atefeh Mahdavi, Marco Carvalho,
• Abstract summary: Open set recognition (OSR) aims to bring classification tasks in a situation that is more like reality. This study provides an algorithm exploring a new representation of feature space to improve classification in OSR tasks.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Machine learning-based techniques open up many opportunities and improvements to derive deeper and more practical insights from data that can help businesses make informed decisions. However, the majority of these techniques focus on the conventional closed-set scenario, in which the label spaces for the training and test sets are identical. Open set recognition (OSR) aims to bring classification tasks in a situation that is more like reality, which focuses on classifying the known classes as well as handling unknown classes effectively. In such an open-set problem the gathered samples in the training set cannot encompass all the classes and the system needs to identify unknown samples at test time. On the other hand, building an accurate and comprehensive model in a real dynamic environment presents a number of obstacles, because it is prohibitively expensive to train for every possible example of unknown items, and the model may fail when tested in testbeds. This study provides an algorithm exploring a new representation of feature space to improve classification in OSR tasks. The efficacy and efficiency of business processes and decision-making can be improved by integrating OSR, which offers more precise and insightful predictions of outcomes. We demonstrate the performance of the proposed method on three established datasets. The results indicate that the proposed model outperforms the baseline methods in accuracy and F1-score.

Related papers

• Collaborative Feature-Logits Contrastive Learning for Open-Set Semi-Supervised Object Detection [75.02249869573994]
  In open-set scenarios, the unlabeled dataset contains both in-distribution (ID) classes and out-of-distribution (OOD) classes. Applying semi-supervised detectors in such settings can lead to misclassifying OOD class as ID classes. We propose a simple yet effective method, termed Collaborative Feature-Logits Detector (CFL-Detector)
  arXiv  Detail & Related papers  (2024-11-20T02:57:35Z)
• Resilience to the Flowing Unknown: an Open Set Recognition Framework for Data Streams [6.7236795813629]
  This work investigates the application of an Open Set Recognition framework that combines classification and clustering to address the textitover-occupied space problem in streaming scenarios.
  arXiv  Detail & Related papers  (2024-10-31T11:06:54Z)
• Meta-learning for Positive-unlabeled Classification [40.11462237689747]
  The proposed method minimizes the test classification risk after the model is adapted to PU data. The method embeds each instance into a task-specific space using neural networks. We empirically show that the proposed method outperforms existing methods with one synthetic and three real-world datasets.
  arXiv  Detail & Related papers  (2024-06-06T01:50:01Z)
• Know Yourself Better: Diverse Discriminative Feature Learning Improves Open Set Recognition [1.386950208583845]
  We conduct an analysis of open set recognition methods, focusing on the aspect of feature diversity. Our research reveals a significant correlation between learning diverse discriminative features and enhancing OSR performance. We propose a novel OSR approach that leverages the advantages of feature diversity.
  arXiv  Detail & Related papers  (2024-04-16T08:08:47Z)
• LORD: Leveraging Open-Set Recognition with Unknown Data [10.200937444995944]
  LORD is a framework to Leverage Open-set Recognition by exploiting unknown data. We identify three model-agnostic training strategies that exploit background data and applied them to well-established classifiers.
  arXiv  Detail & Related papers  (2023-08-24T06:12:41Z)
• Open World Classification with Adaptive Negative Samples [89.2422451410507]
  Open world classification is a task in natural language processing with key practical relevance and impact. We propose an approach based on underlineadaptive underlinesamples (ANS) designed to generate effective synthetic open category samples in the training stage. ANS achieves significant improvements over state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-03-09T21:12:46Z)
• Learning Common Rationale to Improve Self-Supervised Representation for Fine-Grained Visual Recognition Problems [61.11799513362704]
  We propose learning an additional screening mechanism to identify discriminative clues commonly seen across instances and classes. We show that a common rationale detector can be learned by simply exploiting the GradCAM induced from the SSL objective.
  arXiv  Detail & Related papers  (2023-03-03T02:07:40Z)
• An Additive Instance-Wise Approach to Multi-class Model Interpretation [53.87578024052922]
  Interpretable machine learning offers insights into what factors drive a certain prediction of a black-box system. Existing methods mainly focus on selecting explanatory input features, which follow either locally additive or instance-wise approaches. This work exploits the strengths of both methods and proposes a global framework for learning local explanations simultaneously for multiple target classes.
  arXiv  Detail & Related papers  (2022-07-07T06:50:27Z)
• Active Learning for Open-set Annotation [38.739845944840454]
  We propose a new active learning framework called LfOSA, which boosts the classification performance with an effective sampling strategy to precisely detect examples from known classes for annotation. The experimental results show that the proposed method can significantly improve the selection quality of known classes, and achieve higher classification accuracy with lower annotation cost than state-of-the-art active learning methods.
  arXiv  Detail & Related papers  (2022-01-18T06:11:51Z)
• Low-Regret Active learning [64.36270166907788]
  We develop an online learning algorithm for identifying unlabeled data points that are most informative for training. At the core of our work is an efficient algorithm for sleeping experts that is tailored to achieve low regret on predictable (easy) instances.
  arXiv  Detail & Related papers  (2021-04-06T22:53:45Z)
• Open Set Recognition with Conditional Probabilistic Generative Models [51.40872765917125]
  We propose Conditional Probabilistic Generative Models (CPGM) for open set recognition. CPGM can detect unknown samples but also classify known classes by forcing different latent features to approximate conditional Gaussian distributions. Experiment results on multiple benchmark datasets reveal that the proposed method significantly outperforms the baselines.
  arXiv  Detail & Related papers  (2020-08-12T06:23:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.