Journal article · 2026 · Open access

Making Binary Classification From Multiple Unlabeled Datasets Almost Free of Supervision

Yuhao Wu, Xiaobo Xia, Jun Yu, Bo Han, Gang Niu, Masashi Sugiyama, Tongliang Liu

IEEE Transactions on Pattern Analysis and Machine Intelligence, PP, 1–14 · Published 29 October 2026 · DOI 10.1109/tpami.2026.3748555

Open full textCite this paper

In brief

“Making Binary Classification From Multiple Unlabeled Datasets Almost Free of Supervision” is a 2026 journal article by Yuhao Wu and 6 co-authors, published in IEEE Transactions on Pattern Analysis and Machine Intelligence. OpenAlex counts 6 citations as of 18 November 2026. It is open access under a CC BY licence: the full text is free to read at IEEE Transactions on Pattern Analysis and Machine Intelligence.

Citations
6
Most cited in
2023 (2)
Field-weighted impact
1.08
References
58
Authors
7

Abstract

Training a classifier exploiting a huge amount of supervised data is expensive or even prohibited in a situation, where the labeling cost is high. The remarkable progress in working with weaker forms of supervision is binary classification from multiple unlabeled datasets which requires the knowledge of exact class priors for all unlabeled datasets. However, the availability of class priors is restrictive in many real-world scenarios. To address this issue, we propose to solve a new problem setting, i.e., binary classification from multiple unlabeled datasets with only one pairwise numerical relationship of class priors (MU-OPPO), which knows the relative order (which unlabeled dataset has a higher proportion of positive examples) of two class-prior probabilities for two datasets among multiple unlabeled datasets. In MU-OPPO, we do not need the class priors for all unlabeled datasets, but we only require that there exists a pair of unlabeled datasets for which we know which unlabeled dataset has a larger class prior. Clearly, this form of supervision is easier to be obtained, which can make labeling costs almost free. We propose a novel framework to handle the MU-OPPO problem, which consists of four sequential modules: (i) pseudo label assignment; (ii) confident example collection; (iii) class prior estimation; (iv) classifier training with estimated class priors. Theoretically, we analyze the gap between estimated class priors and true class priors under the proposed framework. Empirically, we confirm the superiority of our framework with comprehensive experiments. Experimental results demonstrate that our framework brings smaller estimation errors of class priors and better performance of binary classification. The code is available at: https://github.com/wu-yu-hao/MU-OPPO.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Wu, Y., Xia, X., Yu, J., Han, B., Niu, G., Sugiyama, M., & Liu, T. (2026). Making Binary Classification From Multiple Unlabeled Datasets Almost Free of Supervision. IEEE Transactions on Pattern Analysis and Machine Intelligence, PP, 1–14. https://doi.org/10.1109/tpami.2026.3748555

MLA 9

Wu, Yuhao, et al. “Making Binary Classification From Multiple Unlabeled Datasets Almost Free of Supervision.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PP, 2026, pp. 1–14. https://doi.org/10.1109/tpami.2026.3748555.

Chicago

Wu, Yuhao, Xiaobo Xia, Jun Yu, Bo Han, Gang Niu, Masashi Sugiyama, and Tongliang Liu. 2026. “Making Binary Classification From Multiple Unlabeled Datasets Almost Free of Supervision.” IEEE Transactions on Pattern Analysis and Machine Intelligence PP: 1–14. https://doi.org/10.1109/tpami.2026.3748555.

Harvard

Wu, Y. et al. (2026) ‘Making Binary Classification From Multiple Unlabeled Datasets Almost Free of Supervision’, IEEE Transactions on Pattern Analysis and Machine Intelligence, PP, pp. 1–14. doi:10.1109/tpami.2026.3748555.

IEEE

Y. Wu et al., “Making Binary Classification From Multiple Unlabeled Datasets Almost Free of Supervision,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PP, pp. 1–14, 2026, doi: 10.1109/tpami.2026.3748555.

BibTeX

@article{wu2026making,
  title     = {{Making Binary Classification From Multiple Unlabeled Datasets Almost Free of Supervision}},
  author    = {Wu, Yuhao and Xia, Xiaobo and Yu, Jun and Han, Bo and Niu, Gang and Sugiyama, Masashi and Liu, Tongliang},
  journal   = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year      = {2026},
  volume    = {PP},
  pages     = {1--14},
  doi       = {10.1109/tpami.2026.3748555},
  url       = {https://doi.org/10.1109/tpami.2026.3748555}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202322
202422
202511
202611

Its field-weighted citation impact is 1.08: it has been cited 1.08 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms

  • binary classification
  • weakly supervised learning
  • class prior estimation
  • pseudo-labeling
  • domain adaptation

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Wu, Y., Xia, X., Yu, J., Han, B., Niu, G., Sugiyama, M., & Liu, T. (2026). Making Binary Classification From Multiple Unlabeled Datasets Almost Free of Supervision. IEEE Transactions on Pattern Analysis and Machine Intelligence, PP, 1–14. https://doi.org/10.1109/tpami.2026.3748555

How many times has this paper been cited?

6 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at IEEE Transactions on Pattern Analysis and Machine Intelligence: sign in and open the full text from this page.

Who wrote this paper?

Yuhao Wu, Xiaobo Xia, Jun Yu, Bo Han, Gang Niu, Masashi Sugiyama, Tongliang Liu.

What is the DOI of this paper?

10.1109/tpami.2026.3748555, permanently at https://doi.org/10.1109/tpami.2026.3748555. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.