Greedy and Linear Ensembles of Machine Learning Methods Outperform Single Approaches for QSPR Regression Problems. Issue 9 (25th March 2015)

• Record Type: Journal Article
• Authors: Kew, William; Mitchell, John B. O.
• Is Part Of: Molecular informatics. Volume 34:Issue 9(2015:Sep.)
• Page Start: 634
• Page End: 647
• Publication Date: 2015-03-25
• Subjects: Cheminformatics -- Periodicals; QSAR (Biochemistry) -- Periodicals; Structure-activity relationships (Biochemistry) -- Periodicals; Drugs -- Structure-activity relationships -- Periodicals; 615.19
• DOI: 10.1002/minf.201400122
• Languages: English
• ISSNs: 1868-1743

Abstract

<abstract abstract-type="main" xml:lang="en"> <title>Abstract</title> <p>The application of Machine Learning to cheminformatics is a large and active field of research, but there exist few papers which discuss whether ensembles of different Machine Learning methods can improve upon the performance of their component methodologies. Here we investigated a variety of methods, including kernel‐based, tree, linear, neural networks, and both greedy and linear ensemble methods. These were all tested against a standardised methodology for regression with data relevant to the pharmaceutical development process. This investigation focused on QSPR problems within drug‐like chemical space. We aimed to investigate which methods perform best, and how the 'wisdom of crowds' principle can be applied to ensemble predictors. It was found that no single method performs best for all problems, but that a dynamic, well‐structured ensemble predictor would perform very well across the board, usually providing an improvement in performance over the best single method. Its use of weighting factors allows the greedy ensemble to acquire a bigger contribution from the better performing models, and this helps the greedy ensemble generally to outperform the simpler linear ensemble. Choice of data preprocessing methodology was found to be crucial to performance of each method too.</p> </abstract>