Re-sampling techniques

Happy清子

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 links [1]
  • Under-sampling with Cluster Centroids
  • NearMiss-(1 & 2 & 3) [2]
  • Condensed Nearest Neighbour [3]
  • One-Sided Selection [4]
  • Neighboorhood Cleaning Rule [5]
  • Edited Nearest Neighbours [6]
  • Instance Hardness Threshold [7]
  • Repeated Edited Nearest Neighbours [14]
  • AllKNN [14]
    
    
• Over-sampling
  
  • Random minority over-sampling with replacement
  • SMOTE - Synthetic Minority Over-sampling Technique [8]
  • bSMOTE(1 & 2) - Borderline SMOTE of types 1 and 2 [9]
  • SVM SMOTE - Support Vectors SMOTE [10]
  • ADASYN - Adaptive synthetic sampling approach for imbalanced learning [15]
    
    
• Over-sampling followed by under-sampling
  
  • SMOTE + Tomek links [12]
  • SMOTE + ENN [11]
    
    
• Ensemble classifier using samplers internally
  
  • EasyEnsemble [13]
  • BalanceCascade [13]
  • Balanced Random Forest [16]
  • Balanced Bagging
    
  
  
  

The different algorithms are presented in the sphinx-gallery.

References:

[1]	: I. Tomek, “Two modifications of CNN,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 6, pp. 769-772, 1976.

[2]	: I. Mani, J. Zhang. “kNN approach to unbalanced data distributions: A case study involving information extraction,” In Proceedings of the Workshop on Learning from Imbalanced Data Sets, pp. 1-7, 2003.

[3]	: P. E. Hart, “The condensed nearest neighbor rule,” IEEE Transactions on Information Theory, vol. 14(3), pp. 515-516, 1968.

[4]	: M. Kubat, S. Matwin, “Addressing the curse of imbalanced training sets: One-sided selection,” In Proceedings of the 14th International Conference on Machine Learning, vol. 97, pp. 179-186, 1997.

[5]	: J. Laurikkala, “Improving identification of difficult small classes by balancing class distribution,” Proceedings of the 8th Conference on Artificial Intelligence in Medicine in Europe, pp. 63-66, 2001.

[6]	: D. Wilson, “Asymptotic Properties of Nearest Neighbor Rules Using Edited Data,” IEEE Transactions on Systems, Man, and Cybernetrics, vol. 2(3), pp. 408-421, 1972.

[7]	: M. R. Smith, T. Martinez, C. Giraud-Carrier, “An instance level analysis of data complexity,” Machine learning, vol. 95(2), pp. 225-256, 2014.

[8]	: N. V. Chawla, K. W. Bowyer, L. O. Hall, W. P. Kegelmeyer, “SMOTE: Synthetic minority over-sampling technique,” Journal of Artificial Intelligence Research, vol. 16, pp. 321-357, 2002.

[9]	: H. Han, W.-Y. Wang, B.-H. Mao, “Borderline-SMOTE: A new over-sampling method in imbalanced data sets learning,” In Proceedings of the 1st International Conference on Intelligent Computing, pp. 878-887, 2005.

[10]	: H. M. Nguyen, E. W. Cooper, K. Kamei, “Borderline over-sampling for imbalanced data classification,” In Proceedings of the 5th International Workshop on computational Intelligence and Applications, pp. 24-29, 2009.

[11]	: G. E. A. P. A. 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, vol. 6(1), pp. 20-29, 2004.

[12]	: G. E. A. P. A. Batista, A. L. C. Bazzan, M. C. Monard, “Balancing training data for automated annotation of keywords: A case study,” In Proceedings of the 2nd Brazilian Workshop on Bioinformatics, pp. 10-18, 2003.

[13]	(1, 2) : X.-Y. Liu, J. Wu and Z.-H. Zhou, “Exploratory undersampling for class-imbalance learning,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 39(2), pp. 539-550, 2009.

[14]	(1, 2) : I. Tomek, “An experiment with the edited nearest-neighbor rule,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 6(6), pp. 448-452, 1976.

[15]	: H. He, Y. Bai, E. A. Garcia, S. Li, “ADASYN: Adaptive synthetic sampling approach for imbalanced learning,” In Proceedings of the 5th IEEE International Joint Conference on Neural Networks, pp. 1322-1328, 2008.

[16]	: C. Chao, A. Liaw, and L. Breiman. “Using random forest to learn imbalanced data.” University of California, Berkeley 110 (2004): 1-12.

shaoheshaohe

very useful content

sampling is used widely  and the underlying principle should be understood in deep