2018
DOI: 10.1002/aic.16481
|View full text |Cite
|
Sign up to set email alerts
|

Semi‐supervised dynamic latent variable modeling: I/O probabilistic slow feature analysis approach

Abstract: Modeling of high dimensional dynamic data is a challenging task. The high dimensionality problem in process data is usually accounted for using latent variable models. Probabilistic slow feature analysis (PSFA) is an example of such an approach that accounts for high dimensionality while simultaneously capturing the process dynamics. However, PSFA also suffers from a drawback that it cannot use output information when determining the latent slow features. To address this lacunae, extension of the PSFA by incor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
2

Relationship

3
5

Authors

Journals

citations
Cited by 36 publications
(10 citation statements)
references
References 56 publications
0
10
0
Order By: Relevance
“…where, [0, 1] i   is a parameter which is used to determine the similarity between the i-th variable in t s and t z . In recent years, an input-output probabilistic SFA (I/O PSFA) is proposed with both input and output information (Fan et al, 2019). It is noted that the formulations of GPMM and I/O PSFA are different, which finally results in different estimations of model parameters.…”
Section: Gpllvm Modelmentioning
confidence: 99%
“…where, [0, 1] i   is a parameter which is used to determine the similarity between the i-th variable in t s and t z . In recent years, an input-output probabilistic SFA (I/O PSFA) is proposed with both input and output information (Fan et al, 2019). It is noted that the formulations of GPMM and I/O PSFA are different, which finally results in different estimations of model parameters.…”
Section: Gpllvm Modelmentioning
confidence: 99%
“…Further, z z z k is formed by stacking the oscillatory slow feature s s s k ∈ R ms and drift-type nonstationary feature h h h k ∈ R m h . The generative model for the oscillating slow feature inference network is shown in (19). p θ (y y y 1:N , t t t 1:N T ) = p θ (y y y 1:N , t t t 1:N −T , z z z 0:N )dz z z 0:N (19) where…”
Section: A Data Generating Modelmentioning
confidence: 99%
“…Unlike SFA, the parameters are estimated using a procedure called expectation-maximization. Several deterministic [18] and probabilistic [19] extensions were proposed to extract quality-relevant slow features. Recently, complex probabilistic slow feature analysis [20] was proposed to model the stationary oscillatory patterns explicitly in the feature space.…”
Section: Introductionmentioning
confidence: 99%