The DOI matches its Crossref record; 101 of the 101 references it cites were found in a registry or an index.
Cost-sensitive boosting for classification of imbalanced data
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
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
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
(1992) · Cited by 23,431
The meaning and use of the area under a receiver operating characteristic (ROC) curve.
Hanley, J. A., & McNeil, B. J. (1982) · Radiology · doi:10.1148/radiology.143.1.7063747 · Cited by 21,856
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
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
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Proceedings of the 24th international conference on Machine learning
(2007) · doi:10.1145/1273496 · Cited by 11,630
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
(2008) · Data Mining and Market Intelligence for Optimal Marketing Returns · doi:10.4324/9780080878096-12 · Cited by 6,954
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884 · cited 7×
“[27,29], after each update to the weights, the weighted sample distributions between the mis-classified part and the correctly classified part are even, i.e., (cid:8) i,h t (x i ) = y i D t + 1 (i) = (cid:8) i,h t (x i ) (cid:5)= y i D t + 1 (i) .”
BackgroundMethodInfluentialMining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
Kittler, J., Hatef, M., Duin, R. P. W., & Matas, J. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.667881 · Cited by 5,290
Friedman, N., Geiger, D., & Goldszmidt, M. (1997) · Machine Learning · doi:10.1023/a:1007465528199 · Cited by 4,742
An Introduction to Data Mining
Stephens, C. R., & Sukumar, R. (2006) · The Handbook of Marketing Research · doi:10.4135/9781412973380.n22 · Cited by 4,562
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
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
Bauer, E., & Kohavi, R. (1999) · Machine Learning · doi:10.1023/a:1007515423169 · Cited by 2,638
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
Boosting the margin: a new explanation for the effectiveness of voting methods
Bartlett, P., Freund, Y., Lee, W. S., & Schapire, R. E. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691352 · Cited by 2,306
Integrating classification and association rule mining
Liu, B., Hsu, W., & Ma, Y. (1998) · Cited by 2,247
Addressing the Curse of Imbalanced Training Sets: One-Sided Selection.
Kubát, M., & Matwin, S. (1997) · Cited by 2,230
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 Boosting Approach to Machine Learning: An Overview
Schapire, R. E. (2003) · Lecture Notes in Statistics · doi:10.1007/978-0-387-21579-2_9 · Cited by 2,003
Improved Boosting Algorithms Using Confidence-rated Predictions
Schapire, R. E., & Singer, Y. (1999) · Machine Learning · doi:10.1023/a:1007614523901 · Cited by 1,971
The foundations of cost-sensitive learning
Elkan, C. (2001) · Cited by 1,945
Introduction to Data Mining, (First Edition)
Tan, P., Steinbach, M. S., & Kumar, V. (2005) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 1,889
UCI Repository of Machine Learning Databases
Murphy, P. M. (1994) · Medical Entomology and Zoology · Cited by 1,844
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
Quinlan, J. R. (1996) · National Conference on Artificial Intelligence · Cited by 1,586
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
Machine Learning for the Detection of Oil Spills in Satellite Radar Images
Kubat, M., Holte, R. C., & Matwin, S. (1998) · Machine Learning · doi:10.1023/a:1007452223027 · Cited by 1,243
One-class svms for document classification
Manevitz, L. M., & Yousef, M. (2002) · doi:10.5555/944790.944808 · Cited by 1,207
CMAR: accurate and efficient classification based on multiple class-association rules
Li, W., Han, J., & Pei, J. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989541 · Cited by 1,204
Fuzzy and neural approaches in engineering
Tsoukalas, L. H., & Uhrig, R. E. (1997) · Cited by 1,179
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
Efficient mining of emerging patterns: discovering trends and differences
Dong, G., & Li, J. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312191 · Cited by 1,018
The Analysis of Residuals in Cross-Classified Tables
Haberman, S. J. (1973) · Biometrics · doi:10.2307/2529686 · Cited by 1,016
Decision templates for multiple classifier fusion: an experimental comparison
Kuncheva, L. I., Bezdek, J. C., & Duin, R. P. W. (2001) · Pattern Recognition · doi:10.1016/s0031-3203(99)00223-x · Cited by 1,003
Quinlan (2003) · Cited by 1,000
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
Fawcett, T., & Provost, F. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009700419189 · Cited by 881
CPAR: Classification based on Predictive Association Rules
Yin, X., & Han, J. (2003) · Proceedings of the 2003 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.40 · Cited by 833
KNN approach to unbalanced data distributions: a case study involving information extraction
Ziang, J. (2003) · International Conference on Machine Learning · Cited by 772
Mining association rules with multiple minimum supports
Liu, B., Hsu, W., & Ma, Y. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312274 · Cited by 738
Provost, F. J., & Fawcett, T. E. (1997) · Cited by 720
Johnson, D. S., Papadimitriou, C. H., & Yannakakis, M. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90046-3 · Cited by 705
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 2×
“That is, in weighting each sample by its associated cost item, the classifier which optimizes error rate will optimize the cost error on the updated data space [106].”
BackgroundMethodData mining for direct marketing: problems and solutions
Ling, C. X., & Cheng-hui, L. (1998) · Cited by 661
AdaCost: 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
大西, 仁. (1994) · Medical Entomology and Zoology · doi:10.11225/jcss.1.2_100 · Cited by 549
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
Fast and Robust Classification using Asymmetric AdaBoost and a Detector Cascade
Viola, P. A., & Jones, M. (2001) · Cited by 474
Learning and making decisions when costs and probabilities are both unknown
Zadrozny, B., & Elkan, C. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502540 · Cited by 445
Class-Boundary Alignment for Imbalanced Dataset Learning
Wu, G., & Chang, E. Y. (2003) · Cited by 427
CAEP: Classification by Aggregating Emerging Patterns
Dong, G., Zhang, X., Wong, L., & Li, J. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46846-3_4 · Cited by 379
Machine Learning from Imbalanced Data Sets 101
Provost, F. J. (2008) · Faculty Digital Archive (New York University Florence) · Cited by 378
Concept learning and the problem of small disjuncts
Holte, R. C., Acker, L., & Porter, B. (1989) · Cited by 351
Support Vector Machines for Classification in Nonstandard Situations
Lin, Y., Lee, Y., & Wahba, G. (2002) · Machine Learning · doi:10.1023/a:1012406528296 · Cited by 348
Reducing Misclassification Costs
Pazzani, M., Merz, C., Murphy, P., Ali, K., Hume, T., & Brunk, C. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50034-9 · Cited by 340
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
Types of Cost in Inductive Concept Learning
Turney, P. D. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0212034 · Cited by 327
Data Mining Using MLC a Machine Learning Library in C
Kohavi, R., Sommerfield, D., & Dougherty, J. (1997) · Cited by 298
Schwenk, H., & Bengio, Y. (2000) · Neural Computation · doi:10.1162/089976600300015178 · Cited by 297
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
Decision trees with minimal costs
Ling, C. X., Yang, Q., Wang, J., & Zhang, S. (2004) · International Conference on Machine Learning · doi:10.1145/1015330.1015369 · Cited by 286
Evaluating boosting algorithms to classify rare classes: comparison and improvements
Joshi, M. V., Kumar, V., & Agarwal, R. C. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989527 · Cited by 268
A Comparative Study of Cost-Sensitive Boosting Algorithms
Ting, K. M. (2000) · Cited by 262
Pruning decision trees with misclassification costs
Bradford, J. P., Kunz, C., Kohavi, R., Brunk, C., & Brodley, C. E. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026682 · Cited by 195
Improving an Association Rule Based Classifier
Liu, B., Ma, Y., & Wong, C. K. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45372-5_58 · Cited by 160
Supervised Versus Unsupervised Binary-Learning by Feedforward Neural Networks
Japkowicz, N. (2001) · Machine Learning · doi:10.1023/a:1007660820062 · Cited by 154
An iterative method for multi-class cost-sensitive learning
Abe, N., Zadrozny, B., & Langford, J. C. (2004) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1014052.1014056 · Cited by 148
Bayesian networks for knowledge discovery
Heckerman, D. E. (1996) · Knowledge Discovery and Data Mining · Cited by 147
Data mining using /spl Mscr/ℒ/spl Cscr/++ a machine learning library in C++
Kohavi, R., Sommerfield, D. A., & Dougherty, J. (2005) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/tai.1996.560457 · Cited by 146
Concept-Learning in the Presence of Between-Class and Within-Class Imbalances
Japkowicz, N. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45153-6_7 · Cited by 138
REPRESENTATION DESIGN AND BRUTE-FORCE INDUCTION IN A BOEING MANUFACTURING DOMAIN
Riddle, P., Segal, R. B., & Etzioni, O. (1994) · Applied Artificial Intelligence · doi:10.1080/08839519408945435 · Cited by 128
Learning goal oriented Bayesian networks for telecommunications risk management
Ezawa, K. J., Singh, M., & Norton, S. W. (1996) · Cited by 124
A Bias-Variance Analysis of a Real World Learning Problem: The CoIL Challenge 2000
van der Putten, P., & van Someren, M. (2004) · Machine Learning · doi:10.1023/b:mach.0000035476.95130.99 · Cited by 116
Improving Minority Class Prediction Using Case-Specific Feature Weights
Cardie, C., & Nowe, N. (1997) · Smith ScholarWorks (Smith College) · Cited by 109
A lazy approach to pruning classification rules
Baralis, E., & Garza, P. (2003) · Proceedings · doi:10.1109/icdm.2002.1183883 · Cited by 99
Improved Estimates for the Accuracy of Small Disjuncts
Quinlan, J. R. (1991) · Machine Learning · doi:10.1007/bf00153762 · Cited by 88
High-order pattern discovery from discrete-valued data
Wong, A. K. C., & Wang, Y. (1997) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.649314 · Cited by 83
Self-citationData Dependence in Combining Classifiers
Kamel, M. S., & Wanas, N. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44938-8_1 · Cited by 58
Self-citationNeural network method for failure detection with skewed class distribution
Carvajal, K., Chacón, M., Mery, D., & Acuña, G. (2004) · Insight - Non-Destructive Testing and Condition Monitoring · doi:10.1784/insi.46.7.399.55578 · Cited by 23
High-order pattern discovery and analysis of discrete-valued data sets
Wang, Y. (1997) · Library and Archives Canada (Government of Canada) · Cited by 23
Self-citationFeature-based architectures for decision fusion
Kamel, M. S., Karray, F. O., & Wanas, N. (2003) · Cited by 16
Self-citationSupervised Versus Unsupervised Binary-Learning by Feedforward Neural Networks
JapkowiczNathalie (2001) · Machine Learning · doi:10.5555/599609.599629 · Cited by 13
Empirical Study on Weighted Voting Multiple Classifiers
Sun, Y., Kamel, M. S., & Wong, A. K. C. (2005) · Lecture notes in computer science · doi:10.1007/11551188_36 · Cited by 12
Self-citationBayesian formulations of multiple instance learning with applications to general object recognition
Kück, H. (2009) · cIRcle (University of British Columbia) · doi:10.14288/1.0051335 · Cited by 7
(1996)
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
Saito, T., & Rehmsmeier, M. (2015) · PLOS ONE · doi:10.1371/journal.pone.0118432 · Cited by 5,309
Survey on deep learning with class imbalance
Johnson, J. M., & Khoshgoftaar, T. M. (2019) · Journal of Big Data · doi:10.1186/s40537-019-0192-5 · Cited by 3,032
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
Rokach, L. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-009-9124-7 · Cited by 2,657
Metadata
- Authors
- Sun, Y., Kamel, M. S., Wong, A. K. C., & Wang, Y.
- Venue
- Pattern Recognition
- Publisher
- Elsevier BV
- Published
- 2007-12
- Volume
- 40
- Issue
- 12
- Pages
- 3358-3378
- ISSN
- 0031-3203 (ISSN-L)
- OpenAlex
- W2103614420
- Cited by
- 1,423
- References
- 101
- FWCI
- 29.16
- 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.