Unsupervised novelty detection–based structural damage localization using a density peaks-based fast clustering algorithm
Bibliographic record
Abstract
Within machine learning, several structural damage detection and localization methods based on clustering and novelty detection methods have been proposed in the recent years in order to monitor mechanical and civil structures. In order to train a machine learning model, an unsupervised mode is preferred because it only requires sufficient normal data from the intact states of a structure for training, and the testing abnormal data from various damage states are generally quite rare. With an unsupervised training mode, the capability of detecting structural damage mainly depends on the identification of abnormal data from the testing data. This identification process is termed unsupervised novelty detection. The premise of unsupervised novelty detection is that a large volume of a normal data set is available first to train a normal model that is established by machine learning algorithms. Then, the trained normal model can be used to identify abnormal data from future testing data. In this article, a new structural damage detection and localization method is proposed using a density peaks-based fast clustering algorithm. In order to realize damage detection, the original density peaks-based fast clustering algorithm is modified to an unsupervised machine learning method by adding training and testing processes. Furthermore, to improve the performance of the proposed method, the Gaussian kernel function of radius is introduced to calculate the local density of data points, and a new damage-sensitive feature using a continuous wavelet transform is also proposed. Damage-sensitive features are extracted from the measured data through sensors installed on a laboratory-scale steel structure. Extensive experimental studies are carried out under various structural damage scenarios in order to validate the performance of the proposed method. The proposed density peaks-based fast clustering method shows satisfactory performance with regard to damage localization under various damage scenarios as compared to a traditional approach.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 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".