Sparse Incident-Cluster Learning for 12-hour Port Flood Pre-warning in Digital-Twin Analytics
Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.
Computer Science > Machine Learning
Title:Sparse Incident-Cluster Learning for 12-hour Port Flood Pre-warning in Digital-Twin Analytics
Abstract:Port flood digital twins require analytics that warn operators before disruption, but official warning incidents are often few and adjacent observations are temporally dependent. Row-level classification can therefore overstate performance by placing windows from the same event in both model-development and evaluation data. We formulate 12-hour port flood pre-warning as an incident-cluster learning problem and evaluate a digital-twin analytics module using eight-point water-level histories, prediction-time contextual covariates, and interpretable short-window dynamics. The protocol combines fold-specific sparse feature selection, warning-cluster grouping, negative-label controls, 100-repeat random top-k controls, and alert-episode evaluation. Liverpool is the primary four-cluster case study, with harmonised Humber/Hull-proxy and Wessex South data used for protocol-transfer checks. Across the Liverpool folds, the top-10 ElasticNet model achieves mean F2 = 0.696, compared with 0.633 without top-k truncation and 0.681 for full-feature weighted XGBoost. It is the strongest ElasticNet variant, remains competitive with the nonlinear reference using only ten predictors, and exceeds the repeat-level 95th percentile of broad and same-family random subsets. Contextual covariates provide a strong prediction-time anchor, complemented by physically interpretable local dynamics. Historical replay converts risk scores into alert episodes and measures alert duration and false-episode burden. The result is an offline-evaluated analytics and validation module designed for integration into a port digital twin.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2609.06109 [cs.LG] |
| (or arXiv:2609.06109v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2609.06109
arXiv-issued DOI via DataCite (pending registration)
|
Access Paper:
- View PDF
- HTML (experimental)
- TeX Source
References & Citations
Bibliographic and Citation Tools
Code, Data and Media Associated with this Article
Demos
Recommenders and Search Tools
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
More from arXiv — Machine Learning
-
Stable and Faithful Explanations for Knowledge Tracing
Sep 25
-
SMILESGNN: Interpretable Clinical Toxicity Prediction via SMILES-Graph Cross-Attention Fusion
Sep 25
-
CFD Correction of Open Tip Clearance Flow in a Compressor Cascade Using VAE Latent Space Adaptation
Sep 25
-
CARE: Condition-Aware Representation Regularization for Diffusion Models
Sep 25
Discussion (0)
Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.
Sign in →No comments yet. Sign in and be the first to say something.