*Carte non disponible*

**Date/heure**

Date(s) - 25/10/2019*14 h 00 min - 15 h 00 min*

**Catégories**
Pas de Catégories

Luc GIFFON (LIS, Aix-Marseille Université)

K-means — and the celebrated Lloyd algorithm — is more than the clustering method it was originally designed to be. It has indeed proven pivotal to help increase the speed of many machine learning and data analysis techniques such as indexing, nearest-neighbor search and prediction, data compression, Radial Basis Function networks; its beneficial use has been shown to carry over to the acceleration of kernel machines (when using the Nyström method). Here, we propose a fast extension of K-means, dubbed QuicK-means, that rests on the idea of expressing the matrix of the 𝐾 centroids as a product of sparse matrices, a feat made possible by recent results devoted to find approximations of matrices as a product of sparse factors. Using such a decomposition squashes the complexity of the matrix-vector product between the factorized 𝐾×𝐷 centroid matrix 𝐔 and any vector from O(𝐾𝐷) to O(𝐴log𝐴+𝐵), with 𝐴=min(𝐾,𝐷) and 𝐵=max(𝐾,𝐷), where 𝐷 is the dimension of the training data. This drastic computational saving has a direct impact in the assignment process of a point to a cluster, meaning that it is not only tangible at prediction time, but also at training time, provided the factorization procedure is performed during Lloyd’s algorithm. We precisely show that resorting to a factorization step at each iteration does not impair the convergence of the optimization scheme and that, depending on the context, it may entail a reduction of the training time. Finally, we provide discussions and numerical simulations that show the versatility of our computationally-efficient QuicK-means algorithm.