LAVASET: Latent Variable Stochastic Ensemble of Trees. A novel ensemble method for correlated datasets.
Melpomeni KasapiiD, Kexin XuiD, Timothy M. D. EbbelsiD, Declan P. O’ReganiD, James S. WareiD, Joram Matthias PosmaiD
Abstract
MotivationRandom Forests (RFs) can deal with a large number of variables, achieve reasonable prediction scores, and yield highly interpretable feature importance values. As such, RFs are appropriate models for feature selection and further dimension reduction (DR). However, RFs are often not appropriate for correlated datasets due to their mode of selecting individual features for splitting. Addressing correlation relationships in high dimensional datasets is imperative for reducing the number of variables that are assigned high importance, hence making the DR most efficient. Here, we propose the LAtent VAriable Stochastic Ensemble of Trees (LAVASET) method that derives latent variables based on the distance characteristics of each feature and aims to incorporate the correlation factor in the splitting step. ResultsWithout compromising on performance in the majority of examples, LAVASET outperforms RF by accurately determining feature importance across all correlated variables and ensuring proper distribution of importance values. LAVASET yields mostly non-inferior prediction accuracies to traditional RFs when tested in simulated and real 1D datasets, as well as more complex and high-dimensional 3D datatypes. Unlike traditional RFs, LAVASET is unaffected by single important noisy features (false positives), as it considers the local neighbourhood. LAVASET, therefore, highlights neighbourhoods of features, reflecting real signals that collectively impact the models predictive ability. LAVASET is freely available as a standalone package from https://github.com/melkasapi/LAVASET.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 2
- FWCI
- 0.69
- Field percentile
- top 34%
- 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
- Hi-LASSO: High-performance Python and Apache spark packages for feature selection with high-dimensional data
Jongkwon Jo, Seungha Jung, … Mingon Kang·PLoS ONEPeer-reviewed·Dec 1, 2022
- Supervised Rank aggregation (SRA): A novel rank aggregation approach for ensemble-based feature selection
Rahi Jain, Wei Ran Xu·Recent Advances in Computer Science and CommunicationsPeer-reviewed·Jan 4, 2024
- Thresholding Gini Variable Importance with a single trained Random Forest: An Empirical Bayes Approach
Robert A. Dunne, Roc Reguant, … Denis C. Bauer·Computational and Structural Biotechnology JournalPeer-reviewed·Jan 1, 2023
- Hybrid Rank Aggregation (HRA): A novel rank aggregation method for ensemble-based feature selection
- Stochastic LASSO for extremely high-dimensional genomic data
Beomsu Baek, Jongkwon Jo, … Youngsoon Kim·Scientific ReportsPeer-reviewed·Jan 14, 2026
- 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