AutoML for Stream k-Nearest Neighbors Classification - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

AutoML for Stream k-Nearest Neighbors Classification

Résumé

The last few decades have witnessed a significant evolution of technology in different domains, changing the way the world operates, which leads to an overwhelming amount of data generated in an open-ended way as streams. Over the past years, we observed the development of several machine learning algorithms to process big data streams. However, the accuracy of these algorithms is very sensitive to their hyper-parameters, which requires expertise and extensive trials to tune. Another relevant aspect is the high-dimensionality of data, which can causes degradation to computational performance. To cope with these issues, this paper proposes a stream k-nearest neighbors (kNN) algorithm that applies an internal dimension reduction to the stream in order to reduce the resource usage and uses an automatic monitoring system that tunes dynamically the configuration of the kNN algorithm and the output dimension size with big data streams. Experiments over a wide range of datasets show that the predictive and computational performances of the kNN algorithm are improved.
Fichier non déposé

Dates et versions

hal-04468436 , version 1 (20-02-2024)

Identifiants

Citer

Maroua Bahri, Bruno Veloso, Albert Bifet, João Gama. AutoML for Stream k-Nearest Neighbors Classification. 2020 IEEE International Conference on Big Data (IEEE BigData 2020), Atlanta, GA, USA, December 10-13, 2020, Dec 2020, Atlanta, United States. pp.597--602, ⟨10.1109/BIGDATA50022.2020.9378396⟩. ⟨hal-04468436⟩
3 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More