2015
DOI: 10.1186/1471-2105-16-s4-s8
|View full text |Cite
|
Sign up to set email alerts
|

BgN-Score and BsN-Score: Bagging and boosting based ensemble neural networks scoring functions for accurate binding affinity prediction of protein-ligand complexes

Abstract: BackgroundAccurately predicting the binding affinities of large sets of protein-ligand complexes is a key challenge in computational biomolecular science, with applications in drug discovery, chemical biology, and structural biology. Since a scoring function (SF) is used to score, rank, and identify drug leads, the fidelity with which it predicts the affinity of a ligand candidate for a protein's binding site has a significant bearing on the accuracy of virtual screening. Despite intense efforts in developing … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
43
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 54 publications
(43 citation statements)
references
References 45 publications
(59 reference statements)
0
43
0
Order By: Relevance
“…Inspired by the outstanding performance of ensemble learning methods such as RF and boosted regression trees in a previous assessment study, Ashtawy and Mahapatra also proposed two ensemble NN‐based SFs based on bagging (BgN‐Score) and boosting (BsN‐Score). To make a better comparison, the same combinations of the features used in the previous assessment were used in this study.…”
Section: Traditional Machine Learning Methods In Scoring Functionsmentioning
confidence: 99%
“…Inspired by the outstanding performance of ensemble learning methods such as RF and boosted regression trees in a previous assessment study, Ashtawy and Mahapatra also proposed two ensemble NN‐based SFs based on bagging (BgN‐Score) and boosting (BsN‐Score). To make a better comparison, the same combinations of the features used in the previous assessment were used in this study.…”
Section: Traditional Machine Learning Methods In Scoring Functionsmentioning
confidence: 99%
“…The performance of the scoring functions was evaluated with RMSE, Pearson’s correlation coefficient (Rp), and Spearman’s rank correlation coefficient (Rs) between the predicted and measured binding affinities, because these are widely used to evaluate scoring functions [ 35 , 51 , 52 ]. RMSE represents the differences between the predicted and measured binding affinity values.…”
Section: Methodsmentioning
confidence: 99%
“…Machine learning methods at varying levels of sophistication have long been considered in the context of structure-based virtual screening [39,31,32,[40][41][42][43][44][45][46]29,[47][48][49][50][51][52][53][54]. The vast majority of such studies sought to train a regression model that would recapitulate the binding affinities of known complexes, and thus provide a natural and intuitive replacement for traditional scoring functions [31,32,[41][42][43][44][45][46]29,47,49,[51][52][53][54]. The downside of such a strategy, however, is that the resulting models are not ever exposed to any inactive complexes in the course of training: this is especially important in the context of docked complexes arising from virtual screening, where most compounds in the library are presumably inactive.…”
Section: Developing a Challenging Training Setmentioning
confidence: 99%