Hybrid Method with Parallel-Factor Theory, a Support Vector Machine, and Particle Filter Optimization for Intelligent Machinery Failure Identification
Bibliographic record
Abstract
Here, a novel hybrid method of intelligent fault identification within complex mechanical systems was proposed using parallel-factor (PARAFAC) theory and adaptive particle swarm optimization (APSO) for a support vector machine (SVM). The parallel-factor multi-scale analysis theory was studied to reconstruct tensor feature information based on a three-dimensional matrix for time, frequency, and spatial vectors. A multi-scale wavelet analysis was used to transform the original multi-channel experimental data acquired from a gearbox into a three-dimensional feature matrix of the multi-level structure. The optimal correspondence among the two-dimensional feature signals in the frequency and time domains for the different fault modes was established by the PARAFAC theory. An intelligent APSO algorithm was developed to obtain the optimal parameter structures of an SVM classifier. A comparison with the existing time–frequency analysis method showed that the proposed hybrid PARAFAC-PSO-SVM diagnosis model effectively eliminated the redundant information in the multi-dimensional tensor features but retained the important components. The PARAFAC-APSO-SVM hybrid diagnostic model achieved fast, accurate, and simple fault-classification and identification results, and could provide theoretical support for the application of the PARAFAC theory to complex mechanical fault diagnosis.
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.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| 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".