_
imbalanced-learn is a python package offering a number of re-sampling techniques commonly used in datasets showing strong between-class imbalance. It is compatible with scikit-learn and is part of scikit-learn-contrib projects.
Installation documentation, API documentation, and examples can be found on the documentation.
imbalanced-learn is tested to work under Python 2.7 and Python 3.4, 3.5, and 3.6.
- scipy(>=0.18.1)
- numpy(>=1.11.2)
- scikit-learn(>=0.18.1)
Additionally, to run the examples, you need matplotlib(>=2.0.0).
imbalanced-learn is currently available on the PyPi's repository and you can install it via `pip`:
pip install -U imbalanced-learnThe package is release also in Anaconda Cloud platform:
conda install -c glemaitre imbalanced-learnIf you prefer, you can clone it and run the setup.py file. Use the following commands to get a copy from GitHub and install all dependencies:
git clone https://github.com/scikit-learn-contrib/imbalanced-learn.git
cd imbalanced-learn
pip install .After installation, you can use nose to run the test suite:
make coverageThe development of this scikit-learn-contrib is in line with the one of the scikit-learn community. Therefore, you can refer to their Development Guide.
If you use imbalanced-learn in a scientific publication, we would appreciate citations to the following paper:
@article{JMLR:v18:16-365,
author = {Guillaume Lema{{\^i}}tre and Fernando Nogueira and Christos K. Aridas},
title = {Imbalanced-learn: A Python Toolbox to Tackle the Curse of Imbalanced Datasets in Machine Learning},
journal = {Journal of Machine Learning Research},
year = {2017},
volume = {18},
number = {17},
pages = {1-5},
url = {http://jmlr.org/papers/v18/16-365.html}
}Most classification algorithms will only perform optimally when the number of samples of each class is roughly the same. Highly skewed datasets, where the minority is heavily outnumbered by one or more classes, have proven to be a challenge while at the same time becoming more and more common.
One way of addressing this issue is by re-sampling the dataset as to offset this imbalance with the hope of arriving at a more robust and fair decision boundary than you would otherwise.
- Re-sampling techniques are divided in two categories:
- Under-sampling the majority class(es).
- Over-sampling the minority class.
- Combining over- and under-sampling.
- Create ensemble balanced sets.
Below is a list of the methods currently implemented in this module.
- Under-sampling
- Random majority under-sampling with replacement
- Extraction of majority-minority Tomek links1
- Under-sampling with Cluster Centroids
- NearMiss-(1 & 2 & 3)2
- Condensend Nearest Neighbour3
- One-Sided Selection4
- Neighboorhood Cleaning Rule5
- Edited Nearest Neighbours6
- Instance Hardness Threshold7
- Repeated Edited Nearest Neighbours8
- AllKNN9
The different algorithms are presented in the sphinx-gallery.
: I. Tomek, “Two modifications of CNN,” In Systems, Man, and Cybernetics, IEEE Transactions on, vol. 6, pp 769-772, 2010.↩
- I. Mani, I. Zhang. “kNN approach to unbalanced data distributions
a case study involving information extraction,” In Proceedings of workshop on learning from imbalanced datasets, 2003.
: P. Hart, “The condensed nearest neighbor rule,” In Information Theory, IEEE Transactions on, vol. 14(3), pp. 515-516, 1968.↩
- M. Kubat, S. Matwin, “Addressing the curse of imbalanced training sets
one-sided selection,” In ICML, vol. 97, pp. 179-186, 1997.
: J. Laurikkala, “Improving identification of difficult small classes by balancing class distribution,” Springer Berlin Heidelberg, 2001.↩
: D. Wilson, “Asymptotic Properties of Nearest Neighbor Rules Using Edited Data,” In IEEE Transactions on Systems, Man, and Cybernetrics, vol. 2 (3), pp. 408-421, 1972.↩
- D. Smith, Michael R., Tony Martinez, and Christophe Giraud-Carrier. “An instance level analysis of data complexity.” Machine learning 95.2 (2014)
225-256.
: I. Tomek, “An Experiment with the Edited Nearest-Neighbor Rule,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 6(6), pp. 448-452, June 1976.↩
: I. Tomek, “An Experiment with the Edited Nearest-Neighbor Rule,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 6(6), pp. 448-452, June 1976.↩
- N. V. Chawla, K. W. Bowyer, L. O.Hall, W. P. Kegelmeyer, “SMOTE
synthetic minority over-sampling technique,” Journal of artificial intelligence research, 321-357, 2002.
- H. Han, W. Wen-Yuan, M. Bing-Huan, “Borderline-SMOTE
a new over-sampling method in imbalanced data sets learning,” Advances in intelligent computing, 878-887, 2005.
: H. M. Nguyen, E. W. Cooper, K. Kamei, “Borderline over-sampling for imbalanced data classification,” International Journal of Knowledge Engineering and Soft Data Paradigms, 3(1), pp.4-21, 2001.↩
- He, Haibo, Yang Bai, Edwardo A. Garcia, and Shutao Li. “ADASYN
Adaptive synthetic sampling approach for imbalanced learning,” In IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence), pp. 1322-1328, 2008.
- G. Batista, B. Bazzan, M. Monard, [“Balancing Training Data for Automated Annotation of Keywords
a Case Study,” In WOB, 10-18, 2003.
: G. Batista, R. C. Prati, M. C. Monard. “A study of the behavior of several methods for balancing machine learning training data,” ACM Sigkdd Explorations Newsletter 6 (1), 20-29, 2004.↩
: X. Y. Liu, J. Wu and Z. H. Zhou, “Exploratory Undersampling for Class-Imbalance Learning,” in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), vol. 39, no. 2, pp. 539-550, April 2009.↩
: X. Y. Liu, J. Wu and Z. H. Zhou, “Exploratory Undersampling for Class-Imbalance Learning,” in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), vol. 39, no. 2, pp. 539-550, April 2009.↩