Sparse Incident-Cluster Learning for 12-hour Port Flood Pre-warning in Digital-Twin Analytics
cs.LG
Submitted: 2026-09-05
Updated: 2026-09-05
License: http://creativecommons.org/licenses/by-sa/4.0/
The gist: Port flood digital twins require analytics that warn operators before disruption, but official warning incidents are often few and adjacent observations are temporally dependent.
Terminology
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.
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks