Abstract

The new method for parameterising a high number of observed curves in terms of nonlinear functions, presented by Isaeva et al. is here applied to noisy data and tested with respect to computational speed, ease of use and estimation precision. The method employs conventional least squares minimisation of the lack-of-fit residuals. But algorithmically it replaces traditional, time-consuming iterative hill-climbing (e.g., simplex optimisation) by a fast, non-iterative linear projection. Each nonlinear function is emulated by its multivariate metamodel (a low-dimensional bi-linear principal component analysis model of its behaviour), and yields parameter estimates by a simple projection plus a data base look-up.For setting up a generic, fast modelling system for line curvature, a set of 38 widely different mathematical functions - most of them nonlinear - were selected for their ability to give sigmoid curves. For each model, its behavioural repertoire was established by designed computer simulation, and its multivariate metamodel was estimated. Then the new curve fitting approach was compared to conventional simplex optimisation, by fitting artificial, but noisy curves to the 38 curve-functions, in order to identify the correct function type and parameter values. Finally, the new method was adapted to heteroscedastic noise and employed for parameterisation of >170,000 sigmoid curves from time lapse monitoring of proteomic 2D Gel Electrophoresis (2DGE) image development.The new method gave at least as precise parameter estimates as the simplex optimisation and worked well both for homoscedastic and heteroscedastic noise. It speeded up the parameter estimation in the nonlinear models by a factor of about 24 compared to the simplex optimisation.Moreover, per definition it avoids the problems of having to select starting values and ending up in locally optimal solutions. And it reduced the problem of subjective, possibly erroneous choice of nonlinear model specification.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.