Approaches to dimensionality reduction for ultra-high dimensional models
Abstract
The rapid advancement of high-throughput sequencing technologies has revolutionised genomic research by providing access to large amounts of genomic data. However, the most important disadvantage of using Whole Genome Sequencing (WGS) data is its statistical nature, the so-called p>>n problem. This study aimed to compare three approaches of feature selection allowing for circumventing the p>>n problem, among which one is a novel modification of Supervised Rank Aggregation (SRA). The use of the three methods was demonstrated in the classification of 1,825 individuals representing the 1000 Bull Genomes Project to 5 breeds, based on 11,915,233 SNP genotypes from WGS. In the first step, we applied three feature (i.e. SNP) selection methods: the mechanistic approach (SNP tagging) and two approaches considering biological and statistical contexts by fitting a multiclass logistic regression model followed by either 1-dimensional clustering (1D-SRA) or multi-dimensional feature clustering (MD-SRA) that was originally proposed in this study. Next, we perform the classification based on a Deep Learning architecture composed of Convolutional Neural Networks. The classification quality of the test data set was expressed by macro F1-Score. The SNPs selected by SNP tagging yielded the least satisfactory results (86.87%). Still, this approach offered rapid computing times by focussing only on pairwise LD between SNPs and disregarding the effects of SNP on classification. 1D-SRA was less suitable for ultra-high-dimensional applications due to computational, memory and storage limitations, however, the SNP set selected by this approach provided the best classification quality (96.81%). MD-SRA provided a very good balance between classification quality (95.12%) and computational efficiency (17x lower analysis time and 14x lower data storage), outperforming other methods. Moreover, unlike SNP tagging, both SRA-based approaches are universal and not limited to feature selection for genomic data. Our work addresses the urgent need for computational techniques that are both effective and efficient in the analysis and interpretation of large-scale genomic datasets. We offer a model suitable for the classification of ultra-high-dimensional data that implements fusing feature selection and deep learning techniques.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 0
- Assay
- Research Focus
- Approach
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Using a supervised principal components analysis for variable selection in high-dimensional datasets reduces false discovery rates
Insha Ullah, Kerrie Lee Mengersen, … Benoît Liquet·Statistics in MedicinePeer-reviewed·Jun 1, 2025
- An explainable deep learning classifier of bovine mastitis based on whole genome sequence data - circumventing the p>>>n problem
Krzysztof Kotlarz, Magda Mielczarek, … Joanna Szyda·International Journal of Molecular SciencesPeer-reviewed·Apr 26, 2024
- A deep learning framework for characterization of genotype data
Kristiina Ausmees, Carl Nettelblad·G3 Genes Genomes GeneticsPeer-reviewed·Jan 25, 2022
- A generative model for dimensionality reduction with millions of features and few samples
Corrado Pancotti, Piero Fariselli, … Anders Krogh·bioRxiv·Aug 9, 2026
- ConvCGP: A Convolutional Neural Network to Predict Genotypic Values of Rice Traits from Compressed Genome-Wide Polymorphisms
Tanzila Islam, Chyon Hae Kim, … Hiroyoshi Iwata·bioRxiv·Nov 20, 2024
- Accurate And Fast Feature Selection Workflow For High-Dimensional Omics Data
Yasset Pérez‐Riverol, Max Kühn, … Enrique Audain·PLoS ONEPeer-reviewed·Dec 20, 2017