Inferensys

Glossary

Minimum Redundancy Maximum Relevance (mRMR)

A filter-based feature selection algorithm that selects a subset of features with maximal statistical dependency on the target outcome and minimal mutual redundancy among themselves.
Data engineer managing feature store on laptop, feature definitions visible, casual data engineering session.
FEATURE SELECTION

What is Minimum Redundancy Maximum Relevance (mRMR)?

A filter-based feature selection algorithm that identifies an optimal subset of variables by maximizing their statistical dependency on a target outcome while simultaneously minimizing the mutual information shared among the selected features.

Minimum Redundancy Maximum Relevance (mRMR) is a feature selection algorithm that selects a subset of radiomic features with maximal statistical dependency on the target outcome and minimal mutual redundancy. It operationalizes the principle that an optimal feature set should contain variables that are individually highly predictive of the clinical endpoint yet collectively uncorrelated with one another.

The algorithm uses mutual information to iteratively score and rank features, balancing a relevance term against a redundancy penalty. This ensures the final radiomic signature captures diverse, non-overlapping biological information, directly combating multicollinearity and reducing the risk of overfitting in high-dimensional datasets where the number of extracted features vastly exceeds the number of patient samples.

FEATURE SELECTION

Key Characteristics of mRMR

Minimum Redundancy Maximum Relevance (mRMR) balances two competing objectives to identify the most compact and predictive feature subset. It selects features that have high mutual information with the target variable while penalizing features that are highly correlated with each other.

01

Max-Relevance Criterion

The algorithm first identifies features with the highest statistical dependency on the target outcome variable. Relevance is typically quantified using mutual information, which measures the amount of information one variable provides about another. For a target class c and feature set S, the max-relevance condition maximizes the average mutual information between individual features x_i and the target:

  • Goal: Select features that are most predictive of the clinical endpoint
  • Metric: max D(S,c) where D = (1/|S|) Σ I(x_i; c)
  • Example: In tumor grading, SUVmax and entropy may show high individual relevance to malignancy status
Mutual Information
Primary Metric
02

Min-Redundancy Constraint

Features selected solely on relevance often exhibit high inter-correlation, leading to redundant information and inflated dimensionality. The min-redundancy condition penalizes features that share high mutual information with already-selected features:

  • Goal: Eliminate features that carry overlapping information
  • Metric: min R(S) where R = (1/|S|²) Σ I(x_i; x_j)
  • Impact: Prevents multicollinearity and reduces overfitting in downstream radiomic models
  • Example: Volume and maximum diameter are often redundant; mRMR retains only one
03

Incremental Search Strategy

mRMR employs a greedy forward selection approach rather than exhaustive search, which would be computationally intractable for high-dimensional radiomic feature sets. The algorithm iteratively adds one feature at a time:

  • First feature: Selected purely on maximum relevance to the target
  • Subsequent features: Chosen to maximize the mRMR score = relevance minus redundancy
  • Optimization: max Φ(D,R) where Φ = D - R (MID scheme) or Φ = D / R (MIQ scheme)
  • Stopping criterion: Predefined number of features k or threshold on incremental gain
04

Mutual Information Difference vs. Quotient

The algorithm offers two primary operational schemes for combining relevance and redundancy into a single objective function:

  • MID (Mutual Information Difference): Φ = D - R — subtracts redundancy from relevance directly, favoring features with high net information gain
  • MIQ (Mutual Information Quotient): Φ = D / R — divides relevance by redundancy, emphasizing features with high relevance-to-redundancy ratios
  • Selection guidance: MID tends to select more features with high absolute relevance; MIQ is more aggressive at suppressing redundancy
  • Practical note: Both schemes often yield similar top-ranked features but may diverge in mid-ranked selections
05

Radiomic Application Context

mRMR is particularly well-suited to radiomic biomarker discovery where feature sets are vast (hundreds to thousands of features) and sample sizes are limited:

  • Input: PyRadiomics-extracted feature matrices containing shape, first-order, and texture features
  • Preprocessing: Features are typically z-score normalized and discretized before mRMR application
  • Integration: Often paired with LASSO or SVM-RFE for final model building after mRMR reduces the feature pool
  • Validation: Selected features must demonstrate stability via Intraclass Correlation Coefficient (ICC) across test-retest scans
  • Clinical impact: Enables parsimonious radiomic signatures with fewer features than patients, satisfying statistical power requirements
06

Comparison with Alternative Methods

mRMR occupies a specific niche in the feature selection landscape, balancing filter efficiency with multivariate awareness:

  • vs. Univariate filters (t-test, chi-squared): mRMR accounts for feature interdependencies that univariate methods ignore
  • vs. LASSO: LASSO performs embedded selection during model training; mRMR is model-agnostic and can precede any classifier
  • vs. Principal Component Analysis (PCA): PCA creates latent variables, losing interpretability; mRMR preserves original feature identities for clinical explainability
  • vs. Recursive Feature Elimination (RFE): RFE is wrapper-based and computationally heavier; mRMR is faster for initial high-dimensional screening
  • Limitation: Greedy search may miss optimal combinations that require joint evaluation of feature subsets
FEATURE SELECTION

Frequently Asked Questions

Clear, technically precise answers to the most common questions about the Minimum Redundancy Maximum Relevance (mRMR) algorithm and its critical role in building robust radiomic signatures.

Minimum Redundancy Maximum Relevance (mRMR) is a filter-based feature selection algorithm that identifies a subset of features with maximal statistical dependency on the target outcome (relevance) while simultaneously minimizing the mutual information shared among the selected features themselves (redundancy). The algorithm operates iteratively using a greedy search. In the first step, it selects the single feature with the highest mutual information with the target variable. For each subsequent step, it selects the feature that maximizes the objective function max Φ(D,R) = D - R, where D is the mean mutual information between candidate features and the target, and R is the mean mutual information between the candidate and all previously selected features. This ensures each new feature adds unique predictive power rather than duplicating information already captured, making it ideal for high-dimensional radiomic datasets where thousands of features are extracted from a single region of interest.

FEATURE SELECTION COMPARISON

mRMR vs. Other Feature Selection Methods

Comparative analysis of Minimum Redundancy Maximum Relevance against common feature selection techniques used in radiomic signature development.

FeaturemRMRLASSOMutual Information Maximization

Handles feature redundancy

Considers feature-target relevance

Computational complexity

O(n²·m)

O(n·m)

O(n·m)

Requires labeled data

Built-in regularization

Outputs ranked feature list

Suitable for high-dimensional radiomics (n << p)

Captures non-linear dependencies

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.