<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>K-Means on Arshad Siddiqui</title><link>https://arshadhs.github.io/tags/k-means/</link><description>Recent content in K-Means on Arshad Siddiqui</description><generator>Hugo</generator><language>en-us</language><atom:link href="https://arshadhs.github.io/tags/k-means/index.xml" rel="self" type="application/rss+xml"/><item><title>Unsupervised Learning</title><link>https://arshadhs.github.io/docs/ai/machine-learning/10-unsupervised-learning/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://arshadhs.github.io/docs/ai/machine-learning/10-unsupervised-learning/</guid><description>&lt;h1 id="unsupervised-learning">
 Unsupervised Learning
 
 &lt;a class="anchor" href="#unsupervised-learning">#&lt;/a>
 
&lt;/h1>
&lt;p>Unsupervised Learning is used when we have input data but no target labels.&lt;/p>
&lt;p>The model is not told the correct answer. Instead, it tries to discover hidden structure in the data.&lt;/p>
&lt;ul>
&lt;li>K-means Clustering and variants&lt;/li>
&lt;li>Review of EM algorithm&lt;/li>
&lt;li>GMM based Soft Clustering&lt;/li>
&lt;li>Applications&lt;/li>
&lt;/ul>
&lt;hr>
&lt;h2 id="supervised-vs-unsupervised-learning">
 Supervised vs Unsupervised Learning
 
 &lt;a class="anchor" href="#supervised-vs-unsupervised-learning">#&lt;/a>
 
&lt;/h2>
&lt;table>
 &lt;thead>
 &lt;tr>
 &lt;th>Aspect&lt;/th>
 &lt;th>Supervised Learning&lt;/th>
 &lt;th>Unsupervised Learning&lt;/th>
 &lt;/tr>
 &lt;/thead>
 &lt;tbody>
 &lt;tr>
 &lt;td>Data contains target label?&lt;/td>
 &lt;td>Yes&lt;/td>
 &lt;td>No&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Learns from&lt;/td>
 &lt;td>Input-output pairs&lt;/td>
 &lt;td>Input features only&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Main goal&lt;/td>
 &lt;td>Predict output&lt;/td>
 &lt;td>Discover structure&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Example task&lt;/td>
 &lt;td>Classification, regression&lt;/td>
 &lt;td>Clustering&lt;/td>
 &lt;/tr>
 &lt;tr>
 &lt;td>Example algorithm&lt;/td>
 &lt;td>Logistic regression, decision tree&lt;/td>
 &lt;td>K-means, GMM&lt;/td>
 &lt;/tr>
 &lt;/tbody>
&lt;/table>
&lt;hr>
&lt;ul>
&lt;li>Works on &lt;strong>unlabelled raw data&lt;/strong>.&lt;/li>
&lt;li>The algorithm &lt;strong>discovers hidden patterns&lt;/strong> without prior knowledge of outcomes.&lt;/li>
&lt;li>Requires &lt;strong>no human intervention&lt;/strong> during training.&lt;/li>
&lt;li>Does not make direct predictions — it &lt;strong>groups or organises data&lt;/strong> instead.&lt;/li>
&lt;li>Carries a &lt;strong>higher risk&lt;/strong> because there’s no ground truth to verify results.&lt;/li>
&lt;li>Common techniques include &lt;strong>Clustering&lt;/strong>, &lt;strong>Association&lt;/strong>, and &lt;strong>Dimensionality Reduction&lt;/strong>.&lt;/li>
&lt;/ul>
&lt;p>The most common example is &lt;strong>clustering&lt;/strong>, where similar records are grouped together.&lt;/p></description></item></channel></rss>