From c12b867db55a707bcfb258ad44bc925c6d745c3f Mon Sep 17 00:00:00 2001
From: Sothea <62893090+hassothea@users.noreply.github.com>
Date: Wed, 6 Nov 2024 13:21:22 +0700
Subject: [PATCH] Update TP4_Clustering.html

---
 TPs/TP4_Clustering.html | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/TPs/TP4_Clustering.html b/TPs/TP4_Clustering.html
index 4b5dd9e..a623b2f 100644
--- a/TPs/TP4_Clustering.html
+++ b/TPs/TP4_Clustering.html
@@ -166,9 +166,9 @@ <h2 class="anchored" data-anchor-id="kmeans-algorithm">1. Kmeans Algorithm</h2>
 </div>
 </section>
 <section id="hirachical-clustering" class="level2">
-<h2 class="anchored" data-anchor-id="hirachical-clustering">2. <a href="https://en.wikipedia.org/wiki/Hierarchical_clustering">Hirachical clustering</a></h2>
-<p>Unlike <code>Kmeans</code> algrithm, <code>Hirachical clustering</code> or <code>hcluster</code> does not require a prior number of clusters. It iteratively merges (agglomerative or bottom up approach) into less and less clusters starting from each points being a cluster on its own, or separate the data point (divisive or top-down approach) to create more and more clusters starting from one clsuter containing all data points.</p>
-<p><strong>a.</strong> Apply Hirachical cluster on the previously simulated dataset.</p>
+<h2 class="anchored" data-anchor-id="hirachical-clustering">2. <a href="https://en.wikipedia.org/wiki/Hierarchical_clustering">Hierarchical clustering</a></h2>
+<p>Unlike <code>Kmeans</code> algrithm, <code>Hierarchical clustering</code> or <code>hcluster</code> does not require a prior number of clusters. It iteratively merges (agglomerative or bottom up approach) into less and less clusters starting from each points being a cluster on its own, or separate the data point (divisive or top-down approach) to create more and more clusters starting from one clsuter containing all data points.</p>
+<p><strong>a.</strong> Apply Hierarchical cluster on the previously simulated dataset.</p>
 <div id="cell-14" class="cell" data-execution_count="5">
 <div class="sourceCode cell-code" id="cb5"><pre class="sourceCode python code-with-copy"><code class="sourceCode python"><span id="cb5-1"><a href="#cb5-1" aria-hidden="true" tabindex="-1"></a><span class="co"># To do</span></span></code><button title="Copy to Clipboard" class="code-copy-button"><i class="bi"></i></button></pre></div>
 </div>
@@ -214,9 +214,9 @@ <h1>Further Readings</h1>
 <ul>
 <li><a href="https://en.wikipedia.org/wiki/K-means_clustering">Kmeansclustering</a></li>
 <li><a href="https://www.youtube.com/watch?v=VcgIVW9M6D8&amp;list=PLjTHlzp3MwkHq_WKcUtxXoeOHrPWFJIKF&amp;index=2&amp;ab_channel=SmallThings">Video: Kmean algorithm via vector quantization</a></li>
-<li><a href="https://en.wikipedia.org/wiki/Hierarchical_clustering">Hirachical clustering</a></li>
+<li><a href="https://en.wikipedia.org/wiki/Hierarchical_clustering">Hierarchical clustering</a></li>
 <li><a href="https://scikit-learn.org/1.5/modules/generated/sklearn.cluster.KMeans.html">KMeans, Sklearn</a></li>
-<li><a href="https://scikit-learn.org/1.5/modules/generated/sklearn.cluster.AgglomerativeClustering.html#sklearn.cluster.AgglomerativeClustering">Hirachical Clustering: AgglomerativeClustering, Sklearn</a></li>
+<li><a href="https://scikit-learn.org/1.5/modules/generated/sklearn.cluster.AgglomerativeClustering.html#sklearn.cluster.AgglomerativeClustering">Hierarchical Clustering: AgglomerativeClustering, Sklearn</a></li>
 </ul>
 </section>
 
@@ -647,4 +647,4 @@ <h1>Further Readings</h1>
 
 
 
-</body></html>
\ No newline at end of file
+</body></html>