BioinformaticsBioinformaticsPeer-reviewed journal article
Feature selection by replicate reproducibility and non-redundancy
Abstract
MotivationA fundamental step in many analyses of high-dimensional data is dimension reduction. Two basic approaches are introduction of new, synthetic coordinates, and selection of extant features. Advantages of the latter include interpretability, simplicity, transferability and modularity. A common criterion for unsupervised feature selection is variance or dynamic range. However, in practice it can occur that high-variance features are noisy, that important features have low variance, or that variances are simply not comparable across features because they are measured in unrelated numeric scales or physical units. Moreover, users may want to include measures of signal-to-noise ratio and non-redundancy into feature selection. ResultsHere, we introduce the RNR algorithm, which selects features based on (i) the reproducibility of their signal across replicates and (ii) their non-redundancy, measured by linear independence. It takes as input a typically large set of features measured on a collection of objects with two or more replicates per object. It returns an ordered list of features i1, i2, ..., ik, where feature i1 is the one with the highest reproducibility across replicates, i2 that with the highest reproducibility across replicates after projecting out the dimension spanned by i1, and so on. Applications to microscopy based imaging of cells and proteomics experiments highlight benefits of the approach. AvailabilityThe RNR method is implemented in the R package FeatSeekR and is available via Bioconductor (Huber et al., 2015) under the GPL-3 open source license. Contacttuemay.capraz@embl.de
- Citations
- 6
- FWCI
- 0.81
- Field percentile
- top 32%
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
- 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
- Experimenting with Two Recent Feature Selection Methods for High-Dimensional Biological Data
Minzhe Zhang, Xiao Fang Yang·bioRxiv·Sep 9, 2025
- RCE-IFE: Recursive Cluster Elimination with Intra-cluster Feature Elimination
Cihan Kuzudisli, Burcu Bakır-Güngör, … Malik Yousef·PeerJ Computer SciencePeer-reviewed·Feb 7, 2025
- projectR: An R/Bioconductor package for transfer learning via PCA, NMF, correlation, and clustering
Gaurav Sharma, Carlo Colantuoni, … Genevieve Stein-O’Brien·BioinformaticsPeer-reviewed·Mar 11, 2020
- Resolution of the curse of dimensionality in single-cell RNA sequencing data analysis
Yusuke Imoto, Tomonori Nakamura, … Mitinori Saitou·Life Science AlliancePeer-reviewed·Aug 9, 2022
- Dropout-based feature selection for scRNASeq
Tallulah S. Andrews, Martin Hemberg·BioinformaticsPeer-reviewed·Dec 19, 2018