Por favor, use este identificador para citar o enlazar este ítem:
|Título :||The miniJPAS survey: star-galaxy classification using machine learning|
|Autor :||Baqui, P. O.|
Díaz García, L. A.
Hernández Monteagudo, C.
Lopes, P. A. A.
López Sanjuan, C.
Muniesa, D. J.
Placco, V. M.
Vílchez, J. M.
Abramo, L. R.
Alcaniz, J. S.
Cenarro, A. J.
Cristóbal Hornillos, D.
De Amorim, A. L.
De Oliveira, C. M.
Dupke, R. A.
González Delgado, R. M.
Marín Franch, A.
Vázquez Ramió, H.
|Palabras clave :||Methods: data analysis;Catalogs;Galaxies: statistics;Stars: statistics|
|Fecha de publicación :||18-ene-2021|
|Editorial :||EDP Sciences|
|Versión del Editor:||https://www.aanda.org/articles/aa/full_html/2021/01/aa38986-20/aa38986-20.html|
|Citación :||Astronomy and Astrophysics 645: A87(2021)|
|Resumen :||Context. Future astrophysical surveys such as J-PAS will produce very large datasets, the so-called “big data”, which will require the deployment of accurate and efficient machine-learning (ML) methods. In this work, we analyze the miniJPAS survey, which observed about ∼1 deg2 of the AEGIS field with 56 narrow-band filters and 4 ugri broad-band filters. The miniJPAS primary catalog contains approximately 64 000 objects in the r detection band (magAB ≲ 24), with forced-photometry in all other filters. Aims. We discuss the classification of miniJPAS sources into extended (galaxies) and point-like (e.g., stars) objects, which is a step required for the subsequent scientific analyses. We aim at developing an ML classifier that is complementary to traditional tools that are based on explicit modeling. In particular, our goal is to release a value-added catalog with our best classification. Methods. In order to train and test our classifiers, we cross-matched the miniJPAS dataset with SDSS and HSC-SSP data, whose classification is trustworthy within the intervals 15 ≤ r ≤ 20 and 18.5 ≤ r ≤ 23.5, respectively. We trained and tested six different ML algorithms on the two cross-matched catalogs: K-nearest neighbors, decision trees, random forest (RF), artificial neural networks, extremely randomized trees (ERT), and an ensemble classifier. This last is a hybrid algorithm that combines artificial neural networks and RF with the J-PAS stellar and galactic loci classifier. As input for the ML algorithms we used the magnitudes from the 60 filters together with their errors, with and without the morphological parameters. We also used the mean point spread function in the r detection band for each pointing. Results. We find that the RF and ERT algorithms perform best in all scenarios. When the full magnitude range of 15 ≤ r ≤ 23.5 is analyzed, we find an area under the curve AUC = 0.957 with RF when photometric information alone is used, and AUC = 0.986 with ERT when photometric and morphological information is used together. When morphological parameters are used, the full width at half maximum is the most important feature. When photometric information is used alone, we observe that broad bands are not necessarily more important than narrow bands, and errors (the width of the distribution) are as important as the measurements (central value of the distribution). In other words, it is apparently important to fully characterize the measurement. Conclusions. ML algorithms can compete with traditional star and galaxy classifiers; they outperform the latter at fainter magnitudes (r ≳ 21). We use our best classifiers, with and without morphology, in order to produce a value-added catalog.|
|Descripción :||Full Table 2 is only available at the CDS via anonymous ftp to cdsarc.u-strasbg.fr (22.214.171.124) or via http://cdsarc.u-strasbg.fr/viz-bin/cat/J/A+A/645/A87. The catalog is available at http://j-pas.org/datareleases via the ADQL table minijpas.StarGalClass. The ML models are available at github.com/J-PAS-collaboration/StarGalClass-MachineLearning.These authors contributed equally to this work.|
|Aparece en las colecciones:||(CAB) Artículos|
Ficheros en este ítem:
|the miniJPAS survey- star glaxy classification using machine learning.pdf||1,12 MB||Adobe PDF|
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons