The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Cost-sensitive learning methods for imbalanced data
Abstract
Class imbalance is one of the challenging problems for machine learning algorithms. When learning from highly imbalanced data, most classifiers are overwhelmed by the majority class examples, so the false negative rate is always high. Although researchers have introduced many methods to deal with this problem, including resampling techniques and cost-sensitive learning (CSL), most of them focus on either of these techniques. This study presents two empirical methods that deal with class imbalance using both resampling and CSL. The first method combines and compares several sampling techniques with CSL using support vector machines (SVM). The second method proposes using CSL by optimizing the cost ratio (cost matrix) locally. Our experimental results on 18 imbalanced datasets from the UCI repository show that the first method can reduce the misclassification costs, and the second method can improve the classifier performance.
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
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
He, H., & Garcia, E. A. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.239 · Cited by 10,359
A Practical Guide to Support Vector Classication
Hsu, C., Chang, C.-C., & Lin, C. (2008) · Cited by 5,046
A study of the behavior of several methods for balancing machine learning training data
Batista, G. E. A. P. A., Prati, R. C., & Monard, M. C. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007735 · Cited by 4,203
Exploratory Undersampling for Class-Imbalance Learning
Liu, X.-Y., Wu, J., & Zhou, Z.-H. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.2007853 · Cited by 2,465
Addressing the Curse of Imbalanced Training Sets: One-Sided Selection.
Kubát, M., & Matwin, S. (1997) · Cited by 2,230
Asymptotic Properties of Nearest Neighbor Rules Using Edited Data
Wilson, D. L. (1972) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1972.4309137 · Cited by 2,130
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
The foundations of cost-sensitive learning
Elkan, C. (2001) · Cited by 1,945
The condensed nearest neighbor rule (Corresp.)
Hart, P. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054155 · Cited by 1,733
MetaCost: a general method for making classifiers cost-sensitive
Domingos, P. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312220 · Cited by 1,303
Applying Support Vector Machines to Imbalanced Datasets
Akbani, R., Kwek, S., & Japkowicz, N. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30115-8_7 · Cited by 1,134
(1976) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1976.4309452 · Cited by 1,078
Measuring classifier performance: a coherent alternative to the area under the ROC curve
Hand, D. J. (2009) · Machine Learning · doi:10.1007/s10994-009-5119-5 · Cited by 1,003
SVMs Modeling for Highly Imbalanced Classification
Tang, Y., Zhang, Y.-Q., Chawla, N. V., & Krasser, S. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.2002909 · Cited by 966
10 CHALLENGING PROBLEMS IN DATA MINING RESEARCH
YANG, Q., & WU, X. (2006) · International Journal of Information Technology & Decision Making · doi:10.1142/s0219622006002258 · Cited by 930
Experimental perspectives on learning from imbalanced data
Van Hulse, J., Khoshgoftaar, T. M., & Napolitano, A. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273614 · Cited by 786
Classifier Technology and the Illusion of Progress
Hand, D. J. (2006) · Statistical Science · doi:10.1214/088342306000000060 · Cited by 723
Controlling the Sensitivity of Support Vector Machines
Veropoulos, K., Campbell, I. C. G., & Cristianini, N. (1999) · Cited by 708
AdaBoost with SVM-based component classifiers
Li, X., Wang, L., & Sung, E. (2008) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2007.07.001 · Cited by 392
Class Imbalances versus Class Overlapping: An Analysis of a Learning System Behavior
Prati, R. C., Batista, G. E. A. P. A., & Monard, M. C. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24694-7_32 · Cited by 339
Adressing the curse of imbalanced training sets: one-sided selection
Kubát, M. (1997) · Medical Entomology and Zoology · Cited by 328
Boosting and Rocchio applied to text filtering
Schapire, R. E., Singer, Y., & Singhal, A. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290996 · Cited by 301
Extreme re-balancing for SVMs: a case study
Raskutti, B., & Kowalczyk, A. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007739 · Cited by 287
Boosting support vector machines for imbalanced data sets
Wang, B. X., & Japkowicz, N. (2010) · Knowledge and Information Systems · doi:10.1007/s10115-009-0198-y · Cited by 281
The Influence of Class Imbalance on Cost-Sensitive Learning: An Empirical Study
Liu, X.-Y., & Zhou, Z.-H. (2006) · Sixth International Conference on Data Mining (ICDM'06) · doi:10.1109/icdm.2006.158 · Cited by 248
Roughly balanced bagging for imbalanced data
Hido, S., Kashima, H., & Takahashi, Y. (2009) · Statistical Analysis and Data Mining: The ASA Data Science Journal · doi:10.1002/sam.10061 · Cited by 227
Test-Cost Sensitive Naive Bayes Classification
Chai, X., Deng, L., Yang, Q., & Ling, C. X. (2005) · Proceedings · doi:10.1109/icdm.2004.10092 · Cited by 173
Thresholding for making classifiers cost-sensitive
Sheng, V. S., & Ling, C. X. (2006) · National Conference on Artificial Intelligence · Cited by 153
On predicting rare classes with SVM ensembles in scene classification
Yan, R., Liu, Y., Jin, R., & Hauptmann, A. G. (2003) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2003.1199097 · Cited by 133
Improving Academic Performance Prediction by Dealing with Class Imbalance
Thai-Nghe, N., Busche, A., & Schmidt-Thieme, L. (2009) · International Conference on Intelligent Systems Design and Applications (ISDA) · doi:10.1109/isda.2009.15 · Cited by 74
Self-citationUsing Unsupervised Learning to Guide Resampling in Imbalanced Data Sets
Nickerson, A., Japkowicz, N., & Milios, E. (2001) · Cited by 66
Boosting Support Vector Machines for Imbalanced Data Sets
Wang, B. X., & Japkowicz, N. (2008) · Springer eBooks · doi:10.1007/978-3-540-68123-6_4 · Cited by 56
Pruning support vectors for imbalanced data classification
Chen, X., Gerlach, B., & Casasent, D. P. (2006) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2005.1556167 · Cited by 50
Solving Imbalanced Classification Problems with Support Vector Machines.
Lessmann, S. (2004) · International Conference on Artificial Intelligence · Cited by 30
A Hybrid Re-sampling Method for SVM Learning from Imbalanced Data Sets
Li, P., Qiao, P., & Liu, Y. (2008) · International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) · doi:10.1109/fskd.2008.407 · Cited by 22
A Study on the Effiect of Class Distribution Using Cost-Sensitive Learning
Ting, K. M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36182-0_11 · Cited by 11
(1996)
Cited by
Collective Opinion Spam Detection: Bridging Review Networks and Metadata
Rayana, S., & Akoglu, L. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783370 · Cited by 604
Trustworthy AI: From Principles to Practices
Li, B., Qi, P., Liu, B., Di, S., Liu, J., Pei, J., Yi, J., & Zhou, B. (2023) · ACM Computing Surveys · doi:10.1145/3555803 · Cited by 612
“, for the screening of highly contagious and severe diseases, false negatives can be costlier than false positives; see cost-sensitive learning [321]).”
BackgroundTraining deep neural networks on imbalanced data sets
Wang, S., Liu, W., Wu, J., Cao, L., Meng, Q., & Kennedy, P. J. (2016) · 2016 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2016.7727770 · Cited by 491
Ten simple rules for predictive modeling of individual differences in neuroimaging
Scheinost, D., Noble, S., Horien, C., Greene, A. S., Lake, E. M., Salehi, M., Gao, S., Shen, X., O'Connor, D., Barron, D. S., et al. (2019) · NeuroImage · doi:10.1016/j.neuroimage.2019.02.057 · Cited by 381
A cost-sensitive decision tree approach for fraud detection
Sahin, Y., Bulkan, S., & Duman, E. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.05.021 · Cited by 381
Metadata
- Authors
- Thai-Nghe, N., Gantner, Z., & Schmidt-Thieme, L.
- Venue
- The 2010 International Joint Conference on Neural Networks (IJCNN)
- Publisher
- IEEE
- Published
- 2010-07
- Pages
- 1-8
- ISSN
- 2161-4407 (ISSN-L)
- OpenAlex
- W2165837041
- Cited by
- 342
- References
- 39
- FWCI
- 7.28
- 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.