A novel key performance indicator oriented process monitoring method based on multiple information extraction and support vector data description
Bibliographic record
Abstract
Abstract As a core part of modern chemical plants, key performance indicator oriented process monitoring and fault diagnosis systems have gradually made great contributions to guaranteeing process safety, improving product quality, and ensuring system reliability, which recently have received extensive attention and become one of the hot spots both in academic research and industrial application fields. Different from previous methods, a novel key performance indicator oriented process monitoring method is proposed in this paper, which fully mines and utilizes important time feature information hidden in the process data while considering the local process information. Firstly, a group of representative process variables with maximum key performance indicator information are selected by the maximal information coefficient algorithm, and local information is extracted. Then, observed value, accumulated error, and change rate information are further extracted from the representative process variables and expanded into multiple information blocks, which contain both local process and hidden time feature information. After that, the support vector data description model is established to monitor each information block, and the Bayesian inference is employed to fuse the final monitoring results to obtain a new monitoring index. Finally, the performance and effectiveness of the proposed method is validated by conducting a simulation on Tennessee Eastman process.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".