Ying Ju
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
Ying Ju has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Chaolu Meng
College of Computer and Information Engineering, Inner Mongolia Agricultural University, Hohhot, China; Inner Mongolia Autonomous Region Key Laboratory of Big Data Research and Application of Agriculture and Animal Husbandry
2 shared publications - Hua Shi
Xiamen University of Technology
2 shared publications Lei Xu
Yangtze Delta Region Institute (Quzhou), University of Electronic Science and Technology of China, Quzhou, China
2 shared publicationsQuan Zou
Institute of Fundamental and Frontier Sciences, University of Electronic Science and Technology of China, Chengdu, China
2 shared publications- Quan Zou
University of Electronic Science and Technology of China
2 shared publications - Chao Wang
Center for Genomic and Personalized Medicine, Guangxi Key Laboratory for Genomic and Personalized Medicine, Guangxi Collaborative Innovation Center for Genomic and Personalized Medicine, Guangxi Medical University, Nanning, Guangxi, China
1 shared publication
Latest Publications
- Open Access
- 30 December 2024
- Published by Oxford University Press (OUP) in Briefings in Functional Genomics
- Vol. 24
STLBRF: an improved random forest algorithm based on standardized-threshold for feature screening of gene expression data
When the traditional random forest (RF) algorithm is used to select feature elements in biostatistical data, a large amount of noise data and parameters can affect the importance of the selected feature elements, making the control of feature selection difficult. Therefore, it is a challenge for the traditional RF algorithm to preserve the accuracy of algorithm results in the presence of noise data. Generally, directly removing noise data can result in significant bias in the results. In this study, we develop a new algorithm, standardized threshold, and loops based random forest (STLBRF), and apply it to the field of gene expression data for feature gene selection. This algorithm, based on the traditional RF algorithm, combines backward elimination and K-fold cross-validation to construct a cyclic system and set a standardized threshold: error increment. The algorithm overcomes the shortcomings of existing gene selection methods. We compare ridge regression, lasso regression, elastic net regression, the traditional RF algorithm, and our improved RF algorithm using three real gene expression datasets and conducting a quantitative analysis. To ensure the reliability of the results, we validate the effectiveness of the genes selected by these methods using the Random Forest classifier. The results indicate that, compared to other methods, the STLBRF algorithm achieves not only higher effectiveness in feature gene selection but also better control over the number of selected genes. Our method offers reliable technical support for feature expression analysis and research on biomarker selection.
- 30 December 2024
- Published by Oxford University Press (OUP) in Briefings in Functional Genomics
- Vol. 24
Open AccessSTLBRF: an improved random forest algorithm based on standardized-threshold for feature screening of gene expression data
When the traditional random forest (RF) algorithm is used to select feature elements in biostatistical data, a large amount of noise data and parameters can affect the importance of the selected feature elements, making the control of feature selection difficult. Therefore, it is a challenge for the traditional RF algorithm to preserve the accuracy of algorithm results in the presence of noise data. Generally, directly removing noise data can result in significant bias in the results. In this study, we develop a new algorithm, standardized threshold, and loops based random forest (STLBRF), and apply it to the field of gene expression data for feature gene selection. This algorithm, based on the traditional RF algorithm, combines backward elimination and K-fold cross-validation to construct a cyclic system and set a standardized threshold: error increment. The algorithm overcomes the shortcomings of existing gene selection methods. We compare ridge regression, lasso regression, elastic net regression, the traditional RF algorithm, and our improved RF algorithm using three real gene expression datasets and conducting a quantitative analysis. To ensure the reliability of the results, we validate the effectiveness of the genes selected by these methods using the Random Forest classifier. The results indicate that, compared to other methods, the STLBRF algorithm achieves not only higher effectiveness in feature gene selection but also better control over the number of selected genes. Our method offers reliable technical support for feature expression analysis and research on biomarker selection.
- Open Access
- 4 December 2024
- Published by Springer Nature in Genomics & Informatics
- Vol. 22 (1) , 1-10
Rore: robust and efficient antioxidant protein classification via a novel dimensionality reduction strategy based on learning of fewer features
In protein identification, researchers increasingly aim to achieve efficient classification using fewer features. While many feature selection methods effectively reduce the number of model features, they often cause information loss caused by merely selecting or discarding features, which limits classifier performance. To address this issue, we present Rore, an algorithm based on a feature-dimensionality reduction strategy. By mapping the original features to a latent space, Rore retains all relevant feature information while using fewer representations of the latent features. This approach significantly preserves the original information and overcomes the information loss problem associated with previous feature selection. Through extensive experimental validation and analysis, Rore demonstrated excellent performance on an antioxidant protein dataset, achieving an accuracy of 95.88% and MCC of 91.78%, using vectors including only 15 features. The Rore algorithm is available online at http://112.124.26.17:8021/Rore.
- 4 December 2024
- Published by Springer Nature in Genomics & Informatics
- Vol. 22 (1) , 1-10
Open AccessRore: robust and efficient antioxidant protein classification via a novel dimensionality reduction strategy based on learning of fewer features
In protein identification, researchers increasingly aim to achieve efficient classification using fewer features. While many feature selection methods effectively reduce the number of model features, they often cause information loss caused by merely selecting or discarding features, which limits classifier performance. To address this issue, we present Rore, an algorithm based on a feature-dimensionality reduction strategy. By mapping the original features to a latent space, Rore retains all relevant feature information while using fewer representations of the latent features. This approach significantly preserves the original information and overcomes the information loss problem associated with previous feature selection. Through extensive experimental validation and analysis, Rore demonstrated excellent performance on an antioxidant protein dataset, achieving an accuracy of 95.88% and MCC of 91.78%, using vectors including only 15 features. The Rore algorithm is available online at http://112.124.26.17:8021/Rore.
- 25 October 2023
- Published by Wiley in Journal of Cellular Biochemistry
- Vol. 124 (11) , 1825-1834
Machine learning‐based antioxidant protein identification model: Progress and evaluation
Efficient and accurate identification of antioxidant proteins is of great significance. In recent years, many models for identifying antioxidant proteins have been proposed, but the low sensitivity and high dimensionality of the models are common problems. The generalization ability of the model needs to be improved. Researchers have tried different feature extraction algorithms and feature selection algorithms to obtain the most effective feature combination and have chosen more appropriate classification algorithms and tools to improve model performance. In this article, we systematically reviewed the data set of the most frequently used antioxidant proteins and the method selection for each step of model establishment and discussed the characteristics of each method. We have conducted a detailed analysis of recent research and believe that the practical ability and efficiency of model application can be improved by reducing model dimensions. The key to improving the performance of antioxidant protein recognition models in the future may lie in feature selection, so this paper also focuses on the combination of feature extraction and selection steps in the analysis of the model building process.
- 25 October 2023
- Published by Wiley in Journal of Cellular Biochemistry
- Vol. 124 (11) , 1825-1834
Machine learning‐based antioxidant protein identification model: Progress and evaluation
Efficient and accurate identification of antioxidant proteins is of great significance. In recent years, many models for identifying antioxidant proteins have been proposed, but the low sensitivity and high dimensionality of the models are common problems. The generalization ability of the model needs to be improved. Researchers have tried different feature extraction algorithms and feature selection algorithms to obtain the most effective feature combination and have chosen more appropriate classification algorithms and tools to improve model performance. In this article, we systematically reviewed the data set of the most frequently used antioxidant proteins and the method selection for each step of model establishment and discussed the characteristics of each method. We have conducted a detailed analysis of recent research and believe that the practical ability and efficiency of model application can be improved by reducing model dimensions. The key to improving the performance of antioxidant protein recognition models in the future may lie in feature selection, so this paper also focuses on the combination of feature extraction and selection steps in the analysis of the model building process.
- 30 November 2022
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 152, 106380
Utilize a few features to classify presynaptic and postsynaptic neurotoxins
- 30 November 2022
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 152, 106380
Utilize a few features to classify presynaptic and postsynaptic neurotoxins
- 5 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 20 (2) , 967-975
Enhancer-FRL: Improved and Robust Identification of Enhancers and Their Activities Using Feature Representation Learning
Enhancers are crucial for precise regulation of gene expression, while enhancer identification and strength prediction are challenging because of their free distribution and tremendous number of similar fractions in the genome. Although several bioinformatics tools have been developed, shortfalls in these models remain, and their performances need further improvement. In the present study, a two-layer predictor called Enhancer-FRL was proposed for identifying enhancers (enhancers or nonenhancers) and their activities (strong and weak). More specifically, to build an efficient model, the feature representation learning scheme was applied to generate a 50D probabilistic vector based on 10 feature encodings and five machine learning algorithms. Subsequently, the multiview probabilistic features were integrated to construct the final prediction model. Compared with the single feature-based model, Enhancer-FRL showed significant performance improvement and model robustness. Performance assessment on the independent test dataset indicated that the proposed model outperformed state-of-the-art available toolkits. The webserver Enhancer-FRL is freely accessible at http://lab.malab.cn/∼wangchao/softwares/Enhancer-FRL/ , The code and datasets can be downloaded at the webserver page or at the Github https://github.com/wangchao-malab/Enhancer-FRL/ .
- 5 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 20 (2) , 967-975
Enhancer-FRL: Improved and Robust Identification of Enhancers and Their Activities Using Feature Representation Learning
Enhancers are crucial for precise regulation of gene expression, while enhancer identification and strength prediction are challenging because of their free distribution and tremendous number of similar fractions in the genome. Although several bioinformatics tools have been developed, shortfalls in these models remain, and their performances need further improvement. In the present study, a two-layer predictor called Enhancer-FRL was proposed for identifying enhancers (enhancers or nonenhancers) and their activities (strong and weak). More specifically, to build an efficient model, the feature representation learning scheme was applied to generate a 50D probabilistic vector based on 10 feature encodings and five machine learning algorithms. Subsequently, the multiview probabilistic features were integrated to construct the final prediction model. Compared with the single feature-based model, Enhancer-FRL showed significant performance improvement and model robustness. Performance assessment on the independent test dataset indicated that the proposed model outperformed state-of-the-art available toolkits. The webserver Enhancer-FRL is freely accessible at http://lab.malab.cn/∼wangchao/softwares/Enhancer-FRL/ , The code and datasets can be downloaded at the webserver page or at the Github https://github.com/wangchao-malab/Enhancer-FRL/ .
- 23 February 2022
- Published by Elsevier in Analytical Biochemistry
- Vol. 645, 114625
TMPpred: A support vector machine-based thermophilic protein identifier
- 23 February 2022
- Published by Elsevier in Analytical Biochemistry
- Vol. 645, 114625
TMPpred: A support vector machine-based thermophilic protein identifier
- 19 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 32 (8) , 5361-5373
Dual Mutual Learning for Cross-Modality Person Re-Identification
Cross-modality person re-identification (Re-ID) is more challenging than traditional visible Re-ID due to the huge cross-modality gap from heterogeneous images. To alleviate this problem, existing methods often utilize a dual path learning framework equipped with metric loss to learn discriminative features. Despite effectiveness, the inevitable degeneration of intra-modality discrimination by taking cross-modality discrimination into consideration is unsolvable. Such degeneration substantially hinders the model’s capability of further improving feature representations. To mitigate this degeneration, we propose a Dual Mutual Learning (DML) method for cross-modality Re-ID which conducts mutual learning between the cross-modality and each of two single modalities. We design a triple-branch deep model containing the RGB and IR branches and the cross-modality branch. The cross-modality branch is designed to learn modality-invariant feature subspace for appearance similarity measurement. Both the RGB branch and IR branch provide attention supervision information to the cross-modality branch for attention feature alignment so as to enhance the intra-modality discrimination. Experimental results on two standard benchmarks demonstrate DML is superior to state-of-the-art methods.
- 19 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 32 (8) , 5361-5373
Dual Mutual Learning for Cross-Modality Person Re-Identification
Cross-modality person re-identification (Re-ID) is more challenging than traditional visible Re-ID due to the huge cross-modality gap from heterogeneous images. To alleviate this problem, existing methods often utilize a dual path learning framework equipped with metric loss to learn discriminative features. Despite effectiveness, the inevitable degeneration of intra-modality discrimination by taking cross-modality discrimination into consideration is unsolvable. Such degeneration substantially hinders the model’s capability of further improving feature representations. To mitigate this degeneration, we propose a Dual Mutual Learning (DML) method for cross-modality Re-ID which conducts mutual learning between the cross-modality and each of two single modalities. We design a triple-branch deep model containing the RGB and IR branches and the cross-modality branch. The cross-modality branch is designed to learn modality-invariant feature subspace for appearance similarity measurement. Both the RGB branch and IR branch provide attention supervision information to the cross-modality branch for attention feature alignment so as to enhance the intra-modality discrimination. Experimental results on two standard benchmarks demonstrate DML is superior to state-of-the-art methods.
- Open Access
- 15 December 2021
- Published by Frontiers Media SA in Frontiers in Genetics
- Vol. 12, 810875
Application of Sparse Representation in Bioinformatics
Inspired by L1-norm minimization methods, such as basis pursuit, compressed sensing, and Lasso feature selection, in recent years, sparse representation shows up as a novel and potent data processing method and displays powerful superiority. Researchers have not only extended the sparse representation of a signal to image presentation, but also applied the sparsity of vectors to that of matrices. Moreover, sparse representation has been applied to pattern recognition with good results. Because of its multiple advantages, such as insensitivity to noise, strong robustness, less sensitivity to selected features, and no “overfitting” phenomenon, the application of sparse representation in bioinformatics should be studied further. This article reviews the development of sparse representation, and explains its applications in bioinformatics, namely the use of low-rank representation matrices to identify and study cancer molecules, low-rank sparse representations to analyze and process gene expression profiles, and an introduction to related cancers and gene expression profile database.
- 15 December 2021
- Published by Frontiers Media SA in Frontiers in Genetics
- Vol. 12, 810875
Open AccessApplication of Sparse Representation in Bioinformatics
Inspired by L1-norm minimization methods, such as basis pursuit, compressed sensing, and Lasso feature selection, in recent years, sparse representation shows up as a novel and potent data processing method and displays powerful superiority. Researchers have not only extended the sparse representation of a signal to image presentation, but also applied the sparsity of vectors to that of matrices. Moreover, sparse representation has been applied to pattern recognition with good results. Because of its multiple advantages, such as insensitivity to noise, strong robustness, less sensitivity to selected features, and no “overfitting” phenomenon, the application of sparse representation in bioinformatics should be studied further. This article reviews the development of sparse representation, and explains its applications in bioinformatics, namely the use of low-rank representation matrices to identify and study cancer molecules, low-rank sparse representations to analyze and process gene expression profiles, and an introduction to related cancers and gene expression profile database.
- 9 September 2021
- Published by Bentham Science Publishers Ltd. in Current Pharmaceutical Design
- Vol. 27 (23) , 2728-2736
The Next Generation of Machine Learning in DDIs Prediction
Drug-drug interactions may occur when combining two or more drugs may cause some adverse events such as cardiotoxicity, central neurotoxicity, hepatotoxicity, etc. However, a large number of researchers who are proficient in pharmacokinetics and pharmacodynamics have been engaged in drug assays and trying to find out the side effects of all kinds of drug combinations. However, at the same time, the number of new drugs is increasing dramatically, and the drug assay is an expensive and time-consuming process. It is impossible to find all the adverse reactions through drug experiments. Therefore, new attempts have been made in using computational techniques to deal with this problem. In this review, we conduct a review of the literature on applying the computational method for predicting drug-drug interactions. We first briefly introduce the widely used data sets. After that, we elaborate on the existing state-of-art deep learning models for drug-drug interactions prediction. We also discussed the challenges and opportunities of applying the computational method in drug-drug interactions prediction.
- 9 September 2021
- Published by Bentham Science Publishers Ltd. in Current Pharmaceutical Design
- Vol. 27 (23) , 2728-2736
The Next Generation of Machine Learning in DDIs Prediction
Drug-drug interactions may occur when combining two or more drugs may cause some adverse events such as cardiotoxicity, central neurotoxicity, hepatotoxicity, etc. However, a large number of researchers who are proficient in pharmacokinetics and pharmacodynamics have been engaged in drug assays and trying to find out the side effects of all kinds of drug combinations. However, at the same time, the number of new drugs is increasing dramatically, and the drug assay is an expensive and time-consuming process. It is impossible to find all the adverse reactions through drug experiments. Therefore, new attempts have been made in using computational techniques to deal with this problem. In this review, we conduct a review of the literature on applying the computational method for predicting drug-drug interactions. We first briefly introduce the widely used data sets. After that, we elaborate on the existing state-of-art deep learning models for drug-drug interactions prediction. We also discussed the challenges and opportunities of applying the computational method in drug-drug interactions prediction.