Wei Zhou
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
Wei Zhou has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Liang Feng
Chongqing University
4 shared publications - Zexuan Zhu
Shenzhen University
4 shared publications - Kay Chen Tan
The Hong Kong Polytechnic University
3 shared publications - Junkai Ji
Shenzhen University
2 shared publications - Shan He
School of Computer Science, University of Birmingham, Birmingham, U.K.
2 shared publications - Yong Liu
Huawei Technologies, Shanghai, China
2 shared publications
Latest Publications
- 6 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. PP (1089778X) , 1
Evolutionary Dynamic Multi-Objective Optimization With Learning Across Problems
Dynamic multi-objective optimization problems (DMOPs) are prevalent in many practical applications and have garnered significant attention from both industry and academia, leading to the proposal of numerous dynamic multi-objective optimization algorithms. Among these approaches, learning-and prediction-based evolutionary approaches have achieved remarkable success due to their fast learning and strong optimization capabilities when dynamic occurs. However, existing methods typically focus on learning and transferring knowledge within a single problem, often relying on historical knowledge to aid the optimization process. This could limit the data available for developing a more general prediction model for dynamic optimization. The potential for leveraging knowledge across different DMOPs to enhance problem-solving efficiency and effectiveness remains largely unexplored. Building on this insight, this paper explores the solution of DMOPs with learning not only within a single problem but also across different problems. In particular, by performing dynamic feature extraction and task-specific solution classification, we propose to construct a centralized learning model that captures the correlations across DMOPs and the corresponding optimized solutions. This approach allows optimization data from multiple problems to be effectively utilized, enabling the learning of dynamic knowledge to enhance evolutionary optimization when a change occurs. To assess the effectiveness of the proposed algorithm, extensive empirical studies have been conducted on the commonly used DMOP benchmarks with fixed and shifty dynamic settings. The numerical results demonstrate the effectiveness of the proposed algorithm in recognizing more general change patterns of DMOPs, showcasing its superiority compared to the existing state-of-the-art learning and prediction-based approaches.
- 6 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. PP (1089778X) , 1
Evolutionary Dynamic Multi-Objective Optimization With Learning Across Problems
Dynamic multi-objective optimization problems (DMOPs) are prevalent in many practical applications and have garnered significant attention from both industry and academia, leading to the proposal of numerous dynamic multi-objective optimization algorithms. Among these approaches, learning-and prediction-based evolutionary approaches have achieved remarkable success due to their fast learning and strong optimization capabilities when dynamic occurs. However, existing methods typically focus on learning and transferring knowledge within a single problem, often relying on historical knowledge to aid the optimization process. This could limit the data available for developing a more general prediction model for dynamic optimization. The potential for leveraging knowledge across different DMOPs to enhance problem-solving efficiency and effectiveness remains largely unexplored. Building on this insight, this paper explores the solution of DMOPs with learning not only within a single problem but also across different problems. In particular, by performing dynamic feature extraction and task-specific solution classification, we propose to construct a centralized learning model that captures the correlations across DMOPs and the corresponding optimized solutions. This approach allows optimization data from multiple problems to be effectively utilized, enabling the learning of dynamic knowledge to enhance evolutionary optimization when a change occurs. To assess the effectiveness of the proposed algorithm, extensive empirical studies have been conducted on the commonly used DMOP benchmarks with fixed and shifty dynamic settings. The numerical results demonstrate the effectiveness of the proposed algorithm in recognizing more general change patterns of DMOPs, showcasing its superiority compared to the existing state-of-the-art learning and prediction-based approaches.
- 26 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 29 (3) , 676-696
A Survey on Evolutionary Computation-Based Drug Discovery
Drug discovery is an expensive and risky process. To combat the challenges in drug discovery, an increasing number of researchers and pharmaceutical companies recognize the benefits of utilizing computational techniques. Evolutionary computation (EC) offers promise as most drug discovery problems are essentially complex optimization problems beyond conventional optimization algorithms. EC methods have been widely applied to solve these complex optimization problems especially in lead com-pound generation and molecular virtual evaluation, substantially speeding up the process of drug discovery and development. This article presents a comprehensive survey of EC-based drug discovery methods. Particularly, a new taxonomy of the methods is provided and the advantages and limitations of the methods are reviewed. In addition, the potential future directions of EC-based drug discovery are discussed and the publicly available resources including databases and computational tools are compiled for the convenience of researchers seeking to pursue this field.
- 26 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 29 (3) , 676-696
A Survey on Evolutionary Computation-Based Drug Discovery
Drug discovery is an expensive and risky process. To combat the challenges in drug discovery, an increasing number of researchers and pharmaceutical companies recognize the benefits of utilizing computational techniques. Evolutionary computation (EC) offers promise as most drug discovery problems are essentially complex optimization problems beyond conventional optimization algorithms. EC methods have been widely applied to solve these complex optimization problems especially in lead com-pound generation and molecular virtual evaluation, substantially speeding up the process of drug discovery and development. This article presents a comprehensive survey of EC-based drug discovery methods. Particularly, a new taxonomy of the methods is provided and the advantages and limitations of the methods are reviewed. In addition, the potential future directions of EC-based drug discovery are discussed and the publicly available resources including databases and computational tools are compiled for the convenience of researchers seeking to pursue this field.
- 26 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 29 (3) , 1714-1725
MDTL-ACP: Anticancer Peptides Prediction Based on Multi-Domain Transfer Learning
Anticancer peptides (ACPs) have emerged as one of the most promising therapeutic agents for cancer treatment. They are bioactive peptides featuring broad-spectrum activity and low drug-resistance. The discovery of ACPs via traditional biochemical methods is laborious and costly. Accordingly, various computational methods have been developed to facilitate the discovery of ACPs. However, the data resources and knowledge of ACPs are still very scarce, and only a few of them are clinically verified, which limits the competence of computational methods. To address this issue, in this paper, we propose an ACP prediction model based on multi-domain transfer learning, namely MDTL-ACP, to discriminate novel ACPs from plentiful inactive peptides. In particular, we collect abundant antimicrobial peptides (AMPs) from four well-studied peptide domains and extract their inherent features as the input of MDTL-ACP. The features learned from multiple source domains of AMPs are then transferred into the target prediction task of ACPs via artificial neural network-based shared-extractor and task-specific classifiers in MDTL-ACP. The knowledge captured in the transferred features enhances the prediction of ACPs in the target domain. Experimental results demonstrate that MDTL-ACP can outperform the traditional and state-of-the-art ACP prediction methods. The source code of MDTL-ACP and the data used in this study are available at https://github.com/JunhangCao/MTL-ACP .
- 26 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 29 (3) , 1714-1725
MDTL-ACP: Anticancer Peptides Prediction Based on Multi-Domain Transfer Learning
Anticancer peptides (ACPs) have emerged as one of the most promising therapeutic agents for cancer treatment. They are bioactive peptides featuring broad-spectrum activity and low drug-resistance. The discovery of ACPs via traditional biochemical methods is laborious and costly. Accordingly, various computational methods have been developed to facilitate the discovery of ACPs. However, the data resources and knowledge of ACPs are still very scarce, and only a few of them are clinically verified, which limits the competence of computational methods. To address this issue, in this paper, we propose an ACP prediction model based on multi-domain transfer learning, namely MDTL-ACP, to discriminate novel ACPs from plentiful inactive peptides. In particular, we collect abundant antimicrobial peptides (AMPs) from four well-studied peptide domains and extract their inherent features as the input of MDTL-ACP. The features learned from multiple source domains of AMPs are then transferred into the target prediction task of ACPs via artificial neural network-based shared-extractor and task-specific classifiers in MDTL-ACP. The knowledge captured in the transferred features enhances the prediction of ACPs in the target domain. Experimental results demonstrate that MDTL-ACP can outperform the traditional and state-of-the-art ACP prediction methods. The source code of MDTL-ACP and the data used in this study are available at https://github.com/JunhangCao/MTL-ACP .
- 14 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 7 (4) , 1228-1241
Dynamic Multi-Objective Optimization Framework With Interactive Evolution for Sequential Recommendation
In contrast to traditional recommender systems which usually pay attention to users' general and long-term preferences, sequential recommendation (SR) can model users' dynamic intents based on their behaviour sequences and suggest the next item(s) to them. However, most of existing sequential models learn the ranking score of an item only based on its relevance property, and the personalized user demands in terms of different learning objectives, such as diversity, tail novelty or recency, which have been played essential roles in multi-objective recommendation (MOR), are often neglected in SR. In this paper, we first discuss the importance of considering multiple different objectives within a learning model for recommender system. Next, to capture users' objective-level preferences by utilizing interactive information in the sequential context, we propose a novel Dynamic Multi-objective Recommendation (DMORec) framework with interactive evolution for SR. In particular, DMORec formulates a dynamic multi-objective optimization task to simultaneously optimize more than two varying objectives in an interactive recommendation process. Moreover, to resolve this optimization task in SR, we develop an evolutionary algorithm with supervised learning approach to obtain the Pareto-optimal solutions of the formulated problem. Comprehensive experiments on four real-world datasets demonstrate the effectiveness of the proposed DMORec for dynamic multi-objective recommendation in sequential recommender systems.
- 14 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 7 (4) , 1228-1241
Dynamic Multi-Objective Optimization Framework With Interactive Evolution for Sequential Recommendation
In contrast to traditional recommender systems which usually pay attention to users' general and long-term preferences, sequential recommendation (SR) can model users' dynamic intents based on their behaviour sequences and suggest the next item(s) to them. However, most of existing sequential models learn the ranking score of an item only based on its relevance property, and the personalized user demands in terms of different learning objectives, such as diversity, tail novelty or recency, which have been played essential roles in multi-objective recommendation (MOR), are often neglected in SR. In this paper, we first discuss the importance of considering multiple different objectives within a learning model for recommender system. Next, to capture users' objective-level preferences by utilizing interactive information in the sequential context, we propose a novel Dynamic Multi-objective Recommendation (DMORec) framework with interactive evolution for SR. In particular, DMORec formulates a dynamic multi-objective optimization task to simultaneously optimize more than two varying objectives in an interactive recommendation process. Moreover, to resolve this optimization task in SR, we develop an evolutionary algorithm with supervised learning approach to obtain the Pareto-optimal solutions of the formulated problem. Comprehensive experiments on four real-world datasets demonstrate the effectiveness of the proposed DMORec for dynamic multi-objective recommendation in sequential recommender systems.
- 14 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 26 (5) , 911-925
Evolutionary Search With Multiview Prediction for Dynamic Multiobjective Optimization
Dynamic multiobjective optimization problem (DMOP) denotes the multiobjective optimization problem which varies over time. As changes in DMOP may exist some patterns that are predictable, to solve DMOP, a number of research efforts have been made to develop evolutionary search with prediction approaches to estimate the changes of the problem. A common practice of existing prediction approaches is to predict the change of Pareto-optimal solutions (POS) based on the historical solutions obtained in the decision space. However, the change of a DMOP may occur in both decision and objective spaces. Prediction only in the decision space thus may not be able to give the proper estimation of the problem change. Taking this cue, in this article, we propose an evolutionary search with multiview prediction for solving DMOP. In contrast to existing prediction methods, the proposed approach conducts prediction from the views of both decision and objective spaces. To estimate dynamic changes in DMOP, a kernelized autoencoding model is derived to perform the multiview prediction in a reproducing kernel Hilbert space (RKHS), which holds a closed-form solution. To examine the performance of the proposed method, comprehensive empirical studies on the commonly used DMOP benchmarks, as well as a real-world case study on the movie recommendation problem, are presented. The obtained experimental results verified the efficacy of the proposed method for solving both benchmark and real-world DMOPs.
- 14 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 26 (5) , 911-925
Evolutionary Search With Multiview Prediction for Dynamic Multiobjective Optimization
Dynamic multiobjective optimization problem (DMOP) denotes the multiobjective optimization problem which varies over time. As changes in DMOP may exist some patterns that are predictable, to solve DMOP, a number of research efforts have been made to develop evolutionary search with prediction approaches to estimate the changes of the problem. A common practice of existing prediction approaches is to predict the change of Pareto-optimal solutions (POS) based on the historical solutions obtained in the decision space. However, the change of a DMOP may occur in both decision and objective spaces. Prediction only in the decision space thus may not be able to give the proper estimation of the problem change. Taking this cue, in this article, we propose an evolutionary search with multiview prediction for solving DMOP. In contrast to existing prediction methods, the proposed approach conducts prediction from the views of both decision and objective spaces. To estimate dynamic changes in DMOP, a kernelized autoencoding model is derived to perform the multiview prediction in a reproducing kernel Hilbert space (RKHS), which holds a closed-form solution. To examine the performance of the proposed method, comprehensive empirical studies on the commonly used DMOP benchmarks, as well as a real-world case study on the movie recommendation problem, are presented. The obtained experimental results verified the efficacy of the proposed method for solving both benchmark and real-world DMOPs.
- Top Cited Papers
- 1 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 52 (5) , 2649-2662
Solving Dynamic Multiobjective Problem via Autoencoding Evolutionary Search
Dynamic multiobjective optimization problem (DMOP) denotes the multiobjective optimization problem, which contains objectives that may vary over time. Due to the widespread applications of DMOP existed in reality, DMOP has attracted much research attention in the last decade. In this article, we propose to solve DMOPs via an autoencoding evolutionary search. In particular, for tracking the dynamic changes of a given DMOP, an autoencoder is derived to predict the moving of the Pareto-optimal solutions based on the nondominated solutions obtained before the dynamic occurs. This autoencoder can be easily integrated into the existing multiobjective evolutionary algorithms (EAs), for example, NSGA-II, MOEA/D, etc., for solving DMOP. In contrast to the existing approaches, the proposed prediction method holds a closed-form solution, which thus will not bring much computational burden in the iterative evolutionary search process. Furthermore, the proposed prediction of dynamic change is automatically learned from the nondominated solutions found along the dynamic optimization process, which could provide more accurate Pareto-optimal solution prediction. To investigate the performance of the proposed autoencoding evolutionary search for solving DMOP, comprehensive empirical studies have been conducted by comparing three state-of-the-art prediction-based dynamic multiobjective EAs. The results obtained on the commonly used DMOP benchmarks confirmed the efficacy of the proposed method.
- 1 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 52 (5) , 2649-2662
Top Cited PapersSolving Dynamic Multiobjective Problem via Autoencoding Evolutionary Search
Dynamic multiobjective optimization problem (DMOP) denotes the multiobjective optimization problem, which contains objectives that may vary over time. Due to the widespread applications of DMOP existed in reality, DMOP has attracted much research attention in the last decade. In this article, we propose to solve DMOPs via an autoencoding evolutionary search. In particular, for tracking the dynamic changes of a given DMOP, an autoencoder is derived to predict the moving of the Pareto-optimal solutions based on the nondominated solutions obtained before the dynamic occurs. This autoencoder can be easily integrated into the existing multiobjective evolutionary algorithms (EAs), for example, NSGA-II, MOEA/D, etc., for solving DMOP. In contrast to the existing approaches, the proposed prediction method holds a closed-form solution, which thus will not bring much computational burden in the iterative evolutionary search process. Furthermore, the proposed prediction of dynamic change is automatically learned from the nondominated solutions found along the dynamic optimization process, which could provide more accurate Pareto-optimal solution prediction. To investigate the performance of the proposed autoencoding evolutionary search for solving DMOP, comprehensive empirical studies have been conducted by comparing three state-of-the-art prediction-based dynamic multiobjective EAs. The results obtained on the commonly used DMOP benchmarks confirmed the efficacy of the proposed method.
- 24 October 2011
- Published by Trans Tech Publications, Ltd. in Advanced Materials Research
- Vol. 368-373, 3797-3800
Research into the Building Information Model during the Whole Building Life-Cycle
Construction project life-cycle management should be based on the visualization of a virtual building, through the establishment of a Building Information Model in the phase of architectural design as a life-cycle information carrier to realize complete information integration. This enables all phases and territories of the whole building life-cycle to achieve in-time information-sharing so as to overcome traditional territory management pattern. This also improves the running mode and information management during the phases of design, costing, construction and operation.
- 24 October 2011
- Published by Trans Tech Publications, Ltd. in Advanced Materials Research
- Vol. 368-373, 3797-3800
Research into the Building Information Model during the Whole Building Life-Cycle
Construction project life-cycle management should be based on the visualization of a virtual building, through the establishment of a Building Information Model in the phase of architectural design as a life-cycle information carrier to realize complete information integration. This enables all phases and territories of the whole building life-cycle to achieve in-time information-sharing so as to overcome traditional territory management pattern. This also improves the running mode and information management during the phases of design, costing, construction and operation.