A Method for Enhancing the Traffic Situation Awareness of Vessel Traffic Service Operators by Identifying High Risk Ships in Complex Navigation Conditions
Bibliographic record
Abstract
As ship traffic volumes increase and navigable waters become more complex, vessel traffic service operators (VTSOs) face growing challenges to effectively monitor marine traffic. To address the heavy reliance on human expertise in current ship supervision, we propose a method for quickly identifying high risk ships to enhance the situational awareness of VTSOs in complex waters. First, the K-means clustering algorithm is improved using the Whale Optimization Algorithm (WOA) to adaptively cluster ships within a waterway, segmenting the traffic in the area into multiple ship clusters. Second, a ship cluster collision risk assessment model is developed to quantify the degree of collision risk for each ship cluster. Finally, a weighted directed complex network is constructed to identify high risk ships within each ship cluster. Experimental simulations show that the proposed WOA–K-means clustering algorithm outperforms other adaptive clustering algorithms in terms of computation speed and accuracy. The developed ship cluster collision risk assessment model can identify high risk ship clusters that require VTSO attention, and the weighted directed complex network model accurately identifies high risk ships. This approach can assist VTSOs in executing a comprehensive and targeted monitoring process encompassing macro, meso, and micro aspects, thus boosting the efficacy of ship oversight, and mitigating traffic hazards.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 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".