The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
ADASYN: Adaptive synthetic sampling approach for imbalanced learning
Abstract
This paper presents a novel adaptive synthetic (ADASYN) sampling approach for learning from imbalanced data sets. The essential idea of ADASYN is to use a weighted distribution for different minority class examples according to their level of difficulty in learning, where more synthetic data is generated for minority class examples that are harder to learn compared to those minority examples that are easier to learn. As a result, the ADASYN approach improves learning with respect to the data distributions in two ways: (1) reducing the bias introduced by the class imbalance, and (2) adaptively shifting the classification decision boundary toward the difficult examples. Simulation analyses on several machine learning data sets show the effectiveness of this method across five evaluation metrics.
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
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
Addressing 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
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
The Case against Accuracy Estimation for Comparing Induction Algorithms
Provost, F. J., Fawcett, T. E., & Kohavi, R. (1998) · Cited by 1,031
C4.5, Class Imbalance, and Cost Sensitivity: Why Under-Sampling beats Over-Sampling
Drummond, C., & Holte, R. C. (2003) · Cited by 799
Provost, F. J., & Fawcett, T. E. (1997) · Cited by 720
ROC Graphs: Notes and Practical Considerations for Data Mining Researchers
Fawcett, T. E. (2003) · Cited by 632
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
Distributed data mining in credit card fraud detection
Chan, P. K., Fan, W., Prodromidis, A. L., & Stolfo, S. J. (1999) · IEEE Intelligent Systems · doi:10.1109/5254.809570 · Cited by 538
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
Chan, P. K., & Stolfo, S. J. (1998) · Cited by 452
KBA: kernel boundary alignment considering imbalanced data distribution
Wu, G., & Chang, E. Y. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.95 · Cited by 380
Machine Learning from Imbalanced Data Sets 101
Provost, F. J. (2008) · Faculty Digital Archive (New York University Florence) · Cited by 378
Learning on the border: active learning in imbalanced data classification
Ertekin, S., Huang, J., Bottou, L., & Giles, L. (2007) · Proceedings of the sixteenth ACM conference on Conference on information and knowledge management · doi:10.1145/1321440.1321461 · Cited by 365
Adressing the curse of imbalanced training sets: one-sided selection
Kubát, M. (1997) · Medical Entomology and Zoology · Cited by 328
Boosted Classification Trees and Class Probability/Quantile Estimation
Mease, D., Wyner, A. J., & Buja, A. (2007) · ScholarlyCommons (University of Pennsylvania) · doi:10.5555/1248659.1248675 · Cited by 243
Zhu, J., & Hovy, E. H. (2007) · Cited by 201
Active learning for class imbalance problem
Ertekin, S., Huang, J., & Giles, C. L. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277927 · Cited by 166
A Kernel-Based Two-Class Classifier for Imbalanced Data Sets
Hong, X., Chen, S., & Harris, C. J. (2007) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.882812 · Cited by 161
A Ranked Subspace Learning Method for Gene Expression Data Classification
He, H., & Shen, X. (2007) · International Conference on Artificial Intelligence · Cited by 38
Self-citation(1996)
Research works printed but not linked: 7
- maloof, 2003, learning when data sets are imbalanced and when cost are unequal and unkown, ICML'03 Workshop on Learning from Imbalanced Data Sets II
- chawla, 2003, c4.5 and imbalanced datasets: investigating the effect of sampling method, probalistic estimate, and decision tree structure, ICML-KDD'03 Workshop Learning from Imbalanced Data Sets
- abe, 2003, invited talk: sampling approaches to learning from imbalanced datasets: active learning, cost sensitive learning and beyond, ICML-KDD'03 Workshop Learning from Imbalanced Data Sets
- 0, UCI Machine Learning Repository
- 2003, imbalanced clustering for microarray time-series, Proc ICML'03 workshop on Learning from Imbalanced Data Sets
- 2000, Learning from Imbalanced Data Sets
- pearson, 2003, imbalanced clustering for microarray time-series, Proc ICML'03 workshop on Learning from Imbalanced Data Sets
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
Self-citationClass-Balanced Loss Based on Effective Number of Samples
Cui, Y., Jia, M., Lin, T.-Y., Song, Y., & Belongie, S. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00949 · Cited by 3,094
Learning from imbalanced data: open challenges and future directions
Krawczyk, B. (2016) · Progress in Artificial Intelligence · doi:10.1007/s13748-016-0094-0 · Cited by 2,459
SMOTE for Learning from Imbalanced Data: Progress and Challenges, Marking the 15-year Anniversary
Fernandez, A., Garcia, S., Herrera, F., & Chawla, N. V. (2018) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.11192 · Cited by 2,219
CatBoost for big data: an interdisciplinary review
Hancock, J. T., & Khoshgoftaar, T. M. (2020) · Journal of Big Data · doi:10.1186/s40537-020-00369-8 · Cited by 1,814
Metadata
- Authors
- He, H., Bai, Y., Garcia, E. A., & Li, S.
- Venue
- 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)
- Publisher
- IEEE
- Published
- 2008-06
- Pages
- 1322-1328
- OpenAlex
- W2104933073
- Cited by
- 4,521
- References
- 27
- FWCI
- 4.22
- 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.