| Autor: |
Czarnecki WM; Faculty of Mathematics and Computer Science, Jagiellonian University, Lojasiewicza 6, 30-348 Krakow, Poland. wojciech.czarnecki@uj.edu.pl., Podlewska S; Institute of Pharmacology, Polish Academy of Sciences, Smetna 12, 31-343 Krakow, Poland. smusz@if-pan.krakow.pl.; Faculty of Chemistry, Jagiellonian University, Ingardena 3, 30-060 Krakow, Poland. smusz@if-pan.krakow.pl., Bojarski AJ; Institute of Pharmacology, Polish Academy of Sciences, Smetna 12, 31-343 Krakow, Poland. bojarski@if-pan.krakow.pl. |
| Jazyk: |
angličtina |
| Zdroj: |
Molecules (Basel, Switzerland) [Molecules] 2015 Nov 09; Vol. 20 (11), pp. 20107-17. Date of Electronic Publication: 2015 Nov 09. |
| DOI: |
10.3390/molecules201119679 |
| Abstrakt: |
Speed, 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. |
| Databáze: |
MEDLINE |
| Externí odkaz: |
|
