8
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      An ensemble‐based approach to estimate confidence of predicted protein–ligand binding affinity values

      1 , 1 , 1
      Molecular Informatics
      Wiley

      Read this article at

      ScienceOpenPublisher
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          When designing a machine learning‐based scoring function, we access a limited number of protein‐ligand complexes with experimentally determined binding affinity values, representing only a fraction of all possible protein‐ligand complexes. Consequently, it is crucial to report a measure of confidence and quantify the uncertainty in the model's predictions during test time. Here, we adopt the conformal prediction technique to evaluate the confidence of a prediction for each member of the core set of the CASF 2016 benchmark. The conformal prediction technique requires a diverse ensemble of predictors for uncertainty estimation. To this end, we introduce ENS‐Score as an ensemble predictor, which includes 30 models with different protein‐ligand representation approaches and achieves Pearson's correlation of 0.842 on the core set of the CASF 2016 benchmark. Also, we comprehensively investigate the residual error of each data point to assess the normality behavior of the distribution of the residual errors and their correlation to the structural features of the ligands, such as hydrophobic interactions and halogen bonding. In the end, we provide a local host web application to facilitate the usage of ENS‐Score. All codes to repeat results are provided at https://github.com/miladrayka/ENS_Score.

          Related collections

          Most cited references75

          • Record: found
          • Abstract: not found
          • Article: not found

          Regression Shrinkage and Selection Via the Lasso

            • Record: found
            • Abstract: not found
            • Article: not found

            Greedy function approximation: A gradient boosting machine.

              • Record: found
              • Abstract: found
              • Article: not found

              Extended-connectivity fingerprints.

              Extended-connectivity fingerprints (ECFPs) are a novel class of topological fingerprints for molecular characterization. Historically, topological fingerprints were developed for substructure and similarity searching. ECFPs were developed specifically for structure-activity modeling. ECFPs are circular fingerprints with a number of useful qualities: they can be very rapidly calculated; they are not predefined and can represent an essentially infinite number of different molecular features (including stereochemical information); their features represent the presence of particular substructures, allowing easier interpretation of analysis results; and the ECFP algorithm can be tailored to generate different types of circular fingerprints, optimized for different uses. While the use of ECFPs has been widely adopted and validated, a description of their implementation has not previously been presented in the literature.

                Author and article information

                Contributors
                (View ORCID Profile)
                (View ORCID Profile)
                (View ORCID Profile)
                Journal
                Molecular Informatics
                Molecular Informatics
                Wiley
                1868-1743
                1868-1751
                April 2024
                February 15 2024
                April 2024
                : 43
                : 4
                Affiliations
                [1 ] Applied Biotechnology Research Center Baqiyatallah University of Medical Sciences Tehran Iran
                Article
                10.1002/minf.202300292
                4e38f8a8-21f6-4e14-a915-00e42a618a65
                © 2024

                http://onlinelibrary.wiley.com/termsAndConditions#vor

                History

                Comments

                Comment on this article

                Related Documents Log