Inferensys

Glossary

ADASYN

Adaptive Synthetic Sampling (ADASYN) is an over-sampling algorithm that generates synthetic data for minority class examples, using a weighted distribution to focus on instances that are harder to learn based on the density of majority class neighbors.
Data scientist building training data pipeline on laptop, data preprocessing visible, technical workspace.
ADAPTIVE SYNTHETIC SAMPLING

What is ADASYN?

An advanced over-sampling technique that generates synthetic minority class examples adaptively, focusing on harder-to-learn instances based on the local density of majority class neighbors.

Adaptive Synthetic Sampling (ADASYN) is an over-sampling algorithm that generates synthetic data for the minority class, using a weighted distribution where more synthetic examples are created for minority instances that are harder to learn—specifically, those with a higher density of majority class neighbors in their immediate vicinity. Unlike uniform over-sampling methods, ADASYN adaptively shifts the decision boundary toward difficult regions.

The algorithm calculates the number of synthetic samples to generate for each minority instance based on the ratio of majority neighbors among its k-nearest neighbors. This density distribution ensures that borderline and overlapping regions receive more attention, reducing the bias introduced by simple duplication and improving model sensitivity to the most challenging fraud patterns in severely imbalanced datasets.

ADAPTIVE SAMPLING MECHANICS

Key Characteristics of ADASYN

ADASYN (Adaptive Synthetic Sampling) generates synthetic data points for the minority class, focusing computational effort on hard-to-learn examples near the decision boundary rather than uniformly across the feature space.

01

Density Distribution as a Weighting Mechanism

Unlike uniform oversampling, ADASYN uses a density distribution to determine how many synthetic samples to generate for each minority instance. The algorithm calculates the ratio of majority class neighbors among the k-nearest neighbors for each minority point. A higher ratio indicates a harder-to-learn example, receiving a higher sampling weight. This ensures synthetic data generation is concentrated where the class overlap is greatest, adaptively shifting the decision boundary toward the majority class.

02

Adaptive Boundary Shifting

The core objective of ADASYN is to shift the classifier's decision boundary toward difficult regions. By flooding the area around minority instances that are surrounded by majority examples, the algorithm forces subsequent classifiers to pay more attention to the borderline. This two-step process—first learning the difficulty distribution, then generating samples—creates a more robust separation plane compared to blind interpolation methods like standard SMOTE.

03

Algorithmic Steps and Computation

ADASYN executes in three distinct phases:

  • Calculate Imbalance Ratio: Determines the total number of synthetic samples needed to balance the dataset.
  • Density Calculation: For each minority instance xi, finds its k-nearest neighbors and computes the ratio ri = (majority neighbors) / k.
  • Sample Generation: Normalizes ri to create a probability distribution, then generates gi = ri × G synthetic samples for each xi using SMOTE-style interpolation with randomly selected minority neighbors.
04

Sensitivity to Noise and Outliers

A critical trade-off of ADASYN is its high sensitivity to outliers. Because the algorithm assigns the highest weights to minority instances with the most majority neighbors, isolated noisy minority points in predominantly majority regions receive disproportionate synthetic generation. This can amplify noise and degrade model performance if the dataset contains mislabeled examples. Pre-cleaning with techniques like Edited Nearest Neighbors is often recommended before applying ADASYN.

05

Comparison to Standard SMOTE

While SMOTE generates a fixed number of synthetic samples for every minority instance uniformly, ADASYN introduces an adaptive component:

  • SMOTE: Blind interpolation; treats all minority examples equally.
  • ADASYN: Weighted generation; focuses on the 'hard' examples.
  • Result: ADASYN often achieves higher recall on the minority class but may produce lower precision due to boundary overfitting. It excels when the primary goal is to detect as many positive cases as possible, such as in fraud detection screening layers.
SYNTHETIC OVERSAMPLING COMPARISON

ADASYN vs. SMOTE vs. Borderline-SMOTE

Comparative analysis of three synthetic minority oversampling algorithms based on generation strategy, density sensitivity, and noise handling for imbalanced classification.

FeatureADASYNSMOTEBorderline-SMOTE

Generation Strategy

Density-adaptive weighted distribution

Uniform random interpolation

Boundary-focused interpolation only

Focus Area

Hard-to-learn minority examples

All minority class examples

Minority examples near decision boundary

Density Sensitivity

Uses Majority Class Info

Noise Amplification Risk

High (amplifies outliers)

Moderate

Low (ignores interior noise)

Computational Complexity

O(n²) with k-NN search

O(n²) with k-NN search

O(n²) with k-NN search

Handles Sub-Clusters

Risk of Overfitting

Moderate-High

High

Moderate

ADAPTIVE SYNTHETIC SAMPLING

Frequently Asked Questions

Clarifying the mechanics, advantages, and implementation nuances of the ADASYN algorithm for handling severely imbalanced datasets in machine learning.

Adaptive Synthetic Sampling (ADASYN) is an over-sampling algorithm that generates synthetic data for the minority class, focusing adaptively on examples that are harder to learn. Unlike uniform sampling methods, ADASYN uses a density distribution to determine the number of synthetic samples to generate for each minority instance. The algorithm first calculates the ratio of majority class neighbors among the k-nearest neighbors for each minority point. A higher ratio indicates a harder-to-learn region. It then normalizes these ratios into a probability distribution, allocating more synthetic samples to minority instances surrounded by majority class neighbors. This shifts the decision boundary toward difficult areas, forcing the classifier to learn a more complex, adaptive boundary rather than a simple, biased one.

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.