Papers › CALSAGOS: Clustering ALgorithmS Applied to Galaxies in Overdense Systems
CALSAGOS: Clustering ALgorithmS Applied to Galaxies in Overdense Systems
D. E. Olave-Rojas, P. Cerulo, P. Araya-Araya, D. A. Olave-Rojas
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper we present CALSAGOS: Clustering ALgorithmS Applied to Galaxies in Overdense Systems which is a PYTHON package developed to select cluster members and to search, find, and identify substructures. CALSAGOS is based on clustering algorithms and was developed to be used in spectroscopic and photometric samples. To test the performance of CALSAGOS we use the S-PLUS's mock catalogues and we found an error of 1\% - 6\% on member selection depending on the function that is used. Besides, CALSAGOS has a F₁-score of 0.8, a precision of 85\% and a completeness of 100\% in the identification of substructures in the outer regions of galaxy clusters (r > r₂₀₀). The F₁-score, precision and completeness of CALSAGOS fall to 0.5, 75\% and 40\% when we consider all substructure identifications (inner and outer) due to the function that searches, finds, and identifies the substructures works in 2D and cannot resolve the substructures projected over others.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections