An Efficient Dynamic Auto-Regressive CCA for Time Series Imputation With Irregular Sampling
Bibliographic record
Abstract
System dynamics are inevitable in industrial processes due to factors such as ambient disturbances and controller tuning. Accurate modeling of these dynamics are of key importance for subsequent process analysis and anomaly detection, and dynamic latent variable methods are widely adopted since they retain good interpretability. However, only dynamic cross-correlations are modeled in existing methods, leaving a large portion of quality information unexploited. In this work, an efficient dynamic auto-regressive canonical correlation analysis (EDACCA) method is proposed with a modified auto-regressive exogenous model to extract dynamics in both auto-correlations and cross-correlations. The flexibility and efficiency of EDACCA are improved with the design of weighting parameters and the economic singular value decomposition. EDACCA is further adapted for multi-step ahead (MS) prediction and missing data imputation. Two industrial processes are employed to evaluate the prediction performance and imputation performance of EDACCA.Note to Practitioners—Different sampling rates are usually set for process and quality variables in industrial processes, which leads to less quality samples. Meanwhile, system dynamics are not fully exploited for dynamic predictive modeling in most existing algorithms. The focus of this study is to develop a customized data imputation method for different data volume of process and quality data. An efficient dynamic auto-regressive canonical correlation analysis (EDACCA) is designed to extract temporal relations between process and quality variables, which is also adapted for multi-step-ahead prediction purpose. An EDACCA based data imputation method is also proposed to impute incomplete data caused by irregular sampling rates.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.009 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".