Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 104

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Entropy and Confidence-Based Undersampling Boosting Random Forests for Imbalanced Problems

Wang, Zhe, Cao, Chenjie, Zhu, Yujin · 2020 · IEEE Transactions on Neural Networks and Learning Systems

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tnnls.2020.2964585

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

Show all 4 references

Research works printed but not linked: 54

  1. 10.1007/s00521-014-1564-6 · doi:10.1007/s00521-014-1564-6
  2. 10.1007/BF00116251 · DOI · Paper page
  3. 10.1109/TSMCA.2009.2029559 · DOI · Paper page
  4. 10.1109/TSMCC.2011.2161285 · DOI · Paper page
  5. 10.1145/1277741.1277927 · DOI · Paper page
  6. 10.1016/j.knosys.2016.09.032 · DOI · Paper page
  7. 10.1109/TNNLS.2017.2676239 · DOI
  8. zhu, 2019, Geometric structural ensemble learning for imbalanced problems, IEEE Trans Cybern
  9. 10.1007/11538059_91 · DOI · Paper page
  10. 10.1007/11816492_89 · doi:10.1007/11816492_89 · Paper page
  11. 10.1002/j.1538-7305.1948.tb01338.x · DOI · Paper page
  12. 10.1016/j.compbiomed.2010.03.005 · DOI · Paper page
  13. 10.1016/j.neunet.2016.05.006 · doi:10.1016/j.neunet.2016.05.006
  14. 10.1007/s10115-011-0465-6 · DOI · Paper page
  15. 10.1109/JPROC.2010.2045630 · DOI
  16. liu, 2009, Exploratory undersampling for class-imbalance learning, IEEE Trans Syst Man Cybern B Cybern, 39, 539, 10.1109/TSMCB.2008.2007853 · DOI · Paper page
  17. 10.1109/TKDE.2008.239 · DOI · Paper page
  18. 10.1613/jair.953 · DOI · Paper page
  19. 10.1006/jcss.1997.1504 · DOI · Paper page
  20. 10.1007/s10044-003-0192-z · DOI · Paper page
  21. 10.1007/978-3-319-31753-3_2 · DOI
  22. platt, 1999, Probabilistic outputs for support vector machines and comparisons to regularized likelihood methods, Adv Large Margin Classifiers, 10, 61
  23. 10.1155/2017/1827016 · DOI
  24. 10.1145/2939672.2939785 · DOI · Paper page
  25. benavoli, 2017, Time for a change: A tutorial for comparing multiple classifiers through Bayesian analysis, J Mach Learn Res, 18, 1
  26. 10.1109/RT.2006.280216 · DOI
  27. 10.1109/TKDE.2011.67 · DOI · Paper page
  28. 10.1016/j.patcog.2013.05.006 · DOI · Paper page
  29. chawla, 2003, C4.5 and imbalanced data sets: Investigating the effect of sampling method, probabilistic estimate, and decision tree structure, Proceedings of the ICML'03 Workshop on Class Imbalances
  30. kubat, 1997, Addressing the curse of imbalanced training sets: One-sided selection, Proc Int Conf Mach Learn, 179
  31. 10.2991/ijcis.10.1.82 · DOI · Paper page
  32. tomek, 1976, Two modifications of CNN, IEEE Trans Syst Man Cybern, smc 6, 769, 10.1109/TSMC.1976.4309452 · DOI · Paper page
  33. 10.1109/TNNLS.2012.2228231 · DOI · Paper page
  34. 10.1016/j.engappai.2016.02.011 · DOI
  35. 10.1016/j.neunet.2012.09.020 · DOI · Paper page
  36. 10.1109/TCYB.2014.2372060 · DOI · Paper page
  37. 10.1145/1007730.1007733 · DOI · Paper page
  38. 10.1007/978-3-642-22589-5_2 · doi:10.1007/978-3-642-22589-5_2
  39. 10.1016/j.patcog.2013.07.021 · DOI
  40. 10.1111/j.0824-7935.2004.t01-1-00228.x · DOI · Paper page
  41. 10.1016/j.asoc.2015.02.025 · DOI
  42. fernández-delgado, 2014, Do we need hundreds of classifiers to solve real world classification problems?, J Mach Learn Res, 15, 3133
  43. 10.1016/j.neunet.2007.12.031 · DOI · Paper page
  44. 10.1007/BF00058655 · DOI · Paper page
  45. pavlov, 2001, Random forests, Mach Learn, 45, 5, 10.1023/A:1010933404324 · DOI · Paper page
  46. 10.1109/CIDM.2009.4938667 · DOI · Paper page
  47. breiman, 1984, Classification and Regression Trees
  48. 10.1145/1273496.1273614 · DOI · Paper page
  49. 10.1007/978-3-540-39804-2_12 · DOI · Paper page
  50. 10.1016/j.neunet.2019.06.003 · DOI
  51. williams, 1996, Pearson’s correlation coefficient, New Zealand Med J, 109, 38
  52. 10.1016/B978-1-55860-036-2.50047-3 · DOI · Paper page
  53. demšar, 2006, Statistical comparisons of classifiers over multiple data sets, J Mach Learn Res, 7, 1
  54. 10.1093/bioinformatics/btg419 · DOI · Paper page

Cited by

See all 104

Metadata

Authors
Wang, Z., Cao, C., & Zhu, Y.
Venue
IEEE Transactions on Neural Networks and Learning Systems
Published
2020-12
Volume
31
Issue
12
Pages
5178-5191
ISSN
  • 2162-237X
  • 2162-2388
Cited by
104
References
4
Funders
  • Natural Science Foundation of China (61672227)
  • “Shuguang Program”
  • Shanghai Education Development Foundation and Shanghai Municipal Education Commission
  • Natural Science Foundations of China (61806078)
  • National Major Scientific and Technological Special Project for “Significant New Drugs Development” (2019ZX09201004)
  • Special Fund Project for Shanghai Informatization Development in Big Data (201901043)
  • National Key R&D Program of China (2018YFC0910500)

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Entropy and Confidence-Based Undersampling Boosting Random Forests for Imbalanced Problems. https://app.cochat.ai/papers/10.1109/tnnls.2020.2964585
The paper
Wang, Z., Cao, C., & Zhu, Y. (2020). Entropy and Confidence-Based Undersampling Boosting Random Forests for Imbalanced Problems. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2020.2964585

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.