paper-with-me

Papers

Meteoroid stream identification with HDBSCAN unsupervised clustering algorithm

2025-07-02 · Eloy Peña-Asensio, Fabio Ferrari arxiv

Accurate identification of meteoroid streams is central to understanding their origins and evolution. However, overlapping clusters and background noise hinder classification, an issue amplified for missions such as ESA's LUMIO that rely on meteor shower observations to infer lunar meteoroid impact parameters. This study evaluates the performance of the Hierarchical Density-Based Spatial Clustering of Applications with Noise (HDBSCAN) algorithm for unsupervised meteoroid stream identification, comparing its outcomes with the established Cameras for All-Sky Meteor Surveillance (CAMS) look-up table method. We analyze the CAMS Meteoroid Orbit Database v3.0 using three feature vectors: LUTAB (CAMS geocentric parameters), ORBIT (heliocentric orbital elements), and GEO (adapted geocentric parameters). HDBSCAN is applied with varying minimum cluster sizes and two cluster selection methods (eom and leaf). To align HDBSCAN clusters with CAMS classifications, the Hungarian algorithm determines the optimal mapping. Clustering performance is assessed via the Silhouette score, Normalized Mutual Information, and F1 score, with Principal Component Analysis further supporting the analysis. With the GEO vector, HDBSCAN confirms 39 meteoroid streams, 21 strongly aligning with CAMS. The ORBIT vector identifies 30 streams, 13 with high matching scores. Less active showers pose identification challenges. The eom method consistently yields superior performance and agreement with CAMS. Although HDBSCAN requires careful selection of the minimum cluster size, it delivers robust, internally consistent clusters and outperforms the look-up table method in statistical coherence. These results underscore HDBSCAN's potential as a mathematically consistent alternative for meteoroid stream identification, although further validation is needed to assess physical validity.

📄 PDF Abstract BibTeX arXiv:2507.01501

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Triples and Knowledge-Infused Embeddings for Clustering and Classification of Scientific Documents

2025-12-19 · Mihael Arcan arxiv

The increasing volume and complexity of scientific literature demand robust methods for organizing and understanding research documents. In this study, we investigate whether structured knowledge, specifically, subject-p…

A review of unsupervised learning in astronomy

2024-06-25 · Sotiria Fotopoulou

This review summarizes popular unsupervised learning methods, and gives an overview of their past, current, and future uses in astronomy. Unsupervised learning aims to organise the information content of a dataset, in su…

AstronomyClusteringDimensionality Reduction

Accelerated Hierarchical Density Clustering

2017-05-20 · Leland McInnes, John Healy

We present an accelerated algorithm for hierarchical density based clustering. Our new algorithm improves upon HDBSCAN*, which itself provided a significant qualitative improvement over the popular DBSCAN algorithm. The …

Clustering

Online Density-Based Clustering for Real-Time Narrative Evolution Monitorin

2026-01-28 · Ostap Vykhopen, Viktoria Skorik, Maksym Tereshchenko, Veronika Solopova arxiv

Automated narrative intelligence systems for social media monitoring face significant scalability challenges when relying on batch clustering methods to process continuous data streams. We investigate replacing offline H…

Computational EfficiencyOnline Clustering

Unsupervised Parameter-free Outlier Detection using HDBSCAN* Outlier Profiles

2024-11-13 · Kushankur Ghosh, Murilo Coelho Naldi, Jörg Sander, Euijin Choo

In machine learning and data mining, outliers are data points that significantly differ from the dataset and often introduce irrelevant information that can induce bias in its statistics and models. Therefore, unsupervis…

Density EstimationOutlier Detection