YYYaning Yang

Yaning Yang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yaning Yang has a total of 62 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    MK-BMC: a Multi-Kernel framework with Boosted distance metrics for Microbiome data for Classification

    by Huang Xu, Tian Wang, Yuqi Miao, Min Qian, Yaning Yang, Shuang Wang

    Motivation: Research on human microbiome has suggested associations with human health, opening opportunities to predict health outcomes using microbiome. Studies have also suggested that diverse forms of taxa such as rare taxa that are evolutionally related and abundant taxa that are evolutionally unrelated could be associated with or predictive of a health outcome. Although prediction models were developed for microbiome data, no prediction models currently exist that use multiple forms of microbiome–outcome associations.Results: We developed MK-BMC, a Multi-Kernel framework with Boosted distance Metrics for Classification using microbiome data. We propose to first boost widely used distance metrics for microbiome data using taxon-level association signal strengths to up-weight taxa that are potentially associated with an outcome of interest. We then propose a multi-kernel prediction model with one kernel capturing one form of association between taxa and the outcome, where a kernel measures similarities of microbiome compositions between pairs of samples being transformed from a proposed boosted distance metric. We demonstrated superior prediction performance of (i) boosted distance metrics for microbiome data over original ones and (ii) MK-BMC over competing methods through extensive simulations. We applied MK-BMC to predict thyroid, obesity, and inflammatory bowel disease status using gut microbiome data from the American Gut Project and observed much-improved prediction performance over that of competing methods. The learned kernel weights help us understand contributions of individual microbiome signal forms nicely.Availability and implementation: Source code together with a sample input dataset is available at https://github.com/HXu06/MK-BMC


  • Open Access

    Improving prediction of survival and progression in metastatic non-small cell lung cancer following immunotherapy through machine learning of circulating tumor DNA dynamics

    by Haolun Ding, Min Yuan, Yaning Yang, Xu Steven Xu

    Objectives: To use modern machine-learning approaches to enhance and automate the feature extraction from the longitudinal ctDNA data and to improve the prediction of survival and disease progression, risk stratification, and treatment strategies for patients with 1L NSCLC. Methods: Using IMpower150 trial data on untreated metastatic non-small cell lung cancer patients treated with atezolizumab and chemotherapies, we developed a machine-learning algorithm to extract predictive features from ctDNA kinetics, improving survival and progression prediction. We analyzed kinetic data from 17 ctDNA summary markers, including cell-free DNA concentration, allele frequency, tumor molecules in plasma, and mutation counts. Our machine-learning workflow (FPCRF) involved functional principal component analysis (FPCA) for automated feature extraction, random forest and bagging ensemble algorithms for feature selection, standard PCA for dimension reduction, and Cox proportional-hazards regression for survival analysis. The dataset was divided into training and test cohorts in the same way as a previous study. Results: 398 patients with ctDNA data (206 in training, 192 in validation) were analyzed. Our machine-learning models automated feature extraction, excelling in predicting overall survival (OS) and progression-free survival (PFS) at different landmarks. In identical train-test cohorts, our models outperformed existing ones using handcrafted ctDNA features, raising OS c-index to 0.72 and 0.71 from 0.67 and 0.63 for C3D1 and C4D1, and substantially improving PFS to ∼0.65 from the previous 0.54 - 0.58, a 12-20% increase. Our model enhanced risk stratification for NSCLC patients, achieving clear OS and PFS separation (e.g., on C3D1, HR: 2.65 [95%CI: 1.78–3.95, P < 0.001] for high vs. intermediate risk, 2.06 [95%CI: 1.29–3.29, P = 0.002] for intermediate vs. low risk; and PFS HR: 2.04 [95%CI: 1.41–2.94, P < 0.001], 1.56 [95%CI: 1.07–2.27, P = 0.02]). Distinct patterns of ctDNA kinetic characteristics (e.g., baseline ctDNA markers, depth of ctDNA responses, and timing of ctDNA clearance, etc.) were revealed across the risk groups. Rapid and complete ctDNA clearance appears essential for long-term clinical benefit. Conclusions: Our machine-learning approach offers a novel tool for analyzing ctDNA kinetics, extracting critical features from longitudinal data, improving our understanding of the link between ctDNA kinetics and progression/mortality risks, and optimizing personalized immunotherapies for 1L NSCLC. Research in context: Evidence before this study: The longitudinal dynamics of ctDNA are showing promise as a biomarker for treatment outcomes and monitoring. However, despite of recent advances of machine learning, very limited applications have been reported in using machine learning-based approaches to analyze the longitudinal ctDNA data, improve the prediction of clinical outcomes, and refine the risk stratifications. We searched PubMed on Oct 8, 2023 for peer-reviewed, English-language journal and conference articles using the terms (“ctDNA”) AND (“deep learning” OR “machine learning” OR “artificial intelligence”). Fifty-nine (59) search results were found. After systematical review of these search results, we found only 4 research studies where longitudinal ctDNA dynamic/kinetic data were analyzed using machine-learning models to predict patient outcomes. These studies focused on building models using handcrafted features of ctDNA dynamics such as on-treatment ctDNA levels and early ctDNA changes and clearance, etc. So far, no studies have utilized machine- or deep-learning models to extract features from longitudinal ctDNA dynamics to inform and predict cancer patient outcomes. Added value of this study: We developed a machine-learning algorithm to predict survival and disease progression using ctDNA data from the Impower150 trial on untreated metastatic non-small cell lung cancer patients receiving atezolizumab and chemotherapy. Our machine-learning models automatically extract informative features from longitudinal ctDNA dynamics, outperforming existing models based on handcrafted features in predicting overall survival and progression-free survival at various time points. They improved risk stratification and identified crucial ctDNA kinetic characteristics in 1L NSCLC, revealing the importance of rapid and complete ctDNA clearance for long-term clinical benefit. Implications of all the available evidence: Machine-learning models can automatically extract prognostic features from longitudinal ctDNA dynamic trajectories, enable refined risk stratification and prediction of clinical outcomes, and thereby enhance ctDNA data’s utility in clinical patient care and personalized treatment.


  • Open Access

    Wilks' theorems in the $β$-model

    by Ting Yan, Yuanzhang Li, Jinfeng Xu, Yaning Yang, Ji Zhu

    Likelihood ratio tests and the Wilks theorems have been pivotal in statistics but have rarely been explored in network models with an increasing dimension. We are concerned here with likelihood ratio tests in the $\beta$-model for undirected graphs. For two growing dimensional null hypotheses including a specified null $H_0: \beta_i=\beta_i^0$ for $i=1,\ldots, r$ and a homogenous null $H_0: \beta_1=\cdots=\beta_r$, we reveal high dimensional Wilks' phenomena that the normalized log-likelihood ratio statistic, $[2\{\ell(\widehat{\boldsymbol{\beta}}) - \ell(\widehat{\boldsymbol{\beta}}^0)\} - r]/(2r)^{1/2}$, converges in distribution to the standard normal distribution as $r$ goes to infinity. Here, $\ell( \boldsymbol{\beta})$ is the log-likelihood function on the vector parameter $\boldsymbol{\beta}=(\beta_1, \ldots, \beta_n)^\top$, $\widehat{\boldsymbol{\beta}}$ is its maximum likelihood estimator (MLE) under the full parameter space, and $\widehat{\boldsymbol{\beta}}^0$ is the restricted MLE under the null parameter space. For the corresponding fixed dimensional null $H_0: \beta_i=\beta_i^0$ for $i=1,\ldots, r$ and the homogenous null $H_0: \beta_1=\cdots=\beta_r$ with a fixed $r$, we establish Wilks type of results that $2\{\ell(\widehat{\boldsymbol{\beta}}) - \ell(\widehat{\boldsymbol{\beta}}^0)\}$ converges in distribution to a Chi-square distribution with respective $r$ and $r-1$ degrees of freedom, as the total number of parameters, $n$, goes to infinity. The Wilks type of results are further extended into a closely related Bradley--Terry model for paired comparisons, where we discover a different phenomenon that the log-likelihood ratio statistic under the fixed dimensional specified null asymptotically follows neither a Chi-square nor a rescaled Chi-square distribution. Simulation studies and an application to NBA data illustrate the theoretical results.

  • Open Access

    CPGL: Prediction of compound-protein interaction by integrating graph attention network with long short-term memory neural network

    by Minghua Zhao, Min Yuan, Yaning Yang, Steven X Xu

    Recent advancements of artificial intelligence based on deep learning algorithms have made it possible to computationally predict compound-protein interaction (CPI) without conducting laboratory experiments. In this manuscript, we integrated a graph attention network (GAT) for compounds and a long short-term memory neural network (LSTM) for proteins, used end-to-end representation learning for both compounds and proteins, and proposed a deep learning algorithm, CPGL (CPI with GAT and LSTM) to optimize the feature extraction from compounds and proteins and to improve the model robustness and generalizability. CPGL demonstrated an excellent predictive performance and outperforms recently reported deep learning models. Based on 3 public CPI datasets, C.elegans, Human and BindingDB, CPGL represented 1 - 5% improvement compared to existing deep-learning models. Our method also achieves excellent results on datasets with imbalanced positive and negative proportions constructed based on the above two datasets. More importantly, using 2 label reversal datasets, GPCR and Kinase, CPGL showed superior performance compared to other existing deep learning models. The AUC were substantially improved by 15% to 50% on the Kinase dataset, indicative of the robustness and generalizability of CPGL.


  • Fast and efficient correction for population stratification in multi-locus genome-wide association studies

    by Rui Liu, Min Yuan, Xu Steven Xu, Yaning Yang

    Reducing false discoveries caused by population stratification (PS) has always been a challenge in genome-wide association studies (GWAS). The current literature established several single marker approaches including genomic control (GC), EIGENSTRAT and generalized linear mixed model association test (GMMAT) and multi-marker methods such as LASSO mixed model (LASSOMM). However, the single-marker methods require prespecifying an arbitrary p value threshold in the selection process, likely resulting in suboptimal precision or recall. On the other hand, it appears that LASSOMM is extremely computationally intensive and may not suitable for large-scale GWAS. In this paper, we proposed a simple multi-marker approach (PCA-LASSO) combining principal component analysis (PCA) and least absolute shrinkage and selection operator (LASSO). We utilize PCA to correct for the confounding effects of PS and LASSO with built-in cross-validation for a data-driven selection. Compared to the current single-marker approaches, the proposed PCA-LASSO provides optimal balance between precision and recall, and consequently superior F1 scores. Similarly, compared to LASSOMM, PCA-LASSO markedly increases the precision while minimizing the loss of recall, and therefore improves the overall F1 score in presence of PS. More importantly, PCA-LASSO drastically reduces the computational time by > 1000 times when compared to LASSOMM. We applied PCA-LASSO to a real dataset of Alzheimer’s disease and successfully identified SNP rs429358 (Gene APOE4) which has been widely reported to be associated with the onset and elevated risk of Alzheimer’s disease. In conclusion, PCA-LASSO is a simple, fast, but accurate approach for GWAS in presence of latent PS.


  • Open Access

    Wilks' theorems in some exponential random graph models

    by Ting Yan, Yuanzhang Li, Jinfeng Xu, Yaning Yang, Ji Zhu

    We are concerned here with the likelihood ratio statistics in two exponential random graph models -- the $\beta$-model and the Bradley-Terry model, in which the degree sequence on an undirected graph and the out-degree sequence on a weighted directed graph are the exclusively sufficient statistics in the exponential-family distributions on graphs, respectively. We prove the Wilks type of theorems for some fixed and growing dimensional hypothesis testing problems. More specifically, under two fixed dimensional null hypotheses $H_0: \beta_i=\beta_i^0$ for $i=1,\ldots, r$ and $H_0: \beta_1=\ldots=\beta_r$, we show that $2[\ell(\widehat{\boldsymbol{\beta}}) - \ell(\widehat{\boldsymbol{\beta}}^0)]$ converges in distribution to a Chi-square distribution with the respective degrees of freedoms, $r$ and $r-1$, as the dimension $n$ of the full parameter space goes to infinity. Here, $\ell(\boldsymbol{\beta})$ is the log-likelihood function on the parameter $\boldsymbol{\beta}$, $\widehat{\boldsymbol{\beta}}$ is the MLE under the full parameter space, and $\widehat{\boldsymbol{\beta}}^0$ is the restricted MLE under the null parameter space. For two increasing dimensional null hypotheses $H_0: \beta_i = \beta_i^0$ for $i=1, \ldots, n$ and $H_0: \beta_1=\ldots=\beta_r$ with $r/n \ge c$, we show that the normalized log-likelihood ratio statistics, $(2[\ell(\widehat{\boldsymbol{\beta}}) - \ell(\boldsymbol{\beta}^0)] -n)/(2n)^{1/2}$ and $(2[\ell(\widehat{\boldsymbol{\beta}}) - \ell(\widehat{\boldsymbol{\beta}}^0)] -r)/(2r)^{1/2}$, both converge in distribution to the standard normal distribution. Simulation studies and an application to NBA data illustrate the theoretical results.

  • A greedy approach for mutual exclusivity analysis in cancer study

    by Hongyan Fang, Zeyu Zhang, Yinsheng Zhou, Lishuai Jin, Yaning Yang

    Summary: The main challenge in cancer genomics is to distinguish the driver genes from passenger or neutral genes. Cancer genomes exhibit extensive mutational heterogeneity that no two genomes contain exactly the same somatic mutations. Such mutual exclusivity (ME) of mutations has been observed in cancer data and is associated with functional pathways. Analysis of ME patterns may provide useful clues to driver genes or pathways and may suggest novel understandings of cancer progression. In this article, we consider a probabilistic, generative model of ME, and propose a powerful and greedy algorithm to select the mutual exclusivity gene sets. The greedy method includes a pre-selection procedure and a stepwise forward algorithm which can significantly reduce computation time. Power calculations suggest that the new method is efficient and powerful for one ME set or multiple ME sets with overlapping genes. We illustrate this approach by analysis of the whole-exome sequencing data of cancer types from TCGA.


  • Efficient algorithms for covariate analysis with dynamic data using nonlinear mixed-effects model

    by Min Yuan, Zhi Zhu, Yaning Yang, Minghua Zhao, Kate Sasser, Hisham Hamadeh, Jose Pinheiro, Xu Steven Xu

    Nonlinear mixed-effects modeling is one of the most popular tools for analyzing repeated measurement data, particularly for applications in the biomedical fields. Multiple integration and nonlinear optimization are the two major challenges for likelihood-based methods in nonlinear mixed-effects modeling. To solve these problems, approaches based on empirical Bayesian estimates have been proposed by breaking the problem into a nonlinear mixed-effects model with no covariates and a linear regression model without random effect. This approach is time-efficient as it involves no covariates in the nonlinear optimization. However, covariate effects based on empirical Bayesian estimates are underestimated and the bias depends on the extent of shrinkage. Marginal correction method has been proposed to correct the bias caused by shrinkage to some extent. However, the marginal approach appears to be suboptimal when testing covariate effects on multiple model parameters, a situation that is often encountered in real-world data analysis. In addition, the marginal approach cannot correct the inaccuracy in the associated p-values. In this paper, we proposed a simultaneous correction method (nSCEBE), which can handle the situation where covariate analysis is performed on multiple model parameters. Simulation studies and real data analysis showed that nSCEBE is accurate and efficient for both effect-size estimation and p-value calculation compared with the existing methods. Importantly, nSCEBE can be >2000 times faster than the standard mixed-effects models, potentially allowing utilization for high-dimension covariate analysis for longitudinal or repeated measured outcomes.


  • CSHAP: efficient haplotype frequency estimation based on sparse representation

    by Yinsheng Zhou, Han Zhang, Yaning Yang

    Estimating haplotype frequencies from genotype data plays an important role in genetic analysis. In silico methods are usually computationally involved since phase information is not available. Due to tight linkage disequilibrium (LD) and low recombination rates, the number of haplotypes observed in human populations is far less than all the possibilities. This motivates us to solve the estimation problem by maximizing the sparsity of existing haplotypes. Here we propose a new algorithm by applying the compressive sensing (CS) theory in the field of signal processing, CSHAP, to solve the sparse representation of haplotype frequencies based on allele frequencies and between-allele covariances. Our proposed approach can handle both individual genotype data and pooled DNA data with hundreds of loci. The CSHAP exhibits the same accuracy compared to the state-of-the-art methods, but runs several orders of magnitude faster. CSHAP can also handle with missing genotype data imputations efficiently. The CSHAP is implemented in R, the source code and the testing datasets are available at http://home.ustc.edu.cn/~zhouys/CSHAP/. Supplementary data are available at Bioinformatics online.


  • Reliability assessment of system under a generalized run shock model

    by Min Gong, Min Xie, Yaning Yang

    In this paper we are concerned with modelling the reliability of a system subject to external shocks. In a run shock model, the system fails when a sequence of shocks above a threshold arrive in succession. Nevertheless, using a single threshold to measure the severity of a shock is too critical in real practice. To this end, we develop a generalized run shock model with two thresholds. We employ a phase-type distribution to model the damage size and the inter-arrival time of shocks, which is highly versatile and may be used to model many quantitative features of random phenomenon. Furthermore, we use the Markovian property to construct a multi-state system which degrades with the arrival of shocks. We also provide a numerical example to illustrate our results.