The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
An Empirical Study of Learning from Imbalanced Data Using Random Forest
Abstract
This paper discusses a comprehensive suite of experiments that analyze the performance of the random forest (RF) learner implemented in Weka. RF is a relatively new learner, and to the best of our knowledge, only preliminary experimentation on the construction of random forest classifiers in the context of imbalanced data has been reported in previous work. Therefore, the contribution of this study is to provide an extensive empirical evaluation of RF learners built from imbalanced data. What should be the recommended default number of trees in the ensemble? What should the recommended value be for the number of attributes? How does the RF learner perform on imbalanced data when compared with other commonly-used learners? We address these and other related issues in this work.
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
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
(1992) · Cited by 23,431
The Fractal Geometry of Nature
Mandelbrot, B. B., & Wheeler, J. A. (1983) · American Journal of Physics · doi:10.1119/1.13295 · Cited by 21,832
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
The random subspace method for constructing decision forests
Ho, T. K. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.709601 · Cited by 6,842
Advances in kernel methods: support vector learning
Schölkopf, B., Burges, C. J. C., & Smola, A. J. (1999) · doi:10.5555/299094 · Cited by 5,789
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
Learning in the Presence of Concept Drift and Hidden Contexts
Widmer, G., & Kubat, M. (1996) · Machine Learning · doi:10.1023/a:1018046501280 · Cited by 1,857
Experimentation in Software Engineering
Wohlin, C., Runeson, P., Höst, M., Ohlsson, M. C., Regnell, B., & Wesslén, A. (2000) · The Kluwer International Series in Software Engineering · doi:10.1007/978-1-4615-4625-2 · Cited by 1,776
Using Random Forest to Learn Imbalanced Data
Chen, C., Liaw, A. I., & Breiman, L. (2004) · UC Berkeley · Cited by 1,340
Robust classification for imprecise environments
Provost, F., & Fawcett, T. (2001) · Machine Learning · doi:10.1023/a:1007601015854 · Cited by 1,250
A streaming ensemble algorithm (SEA) for large-scale classification
Street, W. N., & Kim, Y. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502568 · Cited by 1,205
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
Incremental Induction of Decision Trees
Utgoff, P. E. (1989) · Machine Learning · doi:10.1023/a:1022699900025 · Cited by 791
A fast algorithm to determine fractal dimensions by box counting
Liebovitch, L. S., & Toth, T. (1989) · Physics Letters A · doi:10.1016/0375-9601(89)90854-2 · Cited by 514
BOAT—optimistic decision tree construction
Gehrke, J., Ganti, V., Ramakrishnan, R., & Loh, W.-Y. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304197 · Cited by 288
(2007) · Advances in Database Systems · doi:10.1007/978-0-387-47534-9 · Cited by 282
Using additive expert ensembles to cope with concept drift
Kolter, J. Z., & Maloof, M. A. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102408 · Cited by 261
Systematic data selection to mine concept-drifting data streams
Fan, W. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014069 · Cited by 242
(1997) · Springer eBooks · doi:10.1007/978-94-017-2053-3 · Cited by 220
Intermediate Statistical Methods and Applications: A Computer Package Approach.
Weisberg, S., Berenson, M. L., Levine, D. M., Goldstein, M., Cooper, R. A., & Weekes, A. J. (1984) · Journal of the American Statistical Association · doi:10.2307/2288297 · Cited by 144
Fast and Light Boosting for Adaptive Mining of Data Streams
Chu, F., & Zaniolo, C. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24775-3_36 · Cited by 134
Good practice in retail credit scorecard assessment
Hand, D. J. (2005) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601932 · Cited by 119
Boosting classifiers for drifting concepts
Klinkenberg, R., & Scholz, M. (2006) · Technische Universität Dortmund Eldorado (Technische Universität Dortmund) · doi:10.17877/de290r-14320 · Cited by 110
A Statistical Framework for the Prediction of Fault-Proneness
Ma, Y., Guo, L., & Čukić, B. (2007) · IGI Global eBooks · doi:10.4018/978-1-59140-941-1.ch010 · Cited by 109
Network Intrusion Detection using Random Forests.
Zhang, J., & Zulkernine, M. (2005) · Conference on Privacy, Security and Trust · Cited by 85
GP ensembles for large-scale data classification
Gianluigi Folino, A., Pizzuti, C., & Spezzano, G. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.863627 · Cited by 54
A Survey of Distributed Mining of Data Streams
Parthasarathy, S., Ghoting, A., & Otey, M. E. (2007) · Springer eBooks · doi:10.1007/978-0-387-47534-9_13 · Cited by 26
Boinee, P., Angelis, A. D., & Foresti, G. L. (2005) · Cited by 14
(1996)
Cited by
Data mining for credit card fraud: a comparative study
Bhattacharyya, S., Jha, S., Tharakunnel, K., & Westland, J. C. (2011) · Decision Support Systems · doi:10.1016/j.dss.2010.08.008 · Cited by 1,108
Selecting critical features for data classification based on machine learning methods
Chen, R.-C., Dewi, C., Huang, S.-W., & Caraka, R. E. (2020) · Journal of Big Data · doi:10.1186/s40537-020-00327-4 · Cited by 979
Training and assessing classification rules with imbalanced data
Menardi, G., & Torelli, N. (2014) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-012-0295-5 · Cited by 765
A survey on addressing high-class imbalance in big data
Leevy, J. L., Khoshgoftaar, T. M., Bauder, R. A., & Seliya, N. (2018) · Journal of Big Data · doi:10.1186/s40537-018-0151-6 · Cited by 759
Self-citationPredicting academic success in higher education: literature review and best practices
Alyahyan, E., & Düştegör, D. (2020) · International Journal of Educational Technology in Higher Education · doi:10.1186/s41239-020-0177-7 · Cited by 615
Metadata
- Authors
- Khoshgoftaar, T. M., Golawala, M., & Hulse, J. V.
- Venue
- 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007)
- Publisher
- IEEE
- Published
- 2007-10
- Pages
- 310-317
- ISSN
- 1082-3409 (ISSN-L)
- OpenAlex
- W2104471998
- Cited by
- 361
- References
- 34
- FWCI
- 3.47
- 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.