The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Evaluating boosting algorithms to classify rare classes: comparison and improvements
Abstract
Classification of rare events has many important data mining applications. Boosting is a promising meta-technique that improves the classification performance of any weak classifier. So far, no systematic study has been conducted to evaluate how boosting performs for the task of mining rare classes. The authors evaluate three existing categories of boosting algorithms from the single viewpoint of how they update the example weights in each iteration, and discuss their possible effect on recall and precision of the rare class. We propose enhanced algorithms in two of the categories, and justify their choice of weight updating parameters theoretically. Using some specially designed synthetic datasets, we compare the capability of all the algorithms from the rare class perspective. The results support our qualitative analysis, and also indicate that our enhancements bring an extra capability for achieving better balance between recall and precision in mining rare classes.
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
Cohen, W. W. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50023-2 · Cited by 3,787
Improved boosting algorithms using confidence-rated predictions
Schapire, R. E., & Singer, Y. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279960 · Cited by 2,547
Improved Boosting Algorithms Using Confidence-rated Predictions
Schapire, R. E., & Singer, Y. (1999) · Machine Learning · doi:10.1023/a:1007614523901 · Cited by 1,971
AdaCost: Misclassification Cost-Sensitive Boosting
Fan, W., Stolfo, S. J., Zhang, J., & Chan, P. K. (1999) · Cited by 612
Chan, P. K., & Stolfo, S. J. (1998) · Cited by 452
A simple, fast, and effective rule learner
Cohen, W. W., & Singer, Y. (1999) · Cited by 341
A Comparative Study of Cost-Sensitive Boosting Algorithms
Ting, K. M. (2000) · Cited by 262
Joshi, M. V., Agarwal, R. C., & Kumar, V. (2001) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/375663.375673 · Cited by 130
Self-citationSchapire, R. E. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49097-3_1 · Cited by 122
Cited by
He, H., & Garcia, E. A. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.239 · Cited by 10,359
“Many representative works on the ineffectiveness of accuracy in the imbalanced learning scenario exist in the community [14], [20], [47], [51], [58], [116], [117], [118].”
BackgroundBorderline-SMOTE : A New Over-Sampling Method in Imbalanced Data Sets Learning
Han, H., Wang, W.-Y., & Mao, B.-H. (2005) · Lecture notes in computer science · doi:10.1007/11538059_91 · Cited by 4,331
Galar, M., Fernandez, A., Barrenechea, E., Bustince, H., & Herrera, F. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2011.2161285 · Cited by 2,794
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
RUSBoost: A Hybrid Approach to Alleviating Class Imbalance
Seiffert, C., Khoshgoftaar, T. M., Van Hulse, J., & Napolitano, A. (2010) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2009.2029559 · Cited by 1,867
CLASSIFICATION OF IMBALANCED DATA: A REVIEW
SUN, Y., WONG, A. K. C., & KAMEL, M. S. (2009) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001409007326 · Cited by 1,692
SMOTEBoost: Improving Prediction of the Minority Class in Boosting
Chawla, N. V., Lazarevic, A., Hall, L. O., & Bowyer, K. W. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39804-2_12 · Cited by 1,668
López, V., Fernández, A., García, S., Palade, V., & Herrera, F. (2013) · Information Sciences · doi:10.1016/j.ins.2013.07.007 · Cited by 1,590
Cost-sensitive boosting for classification of imbalanced data
Sun, Y., Kamel, M. S., Wong, A. K. C., & Wang, Y. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2007.04.009 · Cited by 1,423
Mining with rarity: a unifying framework
Weiss, G. M. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007734 · Cited by 1,393
A Survey of Predictive Modeling on Imbalanced Domains
Branco, P., Torgo, L., & Ribeiro, R. P. (2017) · ACM Computing Surveys · doi:10.1145/2907070 · Cited by 1,129
Data Mining for Imbalanced Datasets: An Overview
Chawla, N. V. (2009) · Data Mining and Knowledge Discovery Handbook · doi:10.1007/978-0-387-09823-4_45 · Cited by 1,082
Learning from imbalanced data sets with boosting and data generation: the DataBoost-IM approach
Guo, H., & Viktor, H. L. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007736 · Cited by 605
Multiclass Imbalance Problems: Analysis and Potential Solutions
Wang, S., & Yao, X. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2012.2187280 · Cited by 567
On the Class Imbalance Problem
Guo, X., Yin, Y., Dong, C., Yang, G., & Zhou, G. (2008) · 2008 Fourth International Conference on Natural Computation · doi:10.1109/icnc.2008.871 · Cited by 495
Boosting methods for multi-class imbalanced data classification: an experimental review
Tanha, J., Abdi, Y., Samadi, N., Razzaghi, N., & Asadpour, M. (2020) · Journal of Big Data · doi:10.1186/s40537-020-00349-y · Cited by 452
Data Mining for Imbalanced Datasets: An Overview
Chawla, N. V. (2006) · Data Mining and Knowledge Discovery Handbook · doi:10.1007/0-387-25465-x_40 · Cited by 443
To Combat Multi-Class Imbalanced Problems by Means of Over-Sampling Techniques
Abdi, L., & Hashemi, S. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2458858 · Cited by 411
Network-Based Marketing: Identifying Likely Adopters via Consumer Networks
Hill, S., Provost, F., & Volinsky, C. (2006) · Statistical Science · doi:10.1214/088342306000000222 · Cited by 387
Logistic regression in data analysis: an overview
Maalouf, M. (2011) · International Journal of Data Analysis Techniques and Strategies · doi:10.1504/ijdats.2011.041335 · Cited by 347
A Systematic Study of Online Class Imbalance Learning With Concept Drift
Wang, S., Minku, L. L., & Yao, X. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2771290 · Cited by 331
Boosting for Learning Multiple Classes with Imbalanced Class Distribution
Sun, Y., Kamel, M., & Wang, Y. (2006) · Sixth International Conference on Data Mining (ICDM'06) · doi:10.1109/icdm.2006.29 · Cited by 307
Comparing Boosting and Bagging Techniques With Noisy and Imbalanced Data
Khoshgoftaar, T. M., Van Hulse, J., & Napolitano, A. (2011) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2010.2084081 · Cited by 300
Bennin, K. E., Keung, J., Phannachitta, P., Monden, A., & Mensah, S. (2018) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2017.2731766 · Cited by 298
A broad review on class imbalance learning techniques
Rezvani, S., & Wang, X. (2023) · Applied Soft Computing · doi:10.1016/j.asoc.2023.110415 · Cited by 281
Interpreting and Unifying Outlier Scores
Kriegel, H.-P., Kroger, P., Schubert, E., & Zimek, A. (2011) · Proceedings of the 2011 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.2 · Cited by 266
MSMOTE: Improving Classification Performance When Training Data is Imbalanced
Hu, S., Liang, Y., Ma, L., & He, Y. (2009) · 2009 Second International Workshop on Computer Science and Engineering · doi:10.1109/wcse.2009.756 · Cited by 264
M-AdaBoost-A based ensemble system for network intrusion detection
Zhou, Y., Mazzuchi, T. A., & Sarkani, S. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113864 · Cited by 99
Selecting Representative Data Sets
Borovicka, T., Jirina, M., Kordik, P., & Jiri, M. (2012) · Advances in Data Mining Knowledge Discovery and Applications · doi:10.5772/50787 · Cited by 94
Using Improved Conditional Generative Adversarial Networks to Detect Social Bots on Twitter
Wu, B., Liu, L., Yang, Y., Zheng, K., & Wang, X. (2020) · IEEE Access · doi:10.1109/access.2020.2975630 · Cited by 54
Comparison of Machine Learning Pixel-Based Classifiers for Detecting Archaeological Ceramics
Argyrou, A., Agapiou, A., Papakonstantinou, A., & Alexakis, D. D. (2023) · Drones · doi:10.3390/drones7090578 · Cited by 19
Metadata
- Authors
- Joshi, M. V., Kumar, V., & Agarwal, R. C.
- Venue
- Proceedings 2001 IEEE International Conference on Data Mining
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-14
- Pages
- 257-264
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2119157339
- Cited by
- 268
- References
- 9
- FWCI
- 5.98
- 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.