Anomaly detection in maritime data based on geometrical analysis of trajectories
Bibliographic record
Abstract
Anomaly detection is an important use of the Automatic Identification Systems (AIS), because it offers support to users to evaluate if a vessel is in trouble or causing trouble. For instance, it can be used to detect if a ship is doing something that may cause an accident or if it has changed its route to avoid bad weather condition. In this work, a new method for finding anomalies in the ships' movements is proposed. The method analyzes the trajectory of ships from a geometrical perspective. The trajectory of the ship is compared with a near-optimal path that is generated by a graph search algorithm. The proposed method extracts some scale-invariant features from the real trajectory and also from the optimal movement pattern, and it compares the two sets of features to generate an abnormality score. The method is unsupervised and it does not require training. Instead of labeling the trajectories as normal/abnormal it calculates a score value that denotes the extent of abnormality. The scoring scheme provides a ranking system in which the user can sort the trajectories based on their abnormality score. This is useful when dealing with large number of trajectories and the user wants to picks the most abnormal cases. For the evaluation, the method was run on three months data of North Pacific Ocean and score values were generated. Among the entire dataset, 100 randomly chosen trajectories were labeled by an expert. After applying a threshold on the score value, the proposed method had 94% accuracy.
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.005 | 0.004 |
| Science and technology studies | 0.000 | 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.001 |
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".