Accelerating the parameters identifiability procedure: Set by set selection

被引：10

作者：

Alberton, Kese P. F. ^{[1
]}

Alberton, Andre Luis ^{[2
]}

Di Maggio, Jimena Andrea ^{[3
]}

Diaz, Maria Soledad ^{[3
]}

Secchi, Argimiro R. ^{[1
]}

机构：

[1] Univ Fed Rio de Janeiro, COPPE, Programa Engn Quim, BR-21941972 Rio De Janeiro, RJ, Brazil

[2] Univ Estado Rio De Janeiro, Inst Quim, BR-20550900 Rio De Janeiro, RJ, Brazil

[3] Univ Nacl Sur, Planta Piloto Ingn Quim CONICET, RA-8000 Bahia Blanca, Buenos Aires, Argentina

来源：

COMPUTERS & CHEMICAL ENGINEERING | 2013年 / 55卷

关键词：

Parameters identifiability; Binary search; Parameters estimation; Scarce experimental data; MODEL; COPOLYMERIZATION; BEHAVIOR;

D O I：

10.1016/j.compchemeng.2013.04.014

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper, a numerical procedure based on the binary search is proposed for accelerating the parameters identifiability procedure. Basically, the parameters are selected set by set using a given criterion for ranking the parameters. Since parameters identifiability procedures are strongly dependent on the initial estimates of parameters values, simultaneous parameters re-estimation step has been proposed in this paper. Two examples were used to evaluate the performance of the proposed criterion. In both cases, a significant reduction of the computational time was observed, and the results regard to the model fit are similar to those criteria based on the selection of parameters one by one, as usually presented in the literature. (C) 2013 Elsevier Ltd. All rights reserved.

引用

页码：181 / 197

页数：17

共 50 条

[41] Accelerating large character set recognition using pivots
Yang, YP
Velek, O
Nakagawa, M
SEVENTH INTERNATIONAL CONFERENCE ON DOCUMENT ANALYSIS AND RECOGNITION, VOLS I AND II, PROCEEDINGS, 2003, : 262 - 267
[42] Accelerating Local Search for the Maximum Independent Set Problem
Dahlum, Jakob
Lamm, Sebastian
Sanders, Peter
Schulz, Christian
Strash, Darren
Werneck, Renato F.
EXPERIMENTAL ALGORITHMS, SEA 2016, 2016, 9685 : 118 - 133
[43] A Constrained Optimization Approach to Set the Parameters of Probabilistic Answer Set Programs
Azzolini, Damiano
INDUCTIVE LOGIC PROGRAMMING, ILP 2023, 2023, 14363 : 1 - 15
[44] Novel link set dimensioning procedure for networks supporting the load splitting link selection algorithm
Wang, Jonathan L.
Proceedings - IEEE INFOCOM, 1993, 3 : 1280 - 1287
[45] Generalization of a parameter set selection procedure based on orthogonal projections and the D-optimality criterion
Chu, Yunfei
Hahn, Juergen
AICHE JOURNAL, 2012, 58 (07) : 2085 - 2096
[46] Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems
Ravelo, Santiago, V
Meneses, Claudio N.
COMPUTERS & OPERATIONS RESEARCH, 2021, 135
[47] Network parameters and heuristics in practice: a case study using the target set selection problem
Lowcay, Callum
Marsland, Stephen
McCartin, Catherine
JOURNAL OF COMPLEX NETWORKS, 2014, 2 (04) : 373 - 393
[48] An optimal representative set selection method
Lee, JG
Chung, CG
INFORMATION AND SOFTWARE TECHNOLOGY, 2000, 42 (01) : 17 - 25
[49] Self basis selection in a finite set
Llani, I
Zamir, R
2004 23RD IEEE CONVENTION OF ELECTRICAL AND ELECTRONICS ENGINEERS IN ISRAEL, PROCEEDINGS, 2004, : 102 - 105
[50] Unit selection without a phoneme set
Black, AW
Llitjós, AF
PROCEEDINGS OF THE 2002 IEEE WORKSHOP ON SPEECH SYNTHESIS, 2002, : 207 - 210

← 1 2 3 4 5 →