Industrial Fault Detection Employing Meta Ensemble Model Based on Contact Sensor Ultrasonic Signal
Bibliographic record
Abstract
Ultrasonic diagnostics is the earliest way to predict industrial faults. Usually, a contact microphone is employed for detection, but the recording will be contaminated with noise. In this paper, a dataset that contains 10 main faults of pipelines and motors is analyzed from which 30 different features in the time and frequency domains are extracted. Afterward, for dimensionality reduction, principal component analysis (PCA), linear discriminant analysis (LDA), and t-distributed stochastic neighbor embedding (t-SNE) are performed. In the subsequent phase, recursive feature elimination (RFE) is employed as a strategic method to analyze and select the most relevant features for the classifiers. Next, predictive models consisting of k-Nearest Neighbor (KNN), Logistic Regression (LR), Decision Tree (DT), Gaussian Naive Bayes (GNB), and Support Vector Machine (SVM) are employed. Then, in order to solve the classification problem, a stacking classifier based on a meta-classifier which combines multiple classification models is introduced. Furthermore, the k-fold cross-validation technique is employed to assess the effectiveness of the model in handling new data for the evaluation of experimental results in ultrasonic fault detection. With the proposed method, the accuracy is around 5% higher over five cross folds with the least amount of variation. The timing evaluation of the meta model on the 64 MHz Cortex M4 microcontroller unit (MCU) revealed an execution time of 11 ms, indicating it could be a promising solution for real-time monitoring.
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.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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".