2018 IEEE Congress on Evolutionary Computation (CEC) 2018
DOI: 10.1109/cec.2018.8477782
|View full text |Cite
|
Sign up to set email alerts
|

Structure Selection of Polynomial NARX Models Using Two Dimensional (2D) Particle Swarms

Abstract: The present study applies a novel two-dimensional learning framework (2D-UPSO) based on particle swarms for structure selection of polynomial nonlinear auto-regressive with exogenous inputs (NARX) models. This learning approach explicitly incorporates the information about the cardinality (i.e., the number of terms) into the structure selection process. Initially, the effectiveness of the proposed approach was compared against the classical genetic algorithm (GA) based approach and it was demonstrated that the… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
10
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 11 publications
(10 citation statements)
references
References 15 publications
0
10
0
Order By: Relevance
“…In several comparative investigations [18,26], the Bayesian Information Criterion (BIC) was found to be comparatively robust among the existing information criteria. Therefore, for the remainder of the study, the cardinality corresponding to the minimum BIC is selected as the model order.…”
Section: Selection Of Subset Cardinality (Model Order Selection)mentioning
confidence: 99%
See 1 more Smart Citation
“…In several comparative investigations [18,26], the Bayesian Information Criterion (BIC) was found to be comparatively robust among the existing information criteria. Therefore, for the remainder of the study, the cardinality corresponding to the minimum BIC is selected as the model order.…”
Section: Selection Of Subset Cardinality (Model Order Selection)mentioning
confidence: 99%
“…In comparison, if GA (or any suitable algorithm) is applied directly to select term subset the search space reduces from n! to 2 n [18]. The 'iterative OFR' (iOFR) algorithm [15] uses each term in the initial term subset as a pivot to identify new, and possibly better, term subsets in the secondary search.…”
Section: Introductionmentioning
confidence: 99%
“…The proof of concept of this algorithm as an alternate method of structure selection of nonlinear systems has been reported in [38]. The present investigation significantly differs from [38] in the following aspects:…”
Section: Introductionmentioning
confidence: 81%
“…Note that the 2D-learning was originally developed by the authors for the 'feature selection' problem in machine learning [37]. The proof of concept of this algorithm as an alternate method of structure selection of nonlinear systems has been reported in [38]. The present investigation significantly differs from [38] in the following aspects:…”
Section: Introductionmentioning
confidence: 90%
“…In the first part of this investigation [25], the orthogonal floating search algorithms have been proposed to alleviate the nesting effects of the classical OFR. Subsequently, a new two-dimensional structure selection approach was developed in [52,53], which explicitly integrates the information about subset cardinality (number of terms) into a probabilistic learning framework to balance the bias-variance dilemma. These approaches have been shown to be very effective on both simulated and practical nonlinear systems.…”
Section: Introductionmentioning
confidence: 99%