Prediction of peptide bonding affinity: kernel methods for nonlinear modeling

08/26/2011
by   Charles Bergeron, et al.
0

This paper presents regression models obtained from a process of blind prediction of peptide binding affinity from provided descriptors for several distinct datasets as part of the 2006 Comparative Evaluation of Prediction Algorithms (COEPRA) contest. This paper finds that kernel partial least squares, a nonlinear partial least squares (PLS) algorithm, outperforms PLS, and that the incorporation of transferable atom equivalent features improves predictive capability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/15/2023

Kernel partial least squares regression for functional nonlinear models

Functional regression is very crucial in functional data analysis and a ...
research
07/06/2022

Deep Partial Least Squares for IV Regression

In this paper, we propose deep partial least squares for the estimation ...
research
03/30/2023

A Note On Nonlinear Regression Under L2 Loss

We investigate the nonlinear regression problem under L2 loss (square lo...
research
07/31/2012

Learning a peptide-protein binding affinity predictor with kernel ridge regression

We propose a specialized string kernel for small bio-molecules, peptides...
research
12/27/2019

Nonlinear Markov Clustering by Minimum Curvilinear Sparse Similarity

The development of algorithms for unsupervised pattern recognition by no...
research
06/02/2023

Predicting affinity ties in a surname network

From administrative registers of last names in Santiago, Chile, we creat...

Please sign up or login with your details

Forgot password? Click here to reset