The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Exploratory Under-Sampling for Class-Imbalance Learning
Abstract
Under-sampling is a class-imbalance learning method which uses only a subset of major class examples and thus is very efficient. The main deficiency is that many major class examples are ignored. We propose two algorithms to overcome the deficiency. EasyEnsemble samples several subsets from the major class, trains a learner using each of them, and combines the outputs of those learners. BalanceCascade is similar to EasyEnsemble except that it removes correctly classified major class examples of trained learners from further consideration. Experiments show that both of the proposed algorithms have better AUC scores than many existing class-imbalance learning methods. Moreover, they have approximately the same training time as that of under-sampling, which trains significantly faster than other methods.
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
SMOTE synthetic minority over-sampling technique
Chawla, N. V., Bowyer, K. W., Hall, L. O., & Kegelmeyer, W. P. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.953 · Cited by 32,865 · cited 1×
“SMOTE [5] is an example, which adds new synthetic minor class examples by randomly interpolating pairs of closest neighbors in the minor class.”
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325 · cited 1×
“• Bagging (abbreviated as Bagg): Bagging [5] uses the entire data set (P and N ).”
Robust Real-Time Face Detection
Viola, P., & Jones, M. J. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000013087.49260.fb · Cited by 14,097
Wolpert, D. H. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80023-1 · Cited by 7,951
The use of the area under the ROC curve in the evaluation of machine learning algorithms
Bradley, A. P. (1997) · Pattern Recognition · doi:10.1016/s0031-3203(96)00142-2 · Cited by 7,217
The class imbalance problem: A systematic study1
Japkowicz, N., & Stephen, S. (2002) · Intelligent Data Analysis · doi:10.3233/ida-2002-6504 · Cited by 3,295
Editorial: special issue on learning from imbalanced data sets
Chawla, N. V., Japkowicz, N., & Kotcz, A. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007733 · Cited by 2,063
Mining with rarity: a unifying framework
Weiss, G. M. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007734 · Cited by 1,393
Using Random Forest to Learn Imbalanced Data
Chen, C., Liaw, A. I., & Breiman, L. (2004) · UC Berkeley · Cited by 1,340
Training cost-sensitive neural networks with methods addressing the class imbalance problem
Zhou, Z.-H., & Liu, X.-Y. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.17 · Cited by 1,326
Self-citationLinear Asymmetric Classifier for cascade detectors
Wu, J., Mullin, M. D., & Rehg, J. M. (2005) · International Conference on Machine Learning · doi:10.1145/1102351.1102476 · Cited by 46
Self-citation
Cited by
Learning on the border: active learning in imbalanced data classification
Ertekin, S., Huang, J., Bottou, L., & Giles, L. (2007) · Proceedings of the sixteenth ACM conference on Conference on information and knowledge management · doi:10.1145/1321440.1321461 · Cited by 365
Precision-Recall versus Accuracy and the Role of Large Data Sets
Juba, B., & Le, H. S. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33014039 · Cited by 318
An integrated data mining approach to real-time clinical monitoring and deterioration warning
Mao, Y., Chen, W., Chen, Y., Lu, C., Kollef, M., & Bailey, T. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339709 · Cited by 76
Li, C., Zhang, L., Zhuo, Z., Su, F., Li, H., Xu, S., Liu, Y., Zhang, Z., Xie, Y., Yu, X., et al. (2023) · Theranostics · doi:10.7150/thno.79362 · Cited by 10
Metadata
- Authors
- Liu, X.-Y., Wu, J., & Zhou, Z.-H.
- Venue
- Sixth International Conference on Data Mining (ICDM'06)
- Publisher
- IEEE
- Published
- 2006-12
- Pages
- 965-969
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2056614917
- Cited by
- 271
- References
- 11
- FWCI
- 3.12
- 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
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.