Zi-Yi Yang
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
Research Subjects
Zi-Yi Yang has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
- Yong Liang
Pengcheng Laboratory, Shenzhen, China
8 shared publications - Hui Zhang
Faculty of Information Technology, Collaborative Laboratory for Intelligent Science and Systems, Macau University of Science and Technology, Macau, China
7 shared publications - Yanqiong Ren
School of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang, China
3 shared publications Hai Zhang
Faculty of Information Technology & State Key Laboratory of Quality Research in Chinese Medicines, Macau University of Science and Technology, Taipa, 999078, Macau
2 shared publications- Li Ni
Fuzhou University
2 shared publications - Lianzhong Ai
Shanghai Engineering Research Center of Food Microbiology, School of Health Science and Engineering, University of Shanghai for Science and Technology, Shanghai 200093, China
2 shared publications
Latest Publications
- 12 September 2023
- Published by Elsevier in Food Bioscience
- Vol. 56, 103142
The regulatory effects of microbial community on the formation of higher alcohols and volatile flavor components in Hongqu rice wine brewing
- 12 September 2023
- Published by Elsevier in Food Bioscience
- Vol. 56, 103142
The regulatory effects of microbial community on the formation of higher alcohols and volatile flavor components in Hongqu rice wine brewing
- Open Access
- 4 October 2022
- Published by Elsevier in Current Research in Food Science
- Vol. 5, 1720-1731
The dynamics of microbial community and flavor metabolites during the acetic acid fermentation of Hongqu aromatic vinegar
- 4 October 2022
- Published by Elsevier in Current Research in Food Science
- Vol. 5, 1720-1731
Open AccessThe dynamics of microbial community and flavor metabolites during the acetic acid fermentation of Hongqu aromatic vinegar
- Open Access
- 16 September 2021
- Published by Oxford University Press (OUP) in British Journal of Surgery
- Vol. 108 (11) , e377-e379
Improved robot-assisted laparoscopic telesurgery: feasibility of network converged communication
Dear Editor,
- 16 September 2021
- Published by Oxford University Press (OUP) in British Journal of Surgery
- Vol. 108 (11) , e377-e379
Open AccessImproved robot-assisted laparoscopic telesurgery: feasibility of network converged communication
Dear Editor,
- 22 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 52 (4) , 2082-2095
SMSPL: Robust Multimodal Approach to Integrative Analysis of Multiomics Data
With the recent advancement of technologies, it is progressively easier to collect diverse types of genome-wide data. It is commonly expected that by analyzing these data in an integrated way, one can improve the understanding of a complex biological system. Current methods, however, are prone to overfitting heavy noise such that their applications are limited. High noise is one of the major challenges for multiomics data integration. This may be the main cause of overfitting and poor performance in generalization. A sample reweighting strategy is typically used to cope with this problem. In this article, we propose a robust multimodal data integration method, called SMSPL, which can simultaneously predict subtypes of cancers and identify potentially significant multiomics signatures. Especially, the proposed method leverages the linkages between different types of data to interactively recommend high-confidence samples, adopts a new soft weighting scheme to assign weights to the training samples of each type, and then iterates between weights recalculating and classifiers updating. Simulation and five real experiments substantiate the capability of the proposed method for classification and identification of significant multiomics signatures with heavy noise. We expect SMSPL to take a small step in the multiomics data integration and help researchers comprehensively understand the biological process.
- 22 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 52 (4) , 2082-2095
SMSPL: Robust Multimodal Approach to Integrative Analysis of Multiomics Data
With the recent advancement of technologies, it is progressively easier to collect diverse types of genome-wide data. It is commonly expected that by analyzing these data in an integrated way, one can improve the understanding of a complex biological system. Current methods, however, are prone to overfitting heavy noise such that their applications are limited. High noise is one of the major challenges for multiomics data integration. This may be the main cause of overfitting and poor performance in generalization. A sample reweighting strategy is typically used to cope with this problem. In this article, we propose a robust multimodal data integration method, called SMSPL, which can simultaneously predict subtypes of cancers and identify potentially significant multiomics signatures. Especially, the proposed method leverages the linkages between different types of data to interactively recommend high-confidence samples, adopts a new soft weighting scheme to assign weights to the training samples of each type, and then iterates between weights recalculating and classifiers updating. Simulation and five real experiments substantiate the capability of the proposed method for classification and identification of significant multiomics signatures with heavy noise. We expect SMSPL to take a small step in the multiomics data integration and help researchers comprehensively understand the biological process.
- Open Access
- 13 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 128509-128518
A Genotype-Based Ensemble Classifier System for Non-Small-Cell Lung Cancer
The heterogeneity of cancer reflects the complexity of genetic mutations. Dissecting the heterogeneity plays an important role in the field of biomarker discovery, targeted therapy and drug designing. As it is time-consuming to identify new biomarkers in biological experiments, various machine learning methods have been developed. However, the current methods are limited because they ignore that patients may correspond to different disease-causing genotypes. In this article, a genotype-based ensemble classifier system (GECS) is proposed which aims to explain pathologies of NSCLC from the view of genotypes and identify the genetic subtypes of tumors. The core strategy of GECS is to construct multiple independent classifiers following the principle that one classifier is constructed based on one genotype of NSCLC. The analysis of synthetic data and three microarray datasets indicated that the proposed method outperforms existing approaches in the identification of genetic subtypes of tumors. The GECS method provides a useful tool for molecular pathology researches for dissecting the heterogeneity of cancer.
- 13 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 128509-128518
Open AccessA Genotype-Based Ensemble Classifier System for Non-Small-Cell Lung Cancer
The heterogeneity of cancer reflects the complexity of genetic mutations. Dissecting the heterogeneity plays an important role in the field of biomarker discovery, targeted therapy and drug designing. As it is time-consuming to identify new biomarkers in biological experiments, various machine learning methods have been developed. However, the current methods are limited because they ignore that patients may correspond to different disease-causing genotypes. In this article, a genotype-based ensemble classifier system (GECS) is proposed which aims to explain pathologies of NSCLC from the view of genotypes and identify the genetic subtypes of tumors. The core strategy of GECS is to construct multiple independent classifiers following the principle that one classifier is constructed based on one genotype of NSCLC. The analysis of synthetic data and three microarray datasets indicated that the proposed method outperforms existing approaches in the identification of genetic subtypes of tumors. The GECS method provides a useful tool for molecular pathology researches for dissecting the heterogeneity of cancer.
- Open Access
- 1 April 2020
- Published by Springer Nature in Scientific Reports
- Vol. 10 (1) , 1-16
Meta-Analysis Based on Nonconvex Regularization
The widespread applications of high-throughput sequencing technology have produced a large number of publicly available gene expression datasets. However, due to the gene expression datasets have the characteristics of small sample size, high dimensionality and high noise, the application of biostatistics and machine learning methods to analyze gene expression data is a challenging task, such as the low reproducibility of important biomarkers in different studies. Meta-analysis is an effective approach to deal with these problems, but the current methods have some limitations. In this paper, we propose the meta-analysis based on three nonconvex regularization methods, which areL1/2regularization (meta-Half), Minimax Concave Penalty regularization (meta-MCP) and Smoothly Clipped Absolute Deviation regularization (meta-SCAD). The three nonconvex regularization methods are effective approaches for variable selection developed in recent years. Through the hierarchical decomposition of coefficients, our methods not only maintain the flexibility of variable selection and improve the efficiency of selecting important biomarkers, but also summarize and synthesize scientific evidence from multiple studies to consider the relationship between different datasets. We give the efficient algorithms and the theoretical property for our methods. Furthermore, we apply our methods to the simulation data and three publicly available lung cancer gene expression datasets, and compare the performance with state-of-the-art methods. Our methods have good performance in simulation studies, and the analysis results on the three publicly available lung cancer gene expression datasets are clinically meaningful. Our methods can also be extended to other areas where datasets are heterogeneous.
- 1 April 2020
- Published by Springer Nature in Scientific Reports
- Vol. 10 (1) , 1-16
Open AccessMeta-Analysis Based on Nonconvex Regularization
The widespread applications of high-throughput sequencing technology have produced a large number of publicly available gene expression datasets. However, due to the gene expression datasets have the characteristics of small sample size, high dimensionality and high noise, the application of biostatistics and machine learning methods to analyze gene expression data is a challenging task, such as the low reproducibility of important biomarkers in different studies. Meta-analysis is an effective approach to deal with these problems, but the current methods have some limitations. In this paper, we propose the meta-analysis based on three nonconvex regularization methods, which areL1/2regularization (meta-Half), Minimax Concave Penalty regularization (meta-MCP) and Smoothly Clipped Absolute Deviation regularization (meta-SCAD). The three nonconvex regularization methods are effective approaches for variable selection developed in recent years. Through the hierarchical decomposition of coefficients, our methods not only maintain the flexibility of variable selection and improve the efficiency of selecting important biomarkers, but also summarize and synthesize scientific evidence from multiple studies to consider the relationship between different datasets. We give the efficient algorithms and the theoretical property for our methods. Furthermore, we apply our methods to the simulation data and three publicly available lung cancer gene expression datasets, and compare the performance with state-of-the-art methods. Our methods have good performance in simulation studies, and the analysis results on the three publicly available lung cancer gene expression datasets are clinically meaningful. Our methods can also be extended to other areas where datasets are heterogeneous.
- 4 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 17 (4) , 1329-1340
Novel Regularization Method for Biomarker Selection and Cancer Classification
Variable selection has attracted more attention in big data and machine learning fields. In high dimensional data analysis, many relevant variables or variable groups are widely found. For example, people pay more interests to biological pathway or regulatory network in microarray gene expression data. In recent years, regularization methods are commonly used approaches for variable selection. Existing regularization methods generally use $L_2$ penalty to evaluate the grouping effect and $L_q \;(0 < q < 1$ penalty with a fixed value of q to evaluate the variable sparsity, respectively. These methods typically produce a good performance with high efficiency, but they often require the data to satisfy a certain probability distribution. In this paper, we propose a novel complex harmonic regularization (CHR) penalty function, which can approximate the combination of $L_q \left(\frac{1}{2} \leq q \leq 1\right)$ and $L_p (1 < p < 2)$ regularizations with adjustable p and q to select the groups of the relevant variables. The CHR penalty function can be effectively solved by a direct path seeking algorithm. We demonstrate that the proposed CHR penalty function performs better than the state-of-the-art regularization methods in selecting groups of relevant variables and classification.- 4 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 17 (4) , 1329-1340
Novel Regularization Method for Biomarker Selection and Cancer Classification
Variable selection has attracted more attention in big data and machine learning fields. In high dimensional data analysis, many relevant variables or variable groups are widely found. For example, people pay more interests to biological pathway or regulatory network in microarray gene expression data. In recent years, regularization methods are commonly used approaches for variable selection. Existing regularization methods generally use $L_2$ penalty to evaluate the grouping effect and $L_q \;(0 < q < 1$ penalty with a fixed value of q to evaluate the variable sparsity, respectively. These methods typically produce a good performance with high efficiency, but they often require the data to satisfy a certain probability distribution. In this paper, we propose a novel complex harmonic regularization (CHR) penalty function, which can approximate the combination of $L_q \left(\frac{1}{2} \leq q \leq 1\right)$ and $L_p (1 < p < 2)$ regularizations with adjustable p and q to select the groups of the relevant variables. The CHR penalty function can be effectively solved by a direct path seeking algorithm. We demonstrate that the proposed CHR penalty function performs better than the state-of-the-art regularization methods in selecting groups of relevant variables and classification.- Open Access
- 7 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 9080-9090
Approximate Message Passing Algorithm for Nonconvex Regularization
In this paper, we study the sparse signal reconstruction with nonconvex regularization, mainly focus on two popular nonconvex regularization methods, minimax concave penalty (MCP) and smoothly clipped absolute deviation (SCAD). Approximate message passing (AMP) algorithm is an effective method for signal reconstruction. Based on AMP algorithm, we propose an improved MCP iterative thresholding algorithm and an improved SCAD iterative thresholding algorithm. Further, we analyze the convergence of the new algorithms, and provide a series of experiments to assess the performance of the new algorithms. The experiments show that the new algorithms based on AMP have stronger reconstruction capabilities, higher phase transition for sparse signal reconstruction and better variable selection ability than original MCP iterative thresholding algorithm and original SCAD iterative thresholding algorithm.
- 7 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 9080-9090
Open AccessApproximate Message Passing Algorithm for Nonconvex Regularization
In this paper, we study the sparse signal reconstruction with nonconvex regularization, mainly focus on two popular nonconvex regularization methods, minimax concave penalty (MCP) and smoothly clipped absolute deviation (SCAD). Approximate message passing (AMP) algorithm is an effective method for signal reconstruction. Based on AMP algorithm, we propose an improved MCP iterative thresholding algorithm and an improved SCAD iterative thresholding algorithm. Further, we analyze the convergence of the new algorithms, and provide a series of experiments to assess the performance of the new algorithms. The experiments show that the new algorithms based on AMP have stronger reconstruction capabilities, higher phase transition for sparse signal reconstruction and better variable selection ability than original MCP iterative thresholding algorithm and original SCAD iterative thresholding algorithm.
- Open Access
- 1 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 170513-170524
MSPL: Multimodal Self-Paced Learning for Multi-Omics Feature Selection and Data Integration
Rapid advances in high-throughput sequencing technology have led to the generation of a large number of multi-omics biological datasets. Integrating data from different omics provides an unprecedented opportunity to gain insight into disease mechanisms from different perspectives. However, integrative analysis and predictive modeling from multi-omics data are facing three major challenges: i) heavy noises; ii) the high dimensions compared to the small samples; iii) data heterogeneity. Current multi-omics data integration approaches have some limitations and are susceptible to heavy noise. In this paper, we present MSPL, a robust supervised multi-omics data integration method that simultaneously identifies significant multi-omics signatures during the integration process and predicts the cancer subtypes. The proposed method not only inherits the generalization performance of self-paced learning but also leverages the properties of multi-omics data containing correlated information to interactively recommend high-confidence samples for model training. We demonstrate the capabilities of MSPL using simulated data and five multi-omics biological datasets, integrating up three omics to identify potential biological signatures, and evaluating the performance compared to state-of-the-art methods in binary and multi-class classification problems. Our proposed model makes multi-omics data integration more systematic and expands its range of applications.
- 1 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 170513-170524
Open AccessMSPL: Multimodal Self-Paced Learning for Multi-Omics Feature Selection and Data Integration
Rapid advances in high-throughput sequencing technology have led to the generation of a large number of multi-omics biological datasets. Integrating data from different omics provides an unprecedented opportunity to gain insight into disease mechanisms from different perspectives. However, integrative analysis and predictive modeling from multi-omics data are facing three major challenges: i) heavy noises; ii) the high dimensions compared to the small samples; iii) data heterogeneity. Current multi-omics data integration approaches have some limitations and are susceptible to heavy noise. In this paper, we present MSPL, a robust supervised multi-omics data integration method that simultaneously identifies significant multi-omics signatures during the integration process and predicts the cancer subtypes. The proposed method not only inherits the generalization performance of self-paced learning but also leverages the properties of multi-omics data containing correlated information to interactively recommend high-confidence samples for model training. We demonstrate the capabilities of MSPL using simulated data and five multi-omics biological datasets, integrating up three omics to identify potential biological signatures, and evaluating the performance compared to state-of-the-art methods in binary and multi-class classification problems. Our proposed model makes multi-omics data integration more systematic and expands its range of applications.
- Open Access
- 9 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 68586-68595
Robust Sparse Logistic Regression With the $L_{q}$ ($0 < \text{q} < 1$ ) Regularization for Feature Selection Using Gene Expression DataMicroarray technology is a popular technique that has been extensively applied in cancer diagnosis. Many studies have used high-dimensional microarray data to identify informative features to classify the types of cancer, yet numerous irrelevant features that exist in microarray data may introduce the noise and decrease classification accuracy. Regularization techniques are common methods for feature selection, which can be used to reduce irrelevant features and avoid overfitting. In recent years, different regularization methods have been proposed. Theoretically, the Lq (0<q<1) type penalty function with the lower value of .. would acquire better sparse solutions. In addition, the loss function in most regression models is based on least-squares minimization. However, the least-square method is sensitive to noise and has poor robustness, especially when the error has a heavy-tailed distribution. It is well known that the least absolute deviation regression is the most common method for the robust regression, which can overcome the big noise problem. In general, there is a high level of noise in microarray data, which deter the development of microarray technology. To solve the above problems, we propose a robust logistic regression based on the Lq (0<q<1) regularization approach, which is a feasible and effective approach for feature selection in microarray classification. The Lq (0<q<1) regularization leads to a non-convex optimization problem that is difficult to be solved. In this paper, we utilize a genetic algorithm based on the global search strategy to obtain an optimal solution.
- 9 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 68586-68595
Open AccessRobust Sparse Logistic Regression With the $L_{q}$ ($0 < \text{q} < 1$ ) Regularization for Feature Selection Using Gene Expression DataMicroarray technology is a popular technique that has been extensively applied in cancer diagnosis. Many studies have used high-dimensional microarray data to identify informative features to classify the types of cancer, yet numerous irrelevant features that exist in microarray data may introduce the noise and decrease classification accuracy. Regularization techniques are common methods for feature selection, which can be used to reduce irrelevant features and avoid overfitting. In recent years, different regularization methods have been proposed. Theoretically, the Lq (0<q<1) type penalty function with the lower value of .. would acquire better sparse solutions. In addition, the loss function in most regression models is based on least-squares minimization. However, the least-square method is sensitive to noise and has poor robustness, especially when the error has a heavy-tailed distribution. It is well known that the least absolute deviation regression is the most common method for the robust regression, which can overcome the big noise problem. In general, there is a high level of noise in microarray data, which deter the development of microarray technology. To solve the above problems, we propose a robust logistic regression based on the Lq (0<q<1) regularization approach, which is a feasible and effective approach for feature selection in microarray classification. The Lq (0<q<1) regularization leads to a non-convex optimization problem that is difficult to be solved. In this paper, we utilize a genetic algorithm based on the global search strategy to obtain an optimal solution.