<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Clustering on Gabriel Berardi</title><link>http://www.gabriel-berardi.com/tags/clustering/</link><description>Recent content in Clustering on Gabriel Berardi</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Wed, 01 Jan 2020 00:00:00 +0000</lastBuildDate><atom:link href="http://www.gabriel-berardi.com/tags/clustering/index.xml" rel="self" type="application/rss+xml"/><item><title>k-Means Clustering</title><link>http://www.gabriel-berardi.com/blog/data/2020-01-01-k-means-clustering/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>http://www.gabriel-berardi.com/blog/data/2020-01-01-k-means-clustering/</guid><description>&lt;p&gt;The k-means algorithm is used to divide unlabeled data into categories or classes, in order to draw useful conclusions from the resulting clusters.&lt;/p&gt;
&lt;p&gt;Let&amp;rsquo;s take a look at an imaginary dataset of n = 18 observations of different coffee brands. Note that we would never actually use the k-means algorithm on such a small dataset.&lt;/p&gt;
&lt;p&gt;We plot the price of the coffee vs. the rating obtained by customers:&lt;/p&gt;
&lt;p&gt;








&lt;a href="images/coffee-price-vs-rating-scatterplot.png" data-fancybox="post-images" data-caption="scatter plot of coffee price vs customer rating"&gt;
 &lt;img src="images/coffee-price-vs-rating-scatterplot.png" alt="scatter plot of coffee price vs customer rating" /&gt;
&lt;/a&gt;
&lt;/p&gt;</description></item></channel></rss>