Fusion of heterogeneous industrial data using polygon generation & deep learning
Bibliographic record
Abstract
Analysis of industrial data imposes several challenges. These data are acquired from heterogeneous sources such as sensors, cameras, IoT, etc, and are stored in different structures and formats with different sampling frequencies. They are also stored in isolated silos in different locations which hinders their exploitation. Therefore, there is a clear need to integrate these disconnected data silos at different processing levels and make them clean, easily accessible, and fully exploitable. This paper proposes a data fusion method that merges heterogeneous sources of data at raw, information, and decision levels using polygon generation and deep learning (DL) techniques. An innovative polygon generation technique is proposed to preprocess each data source and convert it into powerful representations that capture all possible relationships in the data, thus extracting the maximum knowledge and achieving better prediction accuracy of the corresponding DL method. The proposed method is targeting challenging data modeling problems found in industrial processes. It is validated successfully using a case study in the realm of process system engineering. The results obtained demonstrate that the proposed fusion method is more accurate, with a minimum of 20% improvement, compared to other methods previously used in the literature.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| 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".