Learning from Positive and Unlabeled Data by Identifying the Annotation Process
Naji Shajarisales, Peter Spirtes, Kun Zhang

TL;DR
This paper introduces a flexible model for learning from positive and unlabeled data that accounts for the annotation process, providing theoretical guarantees and an inference algorithm, along with a new benchmark dataset.
Contribution
It extends LePU methods by modeling the annotation process more realistically and proves identifiability of model parameters under these conditions.
Findings
Successful inference algorithm for annotation and classification parameters
Experimental validation on simulated and real data
Introduction of a new benchmark dataset for LePU
Abstract
In binary classification, Learning from Positive and Unlabeled data (LePU) is semi-supervised learning but with labeled elements from only one class. Most of the research on LePU relies on some form of independence between the selection process of annotated examples and the features of the annotated class, known as the Selected Completely At Random (SCAR) assumption. Yet the annotation process is an important part of the data collection, and in many cases it naturally depends on certain features of the data (e.g., the intensity of an image and the size of the object to be detected in the image). Without any constraints on the model for the annotation process, classification results in the LePU problem will be highly non-unique. So proper, flexible constraints are needed. In this work we incorporate more flexible and realistic models for the annotation process than SCAR, and more…
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.
Taxonomy
TopicsMachine Learning and Data Classification · Imbalanced Data Classification Techniques · Machine Learning and Algorithms
