Quick-means: accelerating inference for K-means by learning fast transforms

DOI10.1007/s10994-021-05965-0OpenAlexW3155492258MaRDI QIDQ2051290

Luc Giffon, Liva Ralaivola, Valentin Emiya, Hachem Kadri

Publication date: 24 November 2021

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.08713

zbMATH Keywords

clusteringmachine learningK-meansfast transforms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Statistical learning guarantees for compressive clustering and compressive mixture modeling

Uses Software

• UCI-ml
• Scikit
• MNIST
• AS 136
• FLANN
• k-means++
• COIL-20
• Fashion-MNIST

Cites Work

• Algorithm AS 136: A K-Means Clustering Algorithm
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering
• The Linear Complexity of Computation
• Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling
• Butterfly Factorization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quick-means: accelerating inference for K-means by learning fast transforms