Weighted target feature regression neural networks based soft sensing for industrial process
Bibliographic record
Abstract
Abstract There are often nonlinear and time‐varying characteristics in industrial processes. These characteristics cause difficulty in measuring product quality online. To address these issues, a weighted target feature regression neural network (WTFAER) was proposed for soft sensor modelling in this paper. The Pearson correlation coefficient was calculated to assign corresponding weights to process variables and design a weighted objective function. A target feature regression network (TFAER) was constructed using target correlation autoencoder with fully connected layer. After that, the weighted reconstructed information was applied to the TFAER model to extract deep quality‐related features and realize feature reuse. A deep network was formed by layered stacking to fully exploit the deep features for quality prediction. To make the proposed method domain adaptive, a maximum mean squared deviation (MMD) based regularization term was introduced in the loss function. Through the simulation experiments of debutanizer column and industrial polyethylene process, and compared with stacked autoencoder (SAE), variable‐wise weighted stacked autoencoder (VW‐SAE) and stacked target‐related autoencoder (STAE) methods, the effectiveness and generalization performance of the proposed modelling method were verified.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".