Improving Near Miss Detection in Maritime Traffic in the Northern Baltic Sea from AIS Data
Bibliographic record
Abstract
Ship collision is the most common type of accident in the Northern Baltic Sea, posing a risk to the safety of maritime transportation. Near miss detection from automatic identification system (AIS) data provides insight into maritime transportation safety. Collision risk always triggers a ship to maneuver for safe passing. Some frenetic rudder actions occur at the last moment before ship collision. However, the relationship between ship behavior and collision risk is not fully clarified. Therefore, this work proposes a novel method to improve near miss detection by analyzing ship behavior characteristic during the encounter process. The impact from the ship attributes (including ship size, type, and maneuverability), perceived risk of a navigator, traffic complexity, and traffic rule are considered to obtain insights into the ship behavior. The risk severity of the detected near miss is further quantified into four levels. This proposed method is then applied to traffic data from the Northern Baltic Sea. The promising results of near miss detection and the model validity test suggest that this work contributes to the development of preventive measures in maritime management to enhance to navigational safety, such as setting a precautionary area in the hotspot areas. Several advantages and limitations of the presented method for near miss detection are discussed.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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".