SIMPD: an algorithm for generating simulated time splits for validating machine learning approaches

被引:11
作者
Landrum, Gregory A. [1 ]
Beckers, Maximilian [2 ]
Lanini, Jessica [2 ]
Schneider, Nadine [2 ]
Stiefl, Nikolaus [2 ,3 ]
Riniker, Sereina [1 ]
机构
[1] Swiss Fed Inst Technol, Dept Chem & Appl Biosci, Vladimir Prelog Weg 2, CH-8093 Zurich, Switzerland
[2] Novartis Pharm AG, Novartis Inst Biomed Res, Novartis Campus, CH-4002 Basel, Switzerland
[3] F Hoffman LaRoche AG, Grenzacherstr 124, CH-4070 Basel, Switzerland
关键词
Lead optimization; Cross-validation; Machine learning;
D O I
10.1186/s13321-023-00787-9
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Time-split cross-validation is broadly recognized as the gold standard for validating predictive models intended for use in medicinal chemistry projects. Unfortunately this type of data is not broadly available outside of large pharmaceutical research organizations. Here we introduce the SIMPD (simulated medicinal chemistry project data) algorithm to split public data sets into training and test sets that mimic the differences observed in real-world medicinal chemistry project data sets. SIMPD uses a multi-objective genetic algorithm with objectives derived from an extensive analysis of the differences between early and late compounds in more than 130 lead-optimization projects run within the Novartis Institutes for BioMedical Research. Applying SIMPD to the real-world data sets produced training/test splits which more accurately reflect the differences in properties and machine-learning performance observed for temporal splits than other standard approaches like random or neighbor splits. We applied the SIMPD algorithm to bioactivity data extracted from ChEMBL and created 99 public data sets which can be used for validating machine-learning models intended for use in the setting of a medicinal chemistry project. The SIMPD code and simulated data sets are available under open-source/open-data licenses at github.com/rinikerlab/molecular_time_series.
引用
收藏
页数:16
相关论文
共 21 条
[1]  
[Anonymous], scikit-learn Machine Learning in Python
[2]   25 Years of Small-Molecule Optimization at Novartis: A Retrospective Analysis of Chemical Series Evolution [J].
Beckers, Maximilian ;
Fechner, Nikolas ;
Stiefl, Nikolaus .
JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2022, 62 (23) :6002-6021
[3]   Evaluation guidelines for machine learning tools in the chemical sciences [J].
Bender, Andreas ;
Schneider, Nadine ;
Segler, Marwin ;
Walters, W. Patrick ;
Engkvist, Ola ;
Rodrigues, Tiago .
NATURE REVIEWS CHEMISTRY, 2022, 6 (06) :428-442
[4]   Large scale comparison of QSAR and conformal prediction methods and their applications in drug discovery [J].
Bosc, Nicolas ;
Atkinson, Francis ;
Felix, Eloy ;
Gaulton, Anna ;
Hersey, Anne ;
Leach, Andrew R. .
JOURNAL OF CHEMINFORMATICS, 2019, 11 (1)
[5]  
Breiman L, 2001, MACH LEARN, V45, P5, DOI [10.1186/s12859-018-2419-4, 10.3322/caac.21834]
[6]   Unsupervised data base clustering based on Daylight's fingerprint and Tanimoto similarity: A fast and automated way to cluster small and large data sets [J].
Butina, D .
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1999, 39 (04) :747-750
[7]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[8]   Fast calculation of molecular polar surface area as a sum of fragment-based contributions and its application to the prediction of drug transport properties [J].
Ertl, P ;
Rohde, B ;
Selzer, P .
JOURNAL OF MEDICINAL CHEMISTRY, 2000, 43 (20) :3714-3717
[9]   Estimation of synthetic accessibility score of drug-like molecules based on molecular complexity and fragment contributions [J].
Ertl, Peter ;
Schuffenhauer, Ansgar .
JOURNAL OF CHEMINFORMATICS, 2009, 1
[10]   GHOST: Adjusting the Decision Threshold to Handle Imbalanced Data in Machine Learning [J].
Esposito, Carmen ;
Landrum, Gregory A. ;
Schneider, Nadine ;
Stiefl, Nikolaus ;
Riniker, Sereina .
JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2021, 61 (06) :2623-2640