All Projects → kaushalshetty → SMOTE

kaushalshetty / SMOTE

Licence: other
Synthetic Minority Over-sampling Technique

Programming Languages

python
139335 projects - #7 most used programming language

Projects that are alternatives of or similar to SMOTE

multi-imbalance
Python package for tackling multi-class imbalance problems. http://www.cs.put.poznan.pl/mlango/publications/multiimbalance/
Stars: ✭ 66 (+135.71%)
Mutual labels:  smote, oversampling
Class-Imbalance
Dealing with class imbalance problem in machine learning. Synthetic oversampling(SMOTE, ADASYN).
Stars: ✭ 31 (+10.71%)
Mutual labels:  smote, oversampling
Deep-Learning-Experiments-implemented-using-Google-Colab
Colab Compatible FastAI notebooks for NLP and Computer Vision Datasets
Stars: ✭ 16 (-42.86%)
Mutual labels:  smote
oversimple
A library for audio oversampling, which tries to offer a simple api while wrapping HIIR, by Laurent De Soras, for minimum phase antialiasing, and r8brain-free-src, by Aleksey Vaneev, for linear phase antialiasing.
Stars: ✭ 25 (-10.71%)
Mutual labels:  oversampling
Machine Learning
A repository of resources for understanding the concepts of machine learning/deep learning.
Stars: ✭ 29 (+3.57%)
Mutual labels:  smote
smogn
Synthetic Minority Over-Sampling Technique for Regression
Stars: ✭ 238 (+750%)
Mutual labels:  smote
AIML-Projects
Projects I completed as a part of Great Learning's PGP - Artificial Intelligence and Machine Learning
Stars: ✭ 85 (+203.57%)
Mutual labels:  oversampling
geometric-smote
Implementation of the Geometric SMOTE over-sampling algorithm.
Stars: ✭ 20 (-28.57%)
Mutual labels:  oversampling
imbalance
ncordon.github.io/imbalance
Stars: ✭ 33 (+17.86%)
Mutual labels:  oversampling
This is a README file



The code is an implementation of the SMOTE model(Synthetic Minority Over-sampling Technique) from the paper 
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.


Usage

N = percentage of over-sampling required
k = no. of nearest neighbors
smote_test = Smote('euclidian')
smote_test.genarate_synthetic_points(min_samples,N,k)


Note that ball tree uses an implementation of sklearns nearest neighbor module.In case you do not hav sklearns nearest neighbor module 
you can implement the euclidian distance to find the nearest neighbor.

Requirements:
NumPy
Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].