Extremely Randomized Machine Learning Methods for Compound Activity Prediction
AbstractSpeed, a relatively low requirement for computational resources and high effectiveness of the evaluation of the bioactivity of compounds have caused a rapid growth of interest in the application of machine learning methods to virtual screening tasks. However, due to the growth of the amount of data also in cheminformatics and related fields, the aim of research has shifted not only towards the development of algorithms of high predictive power but also towards the simplification of previously existing methods to obtain results more quickly. In the study, we tested two approaches belonging to the group of so-called ‘extremely randomized methods’—Extreme Entropy Machine and Extremely Randomized Trees—for their ability to properly identify compounds that have activity towards particular protein targets. These methods were compared with their ‘non-extreme’ competitors, i.e., Support Vector Machine and Random Forest. The extreme approaches were not only found out to improve the efficiency of the classification of bioactive compounds, but they were also proved to be less computationally complex, requiring fewer steps to perform an optimization procedure. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Czarnecki, W.M.; Podlewska, S.; Bojarski, A.J. Extremely Randomized Machine Learning Methods for Compound Activity Prediction. Molecules 2015, 20, 20107-20117.
Czarnecki WM, Podlewska S, Bojarski AJ. Extremely Randomized Machine Learning Methods for Compound Activity Prediction. Molecules. 2015; 20(11):20107-20117.Chicago/Turabian Style
Czarnecki, Wojciech M.; Podlewska, Sabina; Bojarski, Andrzej J. 2015. "Extremely Randomized Machine Learning Methods for Compound Activity Prediction." Molecules 20, no. 11: 20107-20117.