Intelligent Cross-Working Condition Fault Detection and Diagnosis Using Isolation Forest and Adversarial Discriminant Domain Adaptation
Bibliographic record
Abstract
The increasing complexity and varying operational conditions of today’s rotating machinery present significant challenges for automated fault diagnosis. While data-driven fault diagnosis methods have grown in popularity, they often rely heavily on full-cycle data, making them resource-intensive and less adaptive to diverse working conditions. Addressing this gap, our proposed system avoids the dependence on full-cycle data, employing an efficient two-stage methodology. In the initial stage, an isolation forest (iForest) module operates in an unsupervised mode, isolating operational anomalies indicative of potential faults. These identified anomalies are then channeled into the second stage, where a adversarial discriminant domain adaptation (ADDA) module performs an in-depth fault diagnosis. By streamlining the diagnostic process, our approach not only accelerates fault identification but also reduces the reliance on extensive datasets that are often a staple in conventional diagnostics. Performance evaluations with the XJTU-SY and CWRU bearing datasets show that our system reaches an accuracy of 95.67%, affirming its superiority as a cost-efficient, data-lean solution in machinery fault diagnostics.
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.000 |
| 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.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".