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

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

MWMOTE--Majority Weighted Minority Oversampling Technique for Imbalanced Data Set Learning

Barua, Sukarna, Islam, Md. Monirul, Yao, Xin, Murase, Kazuyuki·2014·IEEE Transactions on Knowledge and Data Engineering

Abstract

Imbalanced learning problems contain an unequal distribution of data samples among different classes and pose a challenge to any classifier as it becomes hard to learn the minority class samples. Synthetic oversampling methods address this problem by generating the synthetic minority class samples to balance the distribution between the samples of the majority and minority classes. This paper identifies that most of the existing oversampling methods may generate the wrong synthetic minority samples in some scenarios and make learning tasks harder. To this end, a new method, called Majority Weighted Minority Oversampling TEchnique (MWMOTE), is presented for efficiently handling imbalanced learning problems. MWMOTE first identifies the hard-to-learn informative minority class samples and assigns them weights according to their euclidean distance from the nearest majority class samples. It then generates the synthetic samples from the weighted informative minority class samples using a clustering approach. This is done in such a way that all the generated samples lie inside some minority class cluster. MWMOTE has been evaluated extensively on four artificial and 20 real-world data sets. The simulation results show that our method is better than or comparable with some other existing methods in terms of various assessment metrics, such as geometric mean (G-mean) and area under the receiver operating curve (ROC), usually known as area under curve (AUC).

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/tkde.2012.232

Cites

6 of 6 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

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 6 references

Research works printed but not linked: 38

  1. 10.1145/1281192.1281279 · DOI
  2. rao, 1995, A Review of Canonical Coordinates and an Alternative to Correspondence Analysis Using Hellinger Distance, Questiio? Quaderns D'Estadi?stica Sistemes Informatica i Investigacio? Operativa, 19, 23
  3. 10.1109/ICDM.2008.87 · DOI
  4. freund, 1996, Experiments with a New Boosting Algorithm, Proc Int'l Conf Machine Learning, 148
  5. chawla, 2003, SMOTEBoost: Improving Prediction of the Minority Class in Boosting, Proc 17th European Conf Principles and Practice of Knowledge Discovery in Databases, 107
  6. 10.1109/TSMCB.2012.2187280 · DOI · Paper page
  7. tomek, 1976, Two Modifications of CNN, IEEE Trans System Man Cybernetics, 6, 769, 10.1109/TSMC.1976.4309452 · DOI · Paper page
  8. kubat, 1997, Addressing the Curse of Imbalanced Training Sets: One-Sided Selection, Proc Int'l Conf Machine Learning, 179
  9. mease, 2007, Boosted Classification Trees and Class Probability/Quantile Estimation, J Machine Learning Research, 8, 409
  10. 10.1145/1007730.1007735 · DOI · Paper page
  11. 10.1016/j.patrec.2005.10.010 · DOI · Paper page
  12. 10.1145/278459.258539 · doi:10.1145/278459.258539
  13. japkowicz, 2000, Learning from Imbalanced Data Sets: A Comparison of Various Strategies, AAAI Workshop on Learning from Imbalanced Data Sets, 10
  14. 10.1002/9781118165881 · DOI · Paper page
  15. 10.1016/0306-4573(86)90097-X · doi:10.1016/0306-4573(86)90097-x
  16. 10.1145/1007730.1007736 · DOI · Paper page
  17. drummond, 2005, Severe Class Imbalance: Why Better Algorithms Aren't the Answer, Proc 16th European Conf Machine Learning, 539
  18. provost, 2000, Machine Learning from Imbalanced Data Sets 101, Proc Learning from Imbalanced Data Sets Papers from the Am Assoc for Artificial Intelligence Workshop
  19. prati, 2004, Class Imbalances versus Class Overlapping: An Analysis of a Learning System Behavior, Proc Mexican Int'l Conf Artificial Intelligence, 312
  20. 10.1145/1007730.1007737 · DOI · Paper page
  21. holte, 1989, Concept Learning and the Problem of Small Disjuncts, Proc Int'l Joint Conf Artificial Intelligence, 813
  22. quinlan, 1993, C4 5 Programs for Machine Learning
  23. ling, 1998, Data Mining for Direct Marketing: Problems and Solutions, Proc Int'l Conf Knowledge Discovery and Data Mining, 73
  24. demsar, 2006, Statistical Comparisons of Classifiers over Multiple Data Sets, J Machine Learning Research, 7, 1
  25. 10.1023/A:1007452223027 · DOI · Paper page
  26. 10.1016/0010-4655(91)90014-C · DOI
  27. japkowicz, 1995, A Novelty Detection Approach to Classification, Proc 14th Joint Conf Artificial Intelligence, 518
  28. 10.1023/A:1009700419189 · DOI · Paper page
  29. 10.1016/B978-1-55860-335-6.50026-X · DOI · Paper page
  30. zhang, 2003, KNN Approach to Unbalanced Data Distributions: A Case Study Involving Information Extraction, Proc Int Conf Mach Learning Workshop Learning Imbalanced Data Sets
  31. liu, 2006, Exploratory Under Sampling for Class Imbalance Learning, Proc Int'l Conf Data Mining, 965
  32. laurikkala, 2001, Improving Identification of Difficult Small Classes by Balancing Class Distribution, Proc Conf AI in Medicine in Europe Artificial Intelligence Medicine, 63, 10.1007/3-540-48229-6_9 · DOI · Paper page
  33. 10.1111/j.0824-7935.2004.t01-1-00228.x · DOI · Paper page
  34. 10.1007/s10618-008-0087-0 · DOI · Paper page
  35. 10.1109/TKDE.2008.239 · DOI · Paper page
  36. 10.1109/TNN.2010.2066988 · DOI · Paper page
  37. he, 2008, ADASYN: Adaptive Synthetic Sampling Approach for Imbalanced Learning, Proc Int'l Joint Conf Neural Networks, 1322
  38. han, 2005, Borderline-SMOTE: A New Oversampling Method in Imbalanced Data Sets Learning, Proc Int'l Conf Intelligent Computing, 878

Cited by

See all 1,150

Metadata

Authors
Barua, S., Islam, M. M., Yao, X., & Murase, K.
Venue
IEEE Transactions on Knowledge and Data Engineering
Published
2014-02
Volume
26
Issue
2
Pages
405-425
ISSN
1041-4347 (ISSN-L)
OpenAlex
W2087240369
Cited by
1,150
References
6
FWCI
14.57
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

How to cite

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

This page
CoChat. (2026). Citation check: MWMOTE--Majority Weighted Minority Oversampling Technique for Imbalanced Data Set Learning. https://app.cochat.ai/papers/10.1109/tkde.2012.232
The paper
Barua, S., Islam, M. M., Yao, X., & Murase, K. (2014). MWMOTE--Majority Weighted Minority Oversampling Technique for Imbalanced Data Set Learning. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/tkde.2012.232

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.