location: Current position: Li Zheng >> Scientific Research >> Paper Publications

Kriging-Based Parameter Estimation Algorithm for Metabolic Networks Combined with Single-Dimensional Optimization and Dynamic Coordinate Perturbation

Hits:

Indexed by:期刊论文

Date of Publication:2016-11-01

Journal:IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS

Included Journals:SCIE、EI

Volume:13

Issue:6

Page Number:1142-1154

ISSN No.:1545-5963

Key Words:Metabolic network; parameter estimation; Kriging model; single-dimensional optimization; dynamic coordinate perturbation

Abstract:The metabolic network model allows for an in-depth insight into the molecular mechanism of a particular organism. Because most parameters of the metabolic network cannot be directly measured, they must be estimated by using optimization algorithms. However, three characteristics of the metabolic network model, i.e., high nonlinearity, large amount parameters, and huge variation scopes of parameters, restrict the application of many traditional optimization algorithms. As a result, there is a growing demand to develop efficient optimization approaches to address this complex problem. In this paper, a Kriging-based algorithm aiming at parameter estimation is presented for constructing the metabolic networks. In the algorithm, a new infill sampling criterion, named expected improvement and mutual information (EI&MI), is adopted to improve the modeling accuracy by selecting multiple new sample points at each cycle, and the domain decomposition strategy based on the principal component analysis is introduced to save computing time. Meanwhile, the convergence speed is accelerated by combining a single-dimensional optimization method with the dynamic coordinate perturbation strategy when determining the new sample points. Finally, the algorithm is applied to the arachidonic acid metabolic network to estimate its parameters. The obtained results demonstrate the effectiveness of the proposed algorithm in getting precise parameter values under a limited number of iterations.

Pre One:基于Fluent的三维注塑充填界面追踪方法研究

Next One:Investigation on parallel algorithms in efficient global optimization based on multiple points infill criterion and domain decomposition