Euclid preparation XXII. Selection of quiescent galaxies from mock photometry using machine learning
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
We study the evolution of spectral early-type galaxies in clusters, groups, and the field up to redshift 0.9 using the ESO Distant Cluster Survey (EDisCS) dataset. We measure structural parameters (circularized half-luminosity radii R-e, surface brightness ...
We present a study of large-scale bars in field and cluster environments out to redshifts of similar to 0.8 using a final sample of 945 moderately inclined disk galaxies drawn from the EDisCS project. We characterize bars and their host galaxies and look f ...
We present a high signal-to-noise spectrum of a bright galaxy at z = 4.9 in 14 hr of integration on VLT FORS2. This galaxy is extremely bright, i(850) = 23.10 +/- 0.01, and is strongly lensed by the foreground massive galaxy cluster A1689 (z = 0.18). Stell ...
We have developed a semi-empirical simulation of the extragalactic radio continuum sky suitable for aiding the design of next generation radio interferometers such as the Square Kilometre Array (SKA). The emphasis is on modelling the large-scale cosmologic ...
We study the morphological content of a large sample of high-redshift clusters to determine its dependence on cluster mass and redshift. Quantitative morphologies are based on PSF-convolved, 2D bulge+disk decompositions of cluster and field galaxies on dee ...
Ensemble algorithms can improve the performance of a given learning algorithm through the combination of multiple base classifiers into an ensemble. In this paper we attempt to train and combine the base classifiers using an adaptive policy. This policy is ...
