Speedy greedy feature selection: better redshift estimation via massive parallelism

7 Citationer (Scopus)

Abstract

Nearest neighbor models are among the most basic tools in machine learning, and recent work has demonstrated their effectiveness in the field of astronomy. The performance of these models crucially depends on the underlying metric, and in particular on the selection of a meaningful subset of informative features. The feature selection is task-dependent and usually very time-consuming. In this work, we propose an efficient parallel implementation of incremental feature selection for nearest neighbor models utilizing nowadays graphics processing units. Our framework provides significant computational speed-ups over its sequential single-core competitor of up to two orders of magnitude. We demonstrate the applicability of the overall scheme on one of the most challenging tasks in astronomy: redshift estimation for distant galaxies.

OriginalsprogEngelsk
TitelESANN 2014 proceedings : European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning
RedaktørerM. Verleysen
Antal sider6
Forlagi6doc.com
Publikationsdato2014
Sider87-92
ISBN (Trykt)978-287419095-7
StatusUdgivet - 2014
BegivenhedEuropean Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning 2014 - Bruges, Belgien
Varighed: 23 apr. 201425 apr. 2014

Konference

KonferenceEuropean Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning 2014
Land/OmrådeBelgien
ByBruges
Periode23/04/201425/04/2014

Fingeraftryk

Dyk ned i forskningsemnerne om 'Speedy greedy feature selection: better redshift estimation via massive parallelism'. Sammen danner de et unikt fingeraftryk.

Citationsformater