Deyu Tang
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
Deyu Tang has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
Yongming Cai
School of Medical Information Engineering, Guangdong Pharmaceutical University, Guangzhou, People’s Republic of China
5 shared publicationsJie Zhao
School of Management, Guangdong University of Technology, Guangzhou, PR China
4 shared publicationsJin Yang
School of Medical Information Engineering, Guangdong Pharmaceutical University, Guangzhou, People’s Republic of China
4 shared publicationsJian Weng
Affiliation College of Cyber Security, Jinan University, GuangZhou, GuangDong, China
3 shared publications- Jin Yang
Guangdong Pharmaceutical University
3 shared publications Lingzhi Hu
School of Medical Information Engineering, Guangdong Pharmaceutical University, Guangzhou, People’s Republic of China
3 shared publications
Latest Publications
- Open Access
Arthropod Pesticide Resistance Scholar: A Large Language Model-Assisted Literature-Mining Framework for Building an Evidence-Grade Arthropod Pesticide Resistance Knowledge Base
The rapid evolution of insecticide and acaricide resistance in arthropod pests threatens crop protection and sustainable pest management, while the supporting evidence is dispersed across tens of thousands of papers. Existing curated databases are manually maintained and taxon-narrow, and they rarely link case-level monitoring with mechanistic evidence. Here, we developed Arthropod Pesticide Resistance Scholar (APRS), a large language model-assisted extraction framework that progressively extracts resistance evidence section by section. APRS confirms species, pesticide, and gene or population relationships step by step and retains only records with quantitative or experimental support, generating two evidence tracks: monitoring (species, pesticide, population, and resistance phenotype) and mechanism (species, pesticide, gene, and supporting method). The released knowledge base contains 40,950 structured cases from 4094 publications, covering 359 species, 313 pesticides, and 2563 genes, with resistance evidence spanning 1936 to 2025. Against a fixed 100-paper expert gold set comprising 696 manually curated cases, case-level extraction achieved precision, recall, and F1 scores of 0.94, 0.91, and 0.93, respectively. APRS provides structured filtering and a case-level retrieval-augmented assistant, supporting resistance monitoring, mechanism discovery, resistance management, and integrated pest management.
Open AccessArthropod Pesticide Resistance Scholar: A Large Language Model-Assisted Literature-Mining Framework for Building an Evidence-Grade Arthropod Pesticide Resistance Knowledge Base
The rapid evolution of insecticide and acaricide resistance in arthropod pests threatens crop protection and sustainable pest management, while the supporting evidence is dispersed across tens of thousands of papers. Existing curated databases are manually maintained and taxon-narrow, and they rarely link case-level monitoring with mechanistic evidence. Here, we developed Arthropod Pesticide Resistance Scholar (APRS), a large language model-assisted extraction framework that progressively extracts resistance evidence section by section. APRS confirms species, pesticide, and gene or population relationships step by step and retains only records with quantitative or experimental support, generating two evidence tracks: monitoring (species, pesticide, population, and resistance phenotype) and mechanism (species, pesticide, gene, and supporting method). The released knowledge base contains 40,950 structured cases from 4094 publications, covering 359 species, 313 pesticides, and 2563 genes, with resistance evidence spanning 1936 to 2025. Against a fixed 100-paper expert gold set comprising 696 manually curated cases, case-level extraction achieved precision, recall, and F1 scores of 0.94, 0.91, and 0.93, respectively. APRS provides structured filtering and a case-level retrieval-augmented assistant, supporting resistance monitoring, mechanism discovery, resistance management, and integrated pest management.
- Open Access
- 27 October 2025
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 21 (10) , e1013622
Multi-feature fusion network with marginal focal dice loss for multi-label therapeutic peptide prediction
Accurately predicting the functions of multi-functional therapeutic peptides is crucial for the development of related drugs. However, existing peptide function prediction methods largely rely on either a single type of feature or a single model architecture, limiting prediction accuracy and applicability. Additionally, training better-performing models on datasets with class imbalance issues remains a significant challenge. In this study, we propose the multi-functional therapeutic peptide of multi-feature fusion prediction (MFTP_MFFP) model, a novel method for predicting the functionality of multi-functional therapeutic peptides. This approach uses various encoding techniques to process peptide sequence data, generating multiple features that help the model learn hidden information within the sequences. To maximize the effectiveness of these features, we propose a gated feature fusion module that efficiently integrates them. The module assigns learnable gating weights to each feature, optimizing integration and enhancing fusion efficiency. The fused features are then passed into a neural network model for feature extraction. Additionally, we propose a marginal focal dice loss function (MFDL) to address the class imbalance and improve the model’s prediction performance. Experimental results show that the MFTP_MFFP model outperforms existing models in all evaluation metrics, demonstrating its robustness and effectiveness in multi-functional therapeutic peptide prediction tasks.
- 27 October 2025
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 21 (10) , e1013622
Open AccessMulti-feature fusion network with marginal focal dice loss for multi-label therapeutic peptide prediction
Accurately predicting the functions of multi-functional therapeutic peptides is crucial for the development of related drugs. However, existing peptide function prediction methods largely rely on either a single type of feature or a single model architecture, limiting prediction accuracy and applicability. Additionally, training better-performing models on datasets with class imbalance issues remains a significant challenge. In this study, we propose the multi-functional therapeutic peptide of multi-feature fusion prediction (MFTP_MFFP) model, a novel method for predicting the functionality of multi-functional therapeutic peptides. This approach uses various encoding techniques to process peptide sequence data, generating multiple features that help the model learn hidden information within the sequences. To maximize the effectiveness of these features, we propose a gated feature fusion module that efficiently integrates them. The module assigns learnable gating weights to each feature, optimizing integration and enhancing fusion efficiency. The fused features are then passed into a neural network model for feature extraction. Additionally, we propose a marginal focal dice loss function (MFDL) to address the class imbalance and improve the model’s prediction performance. Experimental results show that the MFTP_MFFP model outperforms existing models in all evaluation metrics, demonstrating its robustness and effectiveness in multi-functional therapeutic peptide prediction tasks.
- Open Access
- 2 July 2025
- Published by Oxford University Press (OUP) in Briefings in Bioinformatics
- Vol. 26 (4)
MDNN: memetic deep neural network for genomic prediction
Genomic prediction (GP) has made significant progress in the field of breeding. Traditional linear models perform well in handling simple traits but have limitations in extracting nonlinear features for complex traits. The introduction of deep learning (DL) techniques has provided a new approach to GP, especially suited for high-dimensional data processing and complex trait prediction. However, traditional DL models require manual design of the network architecture, which necessitates continuous experimentation and modification. In this paper, we propose a new framework, MDNN, that utilizes the memetic algorithm for neural architecture search and automatically optimizes the network architecture. Compared with the DNNGP, MDNN achieved a 36.49% improvement in the average Pearson correlation coefficient on the wheat599 dataset and a 12.28% improvement on the wheat2000 dataset.
- 2 July 2025
- Published by Oxford University Press (OUP) in Briefings in Bioinformatics
- Vol. 26 (4)
Open AccessMDNN: memetic deep neural network for genomic prediction
Genomic prediction (GP) has made significant progress in the field of breeding. Traditional linear models perform well in handling simple traits but have limitations in extracting nonlinear features for complex traits. The introduction of deep learning (DL) techniques has provided a new approach to GP, especially suited for high-dimensional data processing and complex trait prediction. However, traditional DL models require manual design of the network architecture, which necessitates continuous experimentation and modification. In this paper, we propose a new framework, MDNN, that utilizes the memetic algorithm for neural architecture search and automatically optimizes the network architecture. Compared with the DNNGP, MDNN achieved a 36.49% improvement in the average Pearson correlation coefficient on the wheat599 dataset and a 12.28% improvement on the wheat2000 dataset.
- Open Access
- 4 March 2025
- Published by Oxford University Press (OUP) in Briefings in Bioinformatics
- Vol. 26 (2)
Inter-view contrastive learning and miRNA fusion for lncRNA-protein interaction prediction in heterogeneous graphs
Predicting long non-coding RNA (lncRNA)-protein interactions is essential for understanding biological processes and discovering new therapeutic targets. In this study, we propose a novel model based on inter-view contrastive learning and miRNA fusion for lncRNA-protein interaction (LPI) prediction, called ICMF-LPI, which utilizes a heterogeneous information network to enhance LPI prediction. The model integrates miRNA as a mediator, constructing an lncRNA-miRNA-protein network, and employs metapath to extract diverse relationships from heterogeneous graphs. By fusing miRNA-related information and leveraging contrastive learning across inter-views, ICMF-LPI effectively captures potential interactions. Experimental results, including five-fold cross-validation, demonstrate the model’s superior performance compared to several state-of-the-art methods, with significant improvements in the area under the receiver operating characteristic curve and the area under the precision-recall curve metrics. Notably, even when direct LPI connections are excluded, ICMF-LPI still achieves competitive predictive accuracy, performing comparably or better than some existing models. This demonstrates that the proposed model is effective in scenarios where direct interaction data are unavailable. This approach offers a promising direction for developing predictive models in bioinformatics, particularly in challenging conditions.
- 4 March 2025
- Published by Oxford University Press (OUP) in Briefings in Bioinformatics
- Vol. 26 (2)
Open AccessInter-view contrastive learning and miRNA fusion for lncRNA-protein interaction prediction in heterogeneous graphs
Predicting long non-coding RNA (lncRNA)-protein interactions is essential for understanding biological processes and discovering new therapeutic targets. In this study, we propose a novel model based on inter-view contrastive learning and miRNA fusion for lncRNA-protein interaction (LPI) prediction, called ICMF-LPI, which utilizes a heterogeneous information network to enhance LPI prediction. The model integrates miRNA as a mediator, constructing an lncRNA-miRNA-protein network, and employs metapath to extract diverse relationships from heterogeneous graphs. By fusing miRNA-related information and leveraging contrastive learning across inter-views, ICMF-LPI effectively captures potential interactions. Experimental results, including five-fold cross-validation, demonstrate the model’s superior performance compared to several state-of-the-art methods, with significant improvements in the area under the receiver operating characteristic curve and the area under the precision-recall curve metrics. Notably, even when direct LPI connections are excluded, ICMF-LPI still achieves competitive predictive accuracy, performing comparably or better than some existing models. This demonstrates that the proposed model is effective in scenarios where direct interaction data are unavailable. This approach offers a promising direction for developing predictive models in bioinformatics, particularly in challenging conditions.
- Open Access
- 13 May 2024
- Published by Springer Nature in BMC Genomics
- Vol. 25 (1) , 1-23
SEEI: spherical evolution with feedback mechanism for identifying epistatic interactions
Background: Detecting epistatic interactions (EIs) involves the exploration of associations among single nucleotide polymorphisms (SNPs) and complex diseases, which is an important task in genome-wide association studies. The EI detection problem is dependent on epistasis models and corresponding optimization methods. Although various models and methods have been proposed to detect EIs, identifying EIs efficiently and accurately is still a challenge. Results: Here, we propose a linear mixed statistical epistasis model (LMSE) and a spherical evolution approach with a feedback mechanism (named SEEI). The LMSE model expands the existing single epistasis models such as LR-Score, K2-Score, Mutual information, and Gini index. The SEEI includes an adaptive spherical search strategy and population updating strategy, which ensures that the algorithm is not easily trapped in local optima. We analyzed the performances of 8 random disease models, 12 disease models with marginal effects, 30 disease models without marginal effects, and 10 high-order disease models. The 60 simulated disease models and a real breast cancer dataset were used to evaluate eight algorithms (SEEI, EACO, EpiACO, FDHEIW, MP-HS-DHSI, NHSA-DHSC, SNPHarvester, CSE). Three evaluation criteria (pow1, pow2, pow3), a T-test, and a Friedman test were used to compare the performances of these algorithms. The results show that the SEEI algorithm (order 1, averages ranks = 13.125) outperformed the other algorithms in detecting EIs. Conclusions: Here, we propose an LMSE model and an evolutionary computing method (SEEI) to solve the optimization problem of the LMSE model. The proposed method performed better than the other seven algorithms tested in its ability to identify EIs in genome-wide association datasets. We identified new SNP–SNP combinations in the real breast cancer dataset and verified the results. Our findings provide new insights for the diagnosis and treatment of breast cancer. Availability and implementation: https://github.com/scutdy/SSO/blob/master/SEEI.zip.
- 13 May 2024
- Published by Springer Nature in BMC Genomics
- Vol. 25 (1) , 1-23
Open AccessSEEI: spherical evolution with feedback mechanism for identifying epistatic interactions
Background: Detecting epistatic interactions (EIs) involves the exploration of associations among single nucleotide polymorphisms (SNPs) and complex diseases, which is an important task in genome-wide association studies. The EI detection problem is dependent on epistasis models and corresponding optimization methods. Although various models and methods have been proposed to detect EIs, identifying EIs efficiently and accurately is still a challenge. Results: Here, we propose a linear mixed statistical epistasis model (LMSE) and a spherical evolution approach with a feedback mechanism (named SEEI). The LMSE model expands the existing single epistasis models such as LR-Score, K2-Score, Mutual information, and Gini index. The SEEI includes an adaptive spherical search strategy and population updating strategy, which ensures that the algorithm is not easily trapped in local optima. We analyzed the performances of 8 random disease models, 12 disease models with marginal effects, 30 disease models without marginal effects, and 10 high-order disease models. The 60 simulated disease models and a real breast cancer dataset were used to evaluate eight algorithms (SEEI, EACO, EpiACO, FDHEIW, MP-HS-DHSI, NHSA-DHSC, SNPHarvester, CSE). Three evaluation criteria (pow1, pow2, pow3), a T-test, and a Friedman test were used to compare the performances of these algorithms. The results show that the SEEI algorithm (order 1, averages ranks = 13.125) outperformed the other algorithms in detecting EIs. Conclusions: Here, we propose an LMSE model and an evolutionary computing method (SEEI) to solve the optimization problem of the LMSE model. The proposed method performed better than the other seven algorithms tested in its ability to identify EIs in genome-wide association datasets. We identified new SNP–SNP combinations in the real breast cancer dataset and verified the results. Our findings provide new insights for the diagnosis and treatment of breast cancer. Availability and implementation: https://github.com/scutdy/SSO/blob/master/SEEI.zip.
- Open Access
- 3 February 2023
- Published by Springer Nature in BMC Bioinformatics
- Vol. 24 (1) , 1-21
SSELM-neg: spherical search-based extreme learning machine for drug–target interaction prediction
Background: The experimental verification of a drug discovery process is expensive and time-consuming. Therefore, efficiently and effectively identifying drug–target interactions (DTIs) has been the focus of research. At present, many machine learning algorithms are used for predicting DTIs. The key idea is to train the classifier using an existing DTI to predict a new or unknown DTI. However, there are various challenges, such as class imbalance and the parameter optimization of many classifiers, that need to be solved before an optimal DTI model is developed.Methods: In this study, we propose a framework called SSELM-neg for DTI prediction, in which we use a screening approach to choose high-quality negative samples and a spherical search approach to optimize the parameters of the extreme learning machine.Results: The results demonstrated that the proposed technique outperformed other state-of-the-art methods in 10-fold cross-validation experiments in terms of the area under the receiver operating characteristic curve (0.986, 0.993, 0.988, and 0.969) and AUPR (0.982, 0.991, 0.982, and 0.946) for the enzyme dataset, G-protein coupled receptor dataset, ion channel dataset, and nuclear receptor dataset, respectively.Conclusion: The screening approach produced high-quality negative samples with the same number of positive samples, which solved the class imbalance problem. We optimized an extreme learning machine using a spherical search approach to identify DTIs. Therefore, our models performed better than other state-of-the-art methods.
- 3 February 2023
- Published by Springer Nature in BMC Bioinformatics
- Vol. 24 (1) , 1-21
Open AccessSSELM-neg: spherical search-based extreme learning machine for drug–target interaction prediction
Background: The experimental verification of a drug discovery process is expensive and time-consuming. Therefore, efficiently and effectively identifying drug–target interactions (DTIs) has been the focus of research. At present, many machine learning algorithms are used for predicting DTIs. The key idea is to train the classifier using an existing DTI to predict a new or unknown DTI. However, there are various challenges, such as class imbalance and the parameter optimization of many classifiers, that need to be solved before an optimal DTI model is developed.Methods: In this study, we propose a framework called SSELM-neg for DTI prediction, in which we use a screening approach to choose high-quality negative samples and a spherical search approach to optimize the parameters of the extreme learning machine.Results: The results demonstrated that the proposed technique outperformed other state-of-the-art methods in 10-fold cross-validation experiments in terms of the area under the receiver operating characteristic curve (0.986, 0.993, 0.988, and 0.969) and AUPR (0.982, 0.991, 0.982, and 0.946) for the enzyme dataset, G-protein coupled receptor dataset, ion channel dataset, and nuclear receptor dataset, respectively.Conclusion: The screening approach produced high-quality negative samples with the same number of positive samples, which solved the class imbalance problem. We optimized an extreme learning machine using a spherical search approach to identify DTIs. Therefore, our models performed better than other state-of-the-art methods.
- Open Access
- 5 November 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (21) , 4134
HSICCR: A Lightweight Scoring Criterion Based on Measuring the Degree of Causality for the Detection of SNP Interactions
Recently, research on detecting SNP interactions has attracted considerable attention, which is of great significance for exploring complex diseases. The formulation of effective swarm intelligence optimization algorithms is a primary resolution to this issue. To achieve this goal, an important problem needs to be solved in advance; that is, designing and selecting lightweight scoring criteria that can be calculated in time and can accurately estimate the degree of association between SNP combinations and disease status. In this study, we propose a high-accuracy scoring criterion (HSIC) by measuring the degree of causality dedicated to assessing the degree. First, we approximate two kinds of dependencies according to the structural equation of the causal relationship between epistasis SNP combination and disease status. Then, inspired by these dependencies, we put forward this scoring criterion that integrates a widely used method of measuring statistical dependencies based on kernel functions (HSIC). However, the computing time complexity of HSIC is , which is too costly to be an integral part of the scoring criterion. Since the sizes of the sample space of the disease status, SNP loci and SNP combination are small enough, we propose an efficient method of computing HSIC for variables with a small sample in time. Eventually, HSIC can be computed in time in practice. Finally, we compared HSIC with five representative high-accuracy scoring criteria that detect SNP interactions for 49 simulation disease models. The experimental results show that the accuracy of our proposed scoring criterion is, overall, state-of-the-art.- 5 November 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (21) , 4134
Open AccessHSICCR: A Lightweight Scoring Criterion Based on Measuring the Degree of Causality for the Detection of SNP Interactions
Recently, research on detecting SNP interactions has attracted considerable attention, which is of great significance for exploring complex diseases. The formulation of effective swarm intelligence optimization algorithms is a primary resolution to this issue. To achieve this goal, an important problem needs to be solved in advance; that is, designing and selecting lightweight scoring criteria that can be calculated in time and can accurately estimate the degree of association between SNP combinations and disease status. In this study, we propose a high-accuracy scoring criterion (HSIC) by measuring the degree of causality dedicated to assessing the degree. First, we approximate two kinds of dependencies according to the structural equation of the causal relationship between epistasis SNP combination and disease status. Then, inspired by these dependencies, we put forward this scoring criterion that integrates a widely used method of measuring statistical dependencies based on kernel functions (HSIC). However, the computing time complexity of HSIC is , which is too costly to be an integral part of the scoring criterion. Since the sizes of the sample space of the disease status, SNP loci and SNP combination are small enough, we propose an efficient method of computing HSIC for variables with a small sample in time. Eventually, HSIC can be computed in time in practice. Finally, we compared HSIC with five representative high-accuracy scoring criteria that detect SNP interactions for 49 simulation disease models. The experimental results show that the accuracy of our proposed scoring criterion is, overall, state-of-the-art. - Open Access
- 14 October 2022
- Published by Springer Nature in Research Square
SSELM-neg: Spherical search-based extreme learning machine for drug-target interaction prediction
Background: Experimental verification of a drug discovery process is expensive and time-consuming. Therefore, efficiently and effectively identify drug–target interactions (DTIs) has been research focus. In present, many machine learning algorithms are used for predicting drug-target interactions. The key idea is to train the classifier using existing DTI so as to predict new or unknown DTI. However, there are various challenges such as class imbalance and parameter optimization of many classifiers that need to be solved before developing an optimal drug-target interaction model. Methods: In this paper, we propose a framework named SSELM-neg for drug-target interaction prediction, in which a screening approach was used to choose high quality negative samples and a spherical search approach is used to optimize the parameters of the extreme learning machine. Results: Results show that the performance of the proposed technique outperforms the other state-of-the-art methods in 10-fold cross-validation experiments in terms of AUC(0.986, 0.993, 0.988, 0.969 ) and AUPR(0.982, 0.991, 0.982, 0.946) for E dataset, GPCR dataset, IC dataset and NR dataset. Conclusion: Screening approach produce the high quality negative samples with the same numbers of the positive samples, which solve the class imbalance problem. Extreme learning machine was optimized by a spherical search approach in identifying DTIs. Therefore, our models achieve better performance than other state-of-the-art methods.
- 14 October 2022
- Published by Springer Nature in Research Square
Open AccessSSELM-neg: Spherical search-based extreme learning machine for drug-target interaction prediction
Background: Experimental verification of a drug discovery process is expensive and time-consuming. Therefore, efficiently and effectively identify drug–target interactions (DTIs) has been research focus. In present, many machine learning algorithms are used for predicting drug-target interactions. The key idea is to train the classifier using existing DTI so as to predict new or unknown DTI. However, there are various challenges such as class imbalance and parameter optimization of many classifiers that need to be solved before developing an optimal drug-target interaction model. Methods: In this paper, we propose a framework named SSELM-neg for drug-target interaction prediction, in which a screening approach was used to choose high quality negative samples and a spherical search approach is used to optimize the parameters of the extreme learning machine. Results: Results show that the performance of the proposed technique outperforms the other state-of-the-art methods in 10-fold cross-validation experiments in terms of AUC(0.986, 0.993, 0.988, 0.969 ) and AUPR(0.982, 0.991, 0.982, 0.946) for E dataset, GPCR dataset, IC dataset and NR dataset. Conclusion: Screening approach produce the high quality negative samples with the same numbers of the positive samples, which solve the class imbalance problem. Extreme learning machine was optimized by a spherical search approach in identifying DTIs. Therefore, our models achieve better performance than other state-of-the-art methods.
- 7 April 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (15) , 17922-17940
Memetic quantum optimization algorithm with levy flight for high dimension function optimization
- 7 April 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (15) , 17922-17940
Memetic quantum optimization algorithm with levy flight for high dimension function optimization
- Open Access
- 1 January 2021
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2021 (1) , 8928182
An Evolutionary Frog Leaping Algorithm for Global Optimization Problems and Applications
Shuffled frog leaping algorithm, a novel heuristic method, is inspired by the foraging behavior of the frog population, which has been designed by the shuffled process and the PSO framework. To increase the convergence speed and effectiveness, the currently improved versions are focused on the local search ability in PSO framework, which limited the development of SFLA. Therefore, we first propose a new scheme based on evolutionary strategy, which is accomplished by quantum evolution and eigenvector evolution. In this scheme, the frog leaping rule based on quantum evolution is achieved by two potential wells with the historical information for the local search, and eigenvector evolution is achieved by the eigenvector evolutionary operator for the global search. To test the performance of the proposed approach, the basic benchmark suites, CEC2013 and CEC2014, and a parameter optimization problem of SVM are used to compare 15 well‐known algorithms. Experimental results demonstrate that the performance of the proposed algorithm is better than that of the other heuristic algorithms.
- 1 January 2021
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2021 (1) , 8928182
Open AccessAn Evolutionary Frog Leaping Algorithm for Global Optimization Problems and Applications
Shuffled frog leaping algorithm, a novel heuristic method, is inspired by the foraging behavior of the frog population, which has been designed by the shuffled process and the PSO framework. To increase the convergence speed and effectiveness, the currently improved versions are focused on the local search ability in PSO framework, which limited the development of SFLA. Therefore, we first propose a new scheme based on evolutionary strategy, which is accomplished by quantum evolution and eigenvector evolution. In this scheme, the frog leaping rule based on quantum evolution is achieved by two potential wells with the historical information for the local search, and eigenvector evolution is achieved by the eigenvector evolutionary operator for the global search. To test the performance of the proposed approach, the basic benchmark suites, CEC2013 and CEC2014, and a parameter optimization problem of SVM are used to compare 15 well‐known algorithms. Experimental results demonstrate that the performance of the proposed algorithm is better than that of the other heuristic algorithms.