Ве молиме користете го овој идентификатор да го цитирате или поврзете овој запис:
http://hdl.handle.net/20.500.12188/30395
Наслов: | Hyperparameter Optimization of Graph Neural Networks for mRNA Degradation Prediction | Authors: | Vodilovska, Viktorija Gievska, Sonja Ivanoska, Ilinka |
Keywords: | Hyperparameter Optimization , Random Search , Bayesian search , Hill Climbing , Simulated Annealing , Genetic Algorithm , Artificial Bee Colony , Particle Swarm Optimization , GCN , GAT , mRNA degradation , mRNA vaccines | Issue Date: | 22-мај-2023 | Publisher: | IEEE | Conference: | 2023 46th MIPRO ICT and Electronics Convention (MIPRO) | Abstract: | Graph Neural Networks (GNN) emerged as increasingly attractive deep learning models for complex data, making them extremely useful in biochemical and pharmaceutical domains. However, building a good-performing GNN requires lots of parameter choices and Hyperparameter optimization (HPO) can aid in exploring solutions. This study presents a comparative analysis of several strategies for Hyperparameter optimization of GNNs. The explored optimization techniques include complex algorithms such as the bio-inspired Genetic Algorithm, Particle Swarm Optimization, and Artificial Bee Colony. In addition, Hill Climb and Simulated Annealing as well as the commonly used methods Random Search and Bayesian Search have also been covered. The proposed optimization algorithms have been evaluated on improving the performance of the GNN architectures developed for predicting mRNA degradation. The Stanford OpenVaccine dataset for mRNA degradation prediction has been used for training and testing the predictive models. Finding mRNA molecules with low degradation rates is important in development of mRNA vaccines for diseases such as COVID-19 and we hope to benefit research on ML in this domain. According to the analysis’s findings, Simulated Annealing algorithm outperforms other algorithms on both architectures. Furthermore, population based algorithms like Particle Swarm optimization show promising results, with certain limitations related to the complexity of the algorithms which encourages further exploration of the subject. | URI: | http://hdl.handle.net/20.500.12188/30395 |
Appears in Collections: | Faculty of Computer Science and Engineering: Conference papers |
Прикажи целосна запис
Записите во DSpace се заштитени со авторски права, со сите права задржани, освен ако не е поинаку наведено.