1. Estimating the domain of applicability for machine learning QSAR models: a study on aqueous solubility of drug discovery molecules
- Author
-
Antonius Ter Laak, Nikolaus Heinrich, Timon Schroeter, Klaus-Robert Müller, Sebastian Mika, Detlev Suelzle, Ursula Ganzer, Anton Schwaighofer, and Publica
- Subjects
Quantitative structure–activity relationship ,Computer science ,Decision tree ,Quantitative Structure-Activity Relationship ,Machine learning ,computer.software_genre ,Bayesian inference ,Set (abstract data type) ,symbols.namesake ,Artificial Intelligence ,Drug Discovery ,Physical and Theoretical Chemistry ,Gaussian process ,Mahalanobis distance ,Models, Statistical ,Molecular Structure ,business.industry ,Water ,Bayes Theorem ,Random forest ,Computer Science Applications ,Support vector machine ,Models, Chemical ,Pharmaceutical Preparations ,Solubility ,Drug Design ,symbols ,Artificial intelligence ,business ,computer ,Algorithms - Abstract
We investigate the use of different Machine Learning methods to construct models for aqueous solubility. Models are based on about 4000 compounds, including an in-house set of 632 drug discovery molecules of Bayer Schering Pharma. For each method, we also consider an appropriate method to obtain error bars, in order to estimate the domain of applicability (DOA) for each model. Here, we investigate error bars from a Bayesian model (Gaussian Process (GP)), an ensemble based approach (Random Forest), and approaches based on the Mahalanobis distance to training data (for Support Vector Machine and Ridge Regression models). We evaluate all approaches in terms of their prediction accuracy (in cross-validation, and on an external validation set of 536 molecules) and in how far the individual error bars can faithfully represent the actual prediction error.
- Published
- 2007