Boosting support vector machines for imbalanced data sets
The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
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
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Proceedings of the 24th international conference on Machine learning
(2007) · doi:10.1145/1273496 · Cited by 11,630
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Text categorization with Support Vector Machines: Learning with many relevant features
Joachims, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026683 · Cited by 7,999
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
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
Self-citationAddressing the Curse of Imbalanced Training Sets: One-Sided Selection.
Kubát, M., & Matwin, S. (1997) · Cited by 2,230
The foundations of cost-sensitive learning
Elkan, C. (2001) · Cited by 1,945
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
A brief introduction to boosting
Schapire, R. E. (1999) · International Joint Conference on Artificial Intelligence · Cited by 1,572
Mining with rarity: a unifying framework
Weiss, G. M. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007734 · Cited by 1,393
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
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
Self-citationStatistical Comparisons of Classifiers over Multiple Data Sets
DemšarJanez (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248548 · Cited by 1,074
Inference for the Generalization Error
Nadeau, C., & Bengio, Y. (2003) · Machine Learning · doi:10.1023/a:1024068626366 · Cited by 1,026
Improving support vector machine classifiers by modifying kernel functions
Amari, S., & Wu, S. (1999) · Neural Networks · doi:10.1016/s0893-6080(99)00032-5 · Cited by 936
Learning when training data are costly: the effect of class distribution on tree induction
Weiss, G. M., & Provost, F. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1199 · Cited by 921
Provost, F. J., & Fawcett, T. E. (1997) · Cited by 720
Controlling the Sensitivity of Support Vector Machines
Veropoulos, K., Campbell, I. C. G., & Cristianini, N. (1999) · Cited by 708
Cost-sensitive learning by cost-proportionate example weighting
Zadrozny, B., Langford, J., & Abe, N. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250950 · Cited by 680 · cited 1×
“Various experimental studies, doing just that, have been performed using both different kinds of classifiers and different types of cost-adaptation strategies [13,14,38,44,46].”
BackgroundAdaCost: Misclassification Cost-Sensitive Boosting
Fan, W., Stolfo, S. J., Zhang, J., & Chan, P. K. (1999) · Cited by 612
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
An instance-weighting method to induce cost-sensitive trees
Ting, K. M. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2002.1000348 · Cited by 504
Inference for the Generalization ErrorPreprint
Bengio, Y., & Nadeau, C. (1999) · RePEc: Research Papers in Economics · Cited by 485
Learning When Data Sets are Imbalanced and When Costs are Unequal and Unknown
Maloof, M. A. (2003) · Cited by 406
Morik, K. J., Brockhausen, P., & Joachims, T. (1999) · RePEc: Research Papers in Economics · Cited by 350
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
A Comparative Study of Cost-Sensitive Boosting Algorithms
Ting, K. M. (2000) · Cited by 262
Adaptive feature-space conformal transformation for imbalanced-data learning
Wu, G., & Chang, E. Y. (2003) · International Conference on Machine Learning · Cited by 131
Crammer, K., Keshet, J., & Singer, Y. (2002) · Cited by 122
Further results on the margin distribution
Shawe-Taylor, J. S., & Cristianini, N. (1999) · Conference on Learning Theory · doi:10.1145/307400.307470 · Cited by 62
Instance weighting versus threshold adjusting for cost-sensitive classification
Zhao, H. (2007) · Knowledge and Information Systems · doi:10.1007/s10115-007-0079-1 · Cited by 55
Ranking-based evaluation of regression models
Rosset, S., Perlich, C., & Zadrozny, B. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0037-3 · Cited by 42
Quality assessment of individual classifications in machine learning and data mining
Kukar, M. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-005-0203-z · Cited by 30
Refining Kernels for Regression and Uneven Classification Problems
Kandola, J., & Shawe-Taylor, J. S. (2003) · Cited by 18
Encoding and decoding the knowledge of association rules over SVM classification trees
Pang, S., & Kasabov, N. K. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-008-0147-1 · Cited by 17
Cited by
A comprehensive survey on support vector machine classification: Applications, challenges and trends
Cervantes, J., Garcia-Lamont, F., Rodríguez-Mazahua, L., & Lopez, A. (2020) · Neurocomputing · doi:10.1016/j.neucom.2019.10.118 · Cited by 2,381
Learning from class-imbalanced data: Review of methods and applications
Haixiang, G., Yijing, L., Shang, J., Mingyun, G., Yuanyue, H., & Bing, G. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.12.035 · Cited by 2,377
Data preprocessing techniques for classification without discrimination
Kamiran, F., & Calders, T. (2012) · Knowledge and Information Systems · doi:10.1007/s10115-011-0463-8 · Cited by 1,305
“In Cost-Sensitive and Utility-Based learning [5,12,20,28,31], it is assumed that not all types of prediction errors are equal and not all examples are as important.”
BackgroundA 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
Cost-Sensitive Learning of Deep Feature Representations From Imbalanced Data
Khan, S. H., Hayat, M., Bennamoun, M., Sohel, F. A., & Togneri, R. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2732482 · Cited by 967
Metadata
- Authors
- Wang, B. X., & Japkowicz, N.
- Venue
- Knowledge and Information Systems
- Published
- 2009-03-05
- Volume
- 25
- Issue
- 1
- Pages
- 1-20
- ISSN
- 0219-1377 (ISSN-L)
- 0219-3116
- OpenAlex
- W2126734246
- Cited by
- 281
- References
- 40
- FWCI
- 15.18
- Type
- journal article
- 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.