2016
DOI: 10.1007/s00170-016-8987-4
|View full text |Cite
|
Sign up to set email alerts
|

Kernel principal component analysis with reduced complexity for nonlinear dynamic process monitoring

Abstract: This paper proposes a new reduced kernel method for monitoring nonlinear dynamic systems on reproducing kernel Hilbert space (RKHS). Here, the proposed method is a concatenation of two techniques proposed in our previous studies, the reduced kernel principal component (RKPCA) Taouali et al. (Int J Adv Manuf Technol, 2015) and the singular value decomposition-kernel principal component (SVD-KPCA) (Elaissi et al. (ISA Trans, 52 (1), 96-104, 2013)) The proposed method is entitled SVD-RKPCA. It consists at first t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 34 publications
(12 citation statements)
references
References 29 publications
0
12
0
Order By: Relevance
“…To select more sensitive features and decrease the computational burden, PCA is used to reduce the dimension of features. In general, the threshold of PCA method is set to 0.85 [37]. Through calculation, we find that the cumulative contribution rate has exceeded 95% when the first seven principal components is chosen.…”
Section: Experimental Results and Analysismentioning
confidence: 99%
“…To select more sensitive features and decrease the computational burden, PCA is used to reduce the dimension of features. In general, the threshold of PCA method is set to 0.85 [37]. Through calculation, we find that the cumulative contribution rate has exceeded 95% when the first seven principal components is chosen.…”
Section: Experimental Results and Analysismentioning
confidence: 99%
“…6) Characterization techniques such as the proposed method provide an effective tool for obtaining system information through kernel extraction. Comparing [40].…”
Section: Discussionmentioning
confidence: 99%
“…Meanwhile, Guo et al [278] reformulated kernel PCA itself to sparsify the projection matrix using elastic net regression. Other techniques for sample subset selection includes feature sample extraction [73], the use of fuzzy C-means clustering [159], reduced KPCA [207], partial KPCA [249], and dictionary learning [246,250,270,271,274]. These methods are efficient enough to warrant an online adaptive implementation (see Section 4.10).…”
Section: Fast Computation Of Kernel Featuresmentioning
confidence: 99%
“…Meanwhile, Jaffel et al [191] proposed a moving window reduced kernel PCA, where "reduced" pertains to an approach for easing the computational burden as discussed in Section 4.8. Other related works that utilize the moving window concept can be found in [190,[207][208][209]238,293]. A different adaptive approach is to use multivariate EWMA to update any part of the model, such as the kernel matrix, its eigen-decomposition, or the statistical indices [116,132,179,224,253,281,283,292].…”
Section: Time-varying Behavior and Adaptive Kernel Computationmentioning
confidence: 99%