Comments on: Augmenting the bootstrap to analyze high dimensional genomic data

Test ◽  
2008 ◽  
Vol 17 (1) ◽  
pp. 25-27 ◽  
Author(s):  
Korbinian Strimmer
2016 ◽  
Vol 27 (2) ◽  
pp. 336-351 ◽  
Author(s):  
Akram Shalabi ◽  
Masato Inoue ◽  
Johnathan Watkins ◽  
Emanuele De Rinaldis ◽  
Anthony CC Coolen

When data exhibit imbalance between a large number d of covariates and a small number n of samples, clinical outcome prediction is impaired by overfitting and prohibitive computation demands. Here we study two simple Bayesian prediction protocols that can be applied to data of any dimension and any number of outcome classes. Calculating Bayesian integrals and optimal hyperparameters analytically leaves only a small number of numerical integrations, and CPU demands scale as O(nd). We compare their performance on synthetic and genomic data to the mclustDA method of Fraley and Raftery. For small d they perform as well as mclustDA or better. For d = 10,000 or more mclustDA breaks down computationally, while the Bayesian methods remain efficient. This allows us to explore phenomena typical of classification in high-dimensional spaces, such as overfitting and the reduced discriminative effectiveness of signatures compared to intra-class variability.


2017 ◽  
Vol 90 ◽  
pp. 146-154 ◽  
Author(s):  
Ioannis Kavakiotis ◽  
Patroklos Samaras ◽  
Alexandros Triantafyllidis ◽  
Ioannis Vlahavas

2016 ◽  
Vol 7 (1) ◽  
Author(s):  
Chongzhi Zang ◽  
Tao Wang ◽  
Ke Deng ◽  
Bo Li ◽  
Sheng’en Hu ◽  
...  

Author(s):  
Qianfan Wu ◽  
Adel Boueiz ◽  
Alican Bozkurt ◽  
Arya Masoomi ◽  
Allan Wang ◽  
...  

Predicting disease status for a complex human disease using genomic data is an important, yet challenging, step in personalized medicine. Among many challenges, the so-called curse of dimensionality problem results in unsatisfied performances of many state-of-art machine learning algorithms. A major recent advance in machine learning is the rapid development of deep learning algorithms that can efficiently extract meaningful features from high-dimensional and complex datasets through a stacked and hierarchical learning process. Deep learning has shown breakthrough performance in several areas including image recognition, natural language processing, and speech recognition. However, the performance of deep learning in predicting disease status using genomic datasets is still not well studied. In this article, we performed a review on the four relevant articles that we found through our thorough literature review. All four articles used auto-encoders to project high-dimensional genomic data to a low dimensional space and then applied the state-of-the-art machine learning algorithms to predict disease status based on the low-dimensional representations. This deep learning approach outperformed existing prediction approaches, such as prediction based on probe-wise screening and prediction based on principal component analysis. The limitations of the current deep learning approach and possible improvements were also discussed.


2018 ◽  
Vol 35 (7) ◽  
pp. 1181-1187 ◽  
Author(s):  
Haohan Wang ◽  
Benjamin J Lengerich ◽  
Bryon Aragam ◽  
Eric P Xing

2019 ◽  
Vol 77 ◽  
pp. 520-532 ◽  
Author(s):  
Santos Kumar Baliarsingh ◽  
Swati Vipsita ◽  
Khan Muhammad ◽  
Bodhisattva Dash ◽  
Sambit Bakshi

2021 ◽  
Author(s):  
Reetika Sarkar ◽  
Sithija Manage ◽  
Xiaoli Gao

Abstract Background: High-dimensional genomic data studies are often found to exhibit strong correlations, which results in instability and inconsistency in the estimates obtained using commonly used regularization approaches including both the Lasso and MCP, and related methods. Result: In this paper, we perform a comparative study of regularization approaches for variable selection under different correlation structures, and propose a two-stage procedure named rPGBS to address the issue of stable variable selection in various strong correlation settings. This approach involves repeatedly running of a two-stage hierarchical approach consisting of a random pseudo-group clustering and bi-level variable selection. Conclusion: Both the simulation studies and high-dimensional genomic data analysis have demonstrated the advantage of the proposed rPGBS method over most commonly used regularization methods. In particular, the rPGBS results in more stable selection of variables across a variety of correlation settings, as compared to recent work addressing variable selection with strong correlations. Moreover, the rPGBS is computationally efficient across various settings.


Sign in / Sign up

Export Citation Format

Share Document