Unsupervised deep learning approach using a deep auto-encoder with a one-class support vector machine to detect damage
Bibliographic record
Abstract
This article proposes an unsupervised deep learning–based approach to detect structural damage. Supervised deep learning methods have been proposed in recent years, but they require data from an intact structure and various damage scenarios of monitored structures for their training processes. However, the labeling work on the training data is typically time-consuming and costly, and sometimes collecting sufficient training data from various damage scenarios of infrastructures in service is impractical. In this article, the proposed unsupervised deep learning method based on a deep auto-encoder with an one-class support vector machine only uses the measured acceleration response data acquired from intact or baseline structures as training data, which enables future structural damage to be detected. The major contributions and novelties of the proposed method are as follows. First, an appropriate deep auto-encoder is carefully designed through comparative studies on the depth of neural networks. Second, the designed deep auto-encoder is taken as an extractor to obtain damage-sensitive features from the measured acceleration response data, and an one-class support vector machine is used as a damage detector. Third, experimental and numerical studies validate the high accuracy of the proposed method for damage detection: a 97.4% mean average for a 12-story numerical building model and a 91.0% accuracy for a laboratory-scaled steel bridge. Fourth, the proposed method also detects light damage (i.e. a 10% reduction in stiffness) with 96.9% to 99.0% accuracy, which shows its superior performance compared with the current state of the art. Fifth, it provides stable and more robust damage detection performance with reduced tuning parameters.
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.000 | 0.001 |
| 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.000 | 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".