Meteor shower detection with density‐based clustering
Bibliographic record
Abstract
Abstract We present a new method to detect meteor showers using the density‐based spatial clustering of applications with noise algorithm (DBSCAN; Ester et al. ). The DBSCAN algorithm is a modern cluster detection algorithm that is well suited to the problem of extracting meteor showers from all‐sky camera data because of its ability to efficiently extract clusters of different shapes and sizes from large data sets. We apply this shower detection algorithm on a data set that contains 25,885 meteor trajectories and orbits obtained from the NASA All‐Sky Fireball Network and the Southern Ontario Meteor Network (SOMN). Using a distance metric based on solar longitude, geocentric velocity, and Sun‐centered ecliptic radiant, we find 25 strong cluster detections and six weak detections in the data, all of which are good matches to known showers. We include measurement errors in our analysis to quantify the reliability of cluster occurrence and the probability that each meteor belongs to a given cluster. We validate our method through false‐positive/negative analysis and with a comparison to an established shower detection algorithm.
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.002 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.005 | 0.003 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 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".