Lieqing Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lieqing Lin has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Langcheng Chen
Network Information and Modern Educational Technology Center, Guangdong University of Technology, GuangZhou, China
2 shared publications - Qi Zhong
School of Computer Science and Technology, Guangdong University of Technology, Guangzhou, China
2 shared publications Dongying Lin
Center of Campus Network and Modern Educational Technology, Guangdong University of Technology, Guangzhou, China
1 shared publicationHaojie Xu
Center of Campus Network and Modern Educational Technology, Guangdong University of Technology, Guangzhou, China
1 shared publication- Haoran Wen
School of International Education Guangdong University of Technology Guangzhou Guangdong China
1 shared publication Jianming Li
Center of Campus Network and Modern Educational Technology, Guangdong University of Technology, Guangzhou, China
1 shared publication
Latest Publications
- 22 January 2025
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 16 (7-8) , 4189-4211
Intrusion detection using a hybrid approach based on CatBoost and an enhanced inception V1
- 22 January 2025
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 16 (7-8) , 4189-4211
Intrusion detection using a hybrid approach based on CatBoost and an enhanced inception V1
- 21 October 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (1) , 1-31
E-GRACL: an IoT intrusion detection system based on graph neural networks
- 21 October 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (1) , 1-31
E-GRACL: an IoT intrusion detection system based on graph neural networks
- Open Access
- 19 September 2024
- Published by Wiley in Journal of Cellular and Molecular Medicine
- Vol. 28 (18) , e70071
ANS‐SCMC: A matrix completion method based on adaptive neighbourhood similarity and sparse constraints for predicting microbe‐disease associations
The use of matrix completion methods to predict the association between microbes and diseases can effectively improve treatment efficiency. However, the similarity measures used in the existing methods are often influenced by various factors such as neighbourhood size, choice of similarity metric, or multiple parameters for similarity fusion, making it challenging. Additionally, matrix completion is currently limited by the sparsity of the initial association matrix, which restricts its predictive performance. To address these problems, we propose a matrix completion method based on adaptive neighbourhood similarity and sparse constraints (ANS‐SCMC) for predict microbe‐disease potential associations. Adaptive neighbourhood similarity learning dynamically uses the decomposition results as effective information for the next learning iteration by simultaneously performing local manifold structure learning and decomposition. This approach effectively preserves fine local structure information and avoids the influence of weight parameters directly involved in similarity measurement. Additionally, the sparse constraint‐based matrix completion approach can better handle the sparsity challenge in the association matrix. Finally, the algorithm we proposed has achieved significantly higher predictive performance in the validation compared to several commonly used prediction methods proposed to date. Furthermore, in the case study, the prediction algorithm achieved an accuracy of up to 80% for the top 10 microbes associated with type 1 diabetes and 100% for Crohn's disease respectively.
- 19 September 2024
- Published by Wiley in Journal of Cellular and Molecular Medicine
- Vol. 28 (18) , e70071
Open AccessANS‐SCMC: A matrix completion method based on adaptive neighbourhood similarity and sparse constraints for predicting microbe‐disease associations
The use of matrix completion methods to predict the association between microbes and diseases can effectively improve treatment efficiency. However, the similarity measures used in the existing methods are often influenced by various factors such as neighbourhood size, choice of similarity metric, or multiple parameters for similarity fusion, making it challenging. Additionally, matrix completion is currently limited by the sparsity of the initial association matrix, which restricts its predictive performance. To address these problems, we propose a matrix completion method based on adaptive neighbourhood similarity and sparse constraints (ANS‐SCMC) for predict microbe‐disease potential associations. Adaptive neighbourhood similarity learning dynamically uses the decomposition results as effective information for the next learning iteration by simultaneously performing local manifold structure learning and decomposition. This approach effectively preserves fine local structure information and avoids the influence of weight parameters directly involved in similarity measurement. Additionally, the sparse constraint‐based matrix completion approach can better handle the sparsity challenge in the association matrix. Finally, the algorithm we proposed has achieved significantly higher predictive performance in the validation compared to several commonly used prediction methods proposed to date. Furthermore, in the case study, the prediction algorithm achieved an accuracy of up to 80% for the top 10 microbes associated with type 1 diabetes and 100% for Crohn's disease respectively.
- Open Access
- 17 November 2022
- Published by Frontiers Media SA in Frontiers in Microbiology
- Vol. 13
WLLP: A weighted reconstruction-based linear label propagation algorithm for predicting potential therapeutic agents for COVID-19
The global coronavirus disease 2019 (COVID-19) pandemic caused by the severe acute respiratory syndrome coronavirus-2 (SARS-CoV) has led to a huge health and economic crises. However, the research required to develop new drugs and vaccines is very expensive in terms of labor, money, and time. Owing to recent advances in data science, drug-repositioning technologies have become one of the most promising strategies available for developing effective treatment options. Using the previously reported human drug virus database (HDVD), we proposed a model to predict possible drug regimens based on a weighted reconstruction-based linear label propagation algorithm (WLLP). For the drug–virus association matrix, we used the weighted K-nearest known neighbors method for preprocessing and label propagation of the network based on the linear neighborhood similarity of drugs and viruses to obtain the final prediction results. In the framework of 10 times 10-fold cross-validated area under the receiver operating characteristic (ROC) curve (AUC), WLLP exhibited excellent performance with an AUC of 0.8828 ± 0.0037 and an area under the precision-recall curve of 0.5277 ± 0.0053, outperforming the other four models used for comparison. We also predicted effective drug regimens against SARS-CoV-2, and this case study showed that WLLP can be used to suggest potential drugs for the treatment of COVID-19.
- 17 November 2022
- Published by Frontiers Media SA in Frontiers in Microbiology
- Vol. 13
Open AccessWLLP: A weighted reconstruction-based linear label propagation algorithm for predicting potential therapeutic agents for COVID-19
The global coronavirus disease 2019 (COVID-19) pandemic caused by the severe acute respiratory syndrome coronavirus-2 (SARS-CoV) has led to a huge health and economic crises. However, the research required to develop new drugs and vaccines is very expensive in terms of labor, money, and time. Owing to recent advances in data science, drug-repositioning technologies have become one of the most promising strategies available for developing effective treatment options. Using the previously reported human drug virus database (HDVD), we proposed a model to predict possible drug regimens based on a weighted reconstruction-based linear label propagation algorithm (WLLP). For the drug–virus association matrix, we used the weighted K-nearest known neighbors method for preprocessing and label propagation of the network based on the linear neighborhood similarity of drugs and viruses to obtain the final prediction results. In the framework of 10 times 10-fold cross-validated area under the receiver operating characteristic (ROC) curve (AUC), WLLP exhibited excellent performance with an AUC of 0.8828 ± 0.0037 and an area under the precision-recall curve of 0.5277 ± 0.0053, outperforming the other four models used for comparison. We also predicted effective drug regimens against SARS-CoV-2, and this case study showed that WLLP can be used to suggest potential drugs for the treatment of COVID-19.