Web: https://towardsdatascience.com/large-scale-k-means-clustering-with-gradient-descent-c4d6236acd7a?source=rss----7f60cf5620c9---4

June 23, 2022, 5 a.m. | Sriram Kumar

Towards Data Science - Medium towardsdatascience.com

Learning with sequential, mini-batch, and batch data

Photo by Radu Chelariu on Unsplash

Introduction

Clustering is an unsupervised form of a machine learning algorithm. It discovers sub-groups or patterns in the data. The K-Means algorithm is a simple and intuitive way to cluster data. When we apply the K-Means algorithm, we have to be mindful of dataset size and dimensionality. Either one of these can cause slow algorithmic convergence¹. In this article, we will explore gradient descent optimization and dimensionality …

clustering data science gradient k-means k-means-clustering machine learning optimization scale

More from towardsdatascience.com / Towards Data Science - Medium

Machine Learning Researcher - Saalfeld Lab

@ Howard Hughes Medical Institute - Chevy Chase, MD | Ashburn, Virginia

Project Director, Machine Learning in US Health

@ ideas42.org | Remote, US

Data Science Intern

@ NannyML | Remote

Machine Learning Engineer NLP/Speech

@ Play.ht | Remote

Research Scientist, 3D Reconstruction

@ Yembo | Remote, US

Clinical Assistant or Associate Professor of Management Science and Systems

@ University at Buffalo | Buffalo, NY