Retention Time Prediction with Message-Passing Neural Networks

被引:20
|
作者
Osipenko, Sergey [1 ]
Nikolaev, Eugene [1 ]
Kostyukevich, Yury [1 ]
机构
[1] Skolkovo Inst Sci & Technol, Ctr Computat & Data Intens Sci & Engn, Nobel Str 3, Moscow 121205, Russia
关键词
retention time prediction; untargeted metabolomics; small molecules; message-passing neural networks; DIFFERENT GRADIENTS; FLOW-RATES; IDENTIFICATION; PERFORMANCE;
D O I
10.3390/separations9100291
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
Retention time prediction, facilitated by advances in machine learning, has become a useful tool in untargeted LC-MS applications. State-of-the-art approaches include graph neural networks and 1D-convolutional neural networks that are trained on the METLIN small molecule retention time dataset (SMRT). These approaches demonstrate accurate predictions comparable with the experimental error for the training set. The weak point of retention time prediction approaches is the transfer of predictions to various systems. The accuracy of this step depends both on the method of mapping and on the accuracy of the general model trained on SMRT. Therefore, improvements to both parts of prediction workflows may lead to improved compound annotations. Here, we evaluate capabilities of message-passing neural networks (MPNN) that have demonstrated outstanding performance on many chemical tasks to accurately predict retention times. The model was initially trained on SMRT, providing mean and median absolute cross-validation errors of 32 and 16 s, respectively. The pretrained MPNN was further fine-tuned on five publicly available small reversed-phase retention sets in a transfer learning mode and demonstrated up to 30% improvement of prediction accuracy for these sets compared with the state-of-the-art methods. We demonstrated that filtering isomeric candidates by predicted retention with the thresholds obtained from ROC curves eliminates up to 50% of false identities.
引用
收藏
页数:9
相关论文
共 50 条
  • [41] Ordered subsets message-passing
    O'Sullivan, JA
    Singla, N
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 349 - 349
  • [42] Message-passing environments for metacomputing
    Brune, MA
    Fagg, GE
    Resch, MM
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 1999, 15 (5-6): : 699 - 712
  • [43] A message-passing algorithm with damping
    Pretti, M
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2005, : 165 - 179
  • [44] Convolutional Approximate Message-Passing
    Takeuchi, Keigo
    IEEE SIGNAL PROCESSING LETTERS, 2020, 27 (27) : 416 - 420
  • [45] AN OVERVIEW OF MESSAGE-PASSING ENVIRONMENTS
    MCBRYAN, OA
    PARALLEL COMPUTING, 1994, 20 (04) : 417 - 444
  • [46] Probabilistic Message-Passing Control
    Herzallah, Randa
    Lowe, David
    Qarout, Yazan
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2022, 52 (07): : 4470 - 4482
  • [47] THE NX MESSAGE-PASSING INTERFACE
    PIERCE, P
    PARALLEL COMPUTING, 1994, 20 (04) : 463 - 480
  • [48] A CHARACTERIZATION OF ASYNCHRONOUS MESSAGE-PASSING
    GOREGAOKAR, SR
    ARUNKUMAR, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 241 : 270 - 287
  • [49] An evaluation of the message-passing interface
    Hansen, PB
    ACM SIGPLAN NOTICES, 1998, 33 (03) : 65 - 72
  • [50] MESSAGE-PASSING FOR MOTIF FINDING
    Lee, Sang Hyun
    Vikalo, Haris
    Vishwanath, Sriram
    2009 IEEE INTERNATIONAL WORKSHOP ON GENOMIC SIGNAL PROCESSING AND STATISTICS (GENSIPS 2009), 2009, : 150 - 153