Positive Unlabeled Learning for Data Stream Classification
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Learning from positive and unlabeled examples (PU learning) has been investigated in recent years as an alternative learning model for dealing with situations where negative training examples are not available. It has many real world applications, but it has yet to be applied in the data stream environment where it is highly possible that only a small set of positive data and no negative data is available. An important challenge is to address the issue of concept drift in the data stream environment, which is not easily handled by the traditional PU learning techniques. This paper studies how to devise PU learning techniques for the data stream environment. Unlike existing data stream classification methods that assume both positive and negative training data are available for learning, we propose a novel PU learning technique LELC (PU Learning by Extracting Likely positive and negative micro-Clusters) for document classification. LELC only requires a small set of positive examples and a set of unlabeled examples which is easily obtainable in the data stream environment to build accurate classifiers. Experimental results show that LELC is a PU learning method that can effectively address the issues in the data stream environment with significantly better speed and accuracy on capturing concept drift than the existing state-of-the-art PU learning techniques.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ensemble methods in machine learning
Dietterich, T. G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45014-9_1 · Cited by 8,408
Estimating the Support of a High-Dimensional Distribution
Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001) · Neural Computation · doi:10.1162/089976601750264965 · Cited by 6,168 · cited 1×
“For example, in [20], a one-class SVM that uses only positive data to build a SVM classifier was proposed.”
MethodHansen, L. K., & Salamon, P. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.58871 · Cited by 4,260
Cited by
Generalizing from a Few Examples: A Survey on Few-shot Learning
Wang, Y., Yao, Q., Kwok, J. T., & Ni, L. M. (2021) · ACM Computing Surveys · doi:10.1145/3386252 · Cited by 3,165
Generalizing from a Few Examples: A Survey on Few-Shot Learning
Wang, Y., Yao, Q., Kwok, J. T.-Y., & Ni, L. M.-S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.05046 · Cited by 772
Learning from positive and unlabeled data: a survey
Bekker, J., & Davis, J. (2020) · Machine Learning · doi:10.1007/s10994-020-05877-5 · Cited by 651
“It is also used for graph-based approaches [76,108], local learning [43] and to cluster the data into super-instances where all the instances are assumed to have the same label [57].”
MethodhPSD: A Hybrid PU-Learning-Based Spammer Detection Model for Product Reviews
Wu, Z., Cao, J., Wang, Y., Wang, Y., Zhang, L., & Wu, J. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2877161 · Cited by 166
“The RN set consists of a small set of instances extracted from U that are remarkably different from the instances in the positive set P [32].”
Result
Metadata
- Authors
- Li, X.-L., Yu, P. S., Liu, B., & Ng, S.-K.
- Venue
- Proceedings of the 2009 SIAM International Conference on Data Mining
- Published
- 2009-04-30
- Pages
- 259-270
- OpenAlex
- W14576171
- Cited by
- 115
- References
- 3
- FWCI
- 6.11
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Positive Unlabeled Learning for Data Stream Classification. https://app.cochat.ai/papers/10.1137/1.9781611972795.23
- The paper
- Li, X.-L., Yu, P. S., Liu, B., & Ng, S.-K. (2009). Positive Unlabeled Learning for Data Stream Classification. Proceedings of the 2009 SIAM International Conference on Data Mining. https://doi.org/10.1137/1.9781611972795.23
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.