Skip to content
Open access

A Comparative Study of Supervised Learning Algorithms for High-Dimensional Data

2023 · International Journal of Machine Learning and Predictive Analytics · Vol 6, pp. 01-14 · 0 citations

TL;DR

The comparative analysis indicates that there is no universal algorithm that has the best performance in all high-dimensional conditions; the performance highly depends on the sample size, the features correlation, the level of data distribution as well as noise.

Abstract

High-dimensional data are now ubiquitous in the modern science and industry, such as bioinformatics, text mining, computer vision, finance, and cybersecurity. A prominent feature of such data is having many features in comparison with the number of observations, which may cause the judgement problem of the curse of dimensionality, greater computational cost, feature overlap, and overfitting. Though supervised learning algorithms are extensively used to do predictive modeling, they have very different performance properties in high dimensional feature space. The paper contains a thorough comparison of some of the most popular supervised learning algorithms in the high-dimensional data analysis scenario. The paper provides a systematic comparison between the linear, non-linear, probabilistic, and ensemble-based classifiers, which are: Logistic Regression, Support Vector Machine, k -Nearest Neighbor, Decision Tree, Random Forest, Naive Bayes, and Artificial Neural Network. Special attention is given to the study of the behaviour of an algorithm based on scalability, ability to generalize, resistance to noise, feature sparsity, and interpretability. Besides, the paper explores how dimensionality reduction and feature selection methods impact on the performance of classification. It suggests a single experimental procedure with standardized preprocessing pipelines, cross-validation schemes and performance metrics accuracy, precision, recall, F1-score and cost of the computation. To give the concept theoretical background, mathematical formulations of learning objectives and decision functions are given. The comparative analysis indicates that there is no universal algorithm that has the best performance in all high-dimensional conditions; the performance highly depends on the sample size, the features correlation, the level of data distribution as well as noise. This study has practical implications on researchers and practitioners to consider the proper supervised learning model to use the high-dimensional datasets and identifies future research opportunities in scalable and interpretable learning.

Read PDF

Similar papers

Conference Open access 2026

Supervised Learning for Classification in Data Science: A Comparative Perspective

Overall, logistic regression demonstrates strong and good generalization ability, while ensemble methods constitute robust alternatives for binary classification on structured data.

Zahra Benider, H. Bouzahir, Jaafar Idrais · 0 citations
Review 2023

Sparse Machine Learning Models for High-Dimensional Data Analysis

Experimental findings show that sparse models provide better robustness, faster convergence, lower memory usage, and reduced training complexity than traditional dense models.

Rajesh K. Sharma, Priya Natarajan · 0 citations
Review Open access 2026

A Survey on Feature Selection Techniques for Predictive Analytics

This survey is a systematic and extensive overview of feature selection methods used in predictive analytics which are utilized in a variety of areas and fields, and gives a comprehensive theoretical background of each of the techniques as well as a comparison of each of the techniques.

Nesca Mthethwa, Thane Nkosi · 0 citations
Conference Jul 2026

Supervised and Unsupervised approach of Machine Learning: A Comparative Study for Credit Card Fraud Detection Across Diverse Datasets

Credit card fraud detection is a challenging task due to the increase in digital transactions, evolving fraud patterns, and severe class imbalance present in real-world datasets. Although several comparative studies have been done in this domain, many of them are limited to a single dataset and primarily focus on predi...

N. Mishra, Rakhi Garg · 0 citations
Review Open access 2018

Scalable Machine Learning Models for High-Dimensional Datasets

A systematic analysis of scalable machine learning models for high-dimensional data is presented, outlining structural challenges, reviewing scalable learning paradigms, and proposing a unified methodological framework that integrates feature reduction, model parallelism, and adaptive optimization.

L. O'Connor · 0 citations
Review Open access 2026

Robust Machine Learning Models for Imbalanced Dataset Classification

Comparative findings indicate that hybrid methods that combine adaptive resampling and cost sensitive loss functions are always better than simpler classifiers based on their F1-score, G-mean, and area under the precision-recall curve.

Vasanth Kumar, Girija Rajan · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.