Graph-Based Feature Weight Optimisation and Classification of Continuous Seismic Sensor Array Recordings
Bibliographic record
Abstract
Slope instabilities caused by heavy rainfall, man-made activity or earthquakes can be characterised by seismic events. To minimise mortality and infrastructure damage, a good understanding of seismic signal properties characterising slope failures is therefore crucial to classify seismic events recorded from continuous recordings effectively. However, there are limited contributions towards understanding the importance of feature selection for the classification of seismic signals from continuous noisy recordings from multiple channels/sensors. This paper first proposes a novel multi-channel event-detection scheme based on Neyman-Pearson lemma and Multi-channel Coherency Migration (MCM) on the stacked signal across multi-channels. Furthermore, this paper adapts graph-based feature weight optimisation as feature selection, exploiting the signal's physical characteristics, to improve signal classification. Specifically, we alternatively optimise the feature weight and classification label with graph smoothness and semidefinite programming (SDP). Experimental results show that with expert interpretation, compared with the conventional short-time average/long-time average (STA/LTA) detection approach, our detection method identified 614 more seismic events in five days. Furthermore, feature selection, especially via graph-based feature weight optimisation, provides more focused feature sets with less than half of the original number of features, at the same time enhancing the classification performance; for example, with feature selection, the Graph Laplacian Regularisation classifier (GLR) raised the rockfall and slide quake sensitivities to 92% and 88% from 89% and 85%, respectively.
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.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.000 |
| 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".