Smart Alarm- On the performance characteristics of linear, multi-linear and non-linear tensor models for alarm prediction in multi-sensor data.
Bibliographic record
Abstract
Information and modern computing technology advancements have led to a rise in the importance of maintenance, particularly in areas where a single components failure could have a significant impact on the overall systems performance. Numerous industries, including Alfa Laval, are operating on conditional-based systems that provide warnings only when a machine fails. In the worst instances, pro- longed downtime or machine failure can be costly in terms of money, time, and security [2]. The Alfa Laval company is interested in build- ing a smart alarm system that anticipates alarms and warnings based on sensor readings. For solving these issues, predictive maintenance using machine learning is one of the most effective approach to de- tect the machine condition in advance for maintenance and prevent it from real-time damage or faults. To obtain the best prescient machine learning model, we examined multi-linear and non-linear methods with tensor representation and the linear method as a baseline on real-time multi-sensor time-series datasets to build the smart alarm predictive system to anticipate cautions and warnings. As per the ex- perimental results, we are more certain that the non-linear (Tensor Convolutional Neural Network) method is more ideal than the other methods for the company’s multivariate time series datasets.
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.005 | 0.011 |
| Meta-epidemiology (narrow) | 0.002 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".