Zhong-Kai Hao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zhong-Kai Hao has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Chengqiang Lu
Xiaohongshu Inc., China
1 shared publication - Enhong Chen
University of Science and Technology of China
1 shared publication - Jian-Fu Zhu
Anhui Province Key Laboratory of Big Data Analysis and Application, School of Computer Science and Technology, University of Science and Technology of China, Hefei, China
1 shared publication - Qi Liu
University of Science and Technology of China
1 shared publication - Yu Yin
University of Science and Technology of China, Hefei, China
1 shared publication - Zhenya Huang
State Key Laboratory of Cognitive Intelligence, University of Science and Technology of China, Hefei, China and Institute of Artificial Intelligence, Hefei Comprehensive National Science Center, Hefei, China
1 shared publication
Latest Publications
- 30 November 2022
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 37 (6) , 1464-1477
Towards Exploring Large Molecular Space: An Efficient Chemical Genetic Algorithm
Generating molecules with desired properties is an important task in chemistry and pharmacy. An efficient method may have a positive impact on finding drugs to treat diseases like COVID-19. Data mining and artificial intelligence may be good ways to find an efficient method. Recently, both the generative models based on deep learning and the work based on genetic algorithms have made some progress in generating molecules and optimizing the molecule's properties. However, existing methods need to be improved in efficiency and performance. To solve these problems, we propose a method named the Chemical Genetic Algorithm for Large Molecular Space (CALM). Specifically, CALM employs a scalable and efficient molecular representation called molecular matrix. Then, we design corresponding crossover, mutation, and mask operators inspired by domain knowledge and previous studies. We apply our genetic algorithm to several tasks related to molecular property optimization and constraint molecular optimization. The results of these tasks show that our approach outperforms the other state-of-the-art deep learning and genetic algorithm methods, where the z tests performed on the results of several experiments show that our method is more than 99% likely to be significant. At the same time, based on the experimental results, we point out the insufficiency in the experimental evaluation standard which affects the fair evaluation of previous work.
- 30 November 2022
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 37 (6) , 1464-1477
Towards Exploring Large Molecular Space: An Efficient Chemical Genetic Algorithm
Generating molecules with desired properties is an important task in chemistry and pharmacy. An efficient method may have a positive impact on finding drugs to treat diseases like COVID-19. Data mining and artificial intelligence may be good ways to find an efficient method. Recently, both the generative models based on deep learning and the work based on genetic algorithms have made some progress in generating molecules and optimizing the molecule's properties. However, existing methods need to be improved in efficiency and performance. To solve these problems, we propose a method named the Chemical Genetic Algorithm for Large Molecular Space (CALM). Specifically, CALM employs a scalable and efficient molecular representation called molecular matrix. Then, we design corresponding crossover, mutation, and mask operators inspired by domain knowledge and previous studies. We apply our genetic algorithm to several tasks related to molecular property optimization and constraint molecular optimization. The results of these tasks show that our approach outperforms the other state-of-the-art deep learning and genetic algorithm methods, where the z tests performed on the results of several experiments show that our method is more than 99% likely to be significant. At the same time, based on the experimental results, we point out the insufficiency in the experimental evaluation standard which affects the fair evaluation of previous work.