High-dimensional Omics Data Analysis Research Articles

AutoDC: an automatic machine learning framework for disease classification.

The emergence of next-generation sequencing techniques opens up tremendous opportunities for researchers to uncover the basic mechanisms of disease at the molecular level. Recently, automatic machine learning (AutoML) frameworks have been employed for genomic and epigenomic data analysis. However, to analyze those high-dimensional data, existing AutoML frameworks suffer from the following issues: (i) they could not effectively filter out the redundant features from the original data, and (ii) they usually obey the rule of feature engineering first and algorithm hyper-parameter tuning later to build the machine learning pipeline, which could lead to sub-optimal outcomes. Thus, it is an urgent need to design a new AutoML framework for high-dimensional omics data analysis. We introduce a new method: AutoDC, a tailored AutoML framework, for different disease classification based on gene expression data. AutoDC designs two novel optimization strategies to improve the performance. One is that AutoDC designs a novel two-stage feature selection method to select the features with high gene contribution scores. The other is that AutoDC proposes a novel optimization method, based on a two-layer Multi-Armed Bandit framework, to jointly optimize the feature engineering, algorithm selection and algorithm hyper-parameter tuning. We apply our framework to two public gene expression datasets. Compared with three state-of-the-art AutoML frameworks, AutoDC could effectively classify diseases with higher predictive accuracy. The data and codes of AutoDC are available at https://github.com/dingdian110/AutoDC. The data underlying this article are available in the article and in its online supplementary material. Supplementary data are available at Bioinformatics online.

ISFun: an R package for integrative dimension reduction analysis.

In the analysis of high-dimensional omics data, dimension reduction techniques-including principal component analysis (PCA), partial least squares (PLS) and canonical correlation analysis (CCA)-have been extensively used. When there are multiple datasets generated by independent studies with compatible designs, integrative analysis has been developed and shown to outperform meta-analysis, other multidatasets analysis, and individual-data analysis. To facilitate integrative dimension reduction analysis in daily practice, we develop the R package iSFun, which can comprehensively conduct integrative sparse PCA, PLS and CCA, as well as meta-analysis and stacked analysis. The package can conduct analysis under the homogeneity and heterogeneity models and with the magnitude- and sign-based contrasted penalties. As a 'byproduct', this article is the first to develop integrative analysis built on the CCA technique, further expanding the scope of integrative analysis. The package is available at https://CRAN.R-project.org/package=iSFun. Supplementary materials are available at Bioinformatics online.

Sparse redundancy analysis of high-dimensional genetic and genomic data.

Recent technological developments have enabled the possibility of genetic and genomic integrated data analysis approaches, where multiple omics datasets from various biological levels are combined and used to describe (disease) phenotypic variations. The main goal is to explain and ultimately predict phenotypic variations by understanding their genetic basis and the interaction of the associated genetic factors. Therefore, understanding the underlying genetic mechanisms of phenotypic variations is an ever increasing research interest in biomedical sciences. In many situations, we have a set of variables that can be considered to be the outcome variables and a set that can be considered to be explanatory variables. Redundancy analysis (RDA) is an analytic method to deal with this type of directionality. Unfortunately, current implementations of RDA cannot deal optimally with the high dimensionality of omics data (p≫n). The existing theoretical framework, based on Ridge penalization, is suboptimal, since it includes all variables in the analysis. As a solution, we propose to use Elastic Net penalization in an iterative RDA framework to obtain a sparse solution. We proposed sparse redundancy analysis (sRDA) for high dimensional omics data analysis. We conducted simulation studies with our software implementation of sRDA to assess the reliability of sRDA. Both the analysis of simulated data, and the analysis of 485 512 methylation markers and 18,424 gene-expression values measured in a set of 55 patients with Marfan syndrome show that sRDA is able to deal with the usual high dimensionality of omics data. http://uva.csala.me/rda. a.csala@amc.uva.nl. Supplementary data are available at Bioinformatics online.

Introduction to Bayesian variable selection methods in high-dimensional omics data analysis

With the rapid development of genome sequencing technology and bioinformatics in recent years, it has become possible to measure thousands of omics data which might be associated with the progress of diseases, i.e."high-dimensional data" . This type of omics data have a common feature that the number of variable p is usually greater than the observation cases n, and often has high correlation between independent variables. Therefore, it is a great statistical challenge to identify really meaningful variables from omics data. This paper summarizes the methods of Bayesian variable selection in the analysis of high-dimensional data.

High-dimensional omics data analysis using a variable screening protocol with prior knowledge integration (SKI).

BackgroundHigh-throughput technology could generate thousands to millions biomarker measurements in one experiment. However, results from high throughput analysis are often barely reproducible due to small sample size. Different statistical methods have been proposed to tackle this “small n and large p” scenario, for example different datasets could be pooled or integrated together to provide an effective way to improve reproducibility. However, the raw data is either unavailable or hard to integrate due to different experimental conditions, thus there is an emerging need to develop a method for “knowledge integration” in high-throughput data analysis.ResultsIn this study, we proposed an integrative prescreening approach, SKI, for high-throughput data analysis. A new rank is generated based on two initial ranks: (1) knowledge based rank; and (2) marginal correlation based rank. Our simulation shows the SKI outperforms other methods without knowledge-integration in terms of higher true positive rate given the same number of variables selected. We also applied our method in a drug response study and found its performance to be better than regular screening methods.ConclusionThe proposed method provides an effective way to integrate knowledge for high-throughput analysis. It could easily implemented with our provided R package named SKI.

The Perseus computational platform for comprehensive analysis of (prote)omics data.

A main bottleneck in proteomics is the downstream biological analysis of highly multivariate quantitative protein abundance data generated using mass-spectrometry-based analysis. We developed the Perseus software platform (http://www.perseus-framework.org) to support biological and biomedical researchers in interpreting protein quantification, interaction and post-translational modification data. Perseus contains a comprehensive portfolio of statistical tools for high-dimensional omics data analysis covering normalization, pattern recognition, time-series analysis, cross-omics comparisons and multiple-hypothesis testing. A machine learning module supports the classification and validation of patient groups for diagnosis and prognosis, and it also detects predictive protein signatures. Central to Perseus is a user-friendly, interactive workflow environment that provides complete documentation of computational methods used in a publication. All activities in Perseus are realized as plugins, and users can extend the software by programming their own, which can be shared through a plugin store. We anticipate that Perseus's arsenal of algorithms and its intuitive usability will empower interdisciplinary analysis of complex large data sets.