Classification from Positive and Biased Negative Data with Skewed Labeled Posterior Probability
The binary classification problem has a situation where only biased data are observed in one of the classes. In this paper, we propose a new method to approach the positive and biased negative (PbN) classification problem, which is a weakly supervised learning method to learn a binary classifier from positive data and negative data with biased observations. We incorporate a method to correct the negative impact due to skewed confidence, which represents the posterior probability that the observed data are positive. This reduces the distortion of the posterior probability that the data are labeled, which is necessary for the empirical risk minimization of the PbN classification problem. We verified the effectiveness of the proposed method by numerical experiments and real data analysis.
Code (0)
등록된 구현이 없습니다.
Tasks
Binary ClassificationClassificationWeakly-supervised LearningSimilar Papers 제목 키워드 기반
Binary Classification from Positive Data with Skewed Confidence
Positive-confidence (Pconf) classification [Ishida et al., 2018] is a promising weakly-supervised learning method which trains a binary classifier only from positive data equipped with confidence. However, in practice, t…
Binary ClassificationClassificationGeneral ClassificationWeakly-supervised LearningContrastive Learning with Negative Sampling Correction
As one of the most effective self-supervised representation learning methods, contrastive learning (CL) relies on multiple negative pairs to contrast against each positive pair. In the standard practice of contrastive le…
Contrastive LearningData AugmentationGraph ClassificationRepresentation LearningUSM: Unbiased Survey Modeling for Limiting Negative User Experiences in Recommendation Systems
Negative feedback signals are crucial to guardrail content recommendations and improve user experience. When these signals are effectively integrated into recommendation systems, they play a vital role in preventing the …
Recommendation SystemsClassification from Positive, Unlabeled and Biased Negative Data
In binary classification, there are situations where negative (N) data are too diverse to be fully labeled and we often resort to positive-unlabeled (PU) learning in these scenarios. However, collecting a non-representat…
Binary ClassificationClassificationGeneral ClassificationSparse Network Inversion for Key Instance Detection in Multiple Instance Learning
Multiple Instance Learning (MIL) involves predicting a single label for a bag of instances, given positive or negative labels at bag-level, without accessing to label for each instance in the training phase. Since a posi…
Multiple Instance Learning