<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Lloyds-Algorithm on Aayush Bajaj's Augmenting Infrastructure</title><link>https://abaj.ai/tags/lloyds-algorithm/</link><description>Recent content in Lloyds-Algorithm on Aayush Bajaj's Augmenting Infrastructure</description><generator>Hugo</generator><language>en</language><copyright>© 2026 Aayush Bajaj</copyright><lastBuildDate>Thu, 09 Jul 2026 21:02:12 +1000</lastBuildDate><atom:link href="https://abaj.ai/tags/lloyds-algorithm/index.xml" rel="self" type="application/rss+xml"/><item><title>K-means Clustering</title><link>https://abaj.ai/wiki/ml/unsupervised/k-means-clustering/</link><pubDate>Thu, 09 Jul 2026 21:02:56 +1000</pubDate><guid>https://abaj.ai/wiki/ml/unsupervised/k-means-clustering/</guid><description>&lt;p>k-means is unsupervised learning&amp;rsquo;s hello world: pick \(k\) prototype points, assign every datum to its nearest prototype, move each prototype to the centre of its flock, repeat.&lt;span class="margin-note" data-note="lloyd wrote it up at bell labs in 1957 for pulse-code modulation — it stayed an internal memo until 1982">
 &lt;span class="margin-note-indicator">𐃏&lt;/span>
&lt;/span>

it is fast, it always terminates, and it is wrong in ways that are so instructive that every clustering course starts here anyway.&lt;/p></description></item></channel></rss>