Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit bd6233d

Browse files
authored
Update 04 - Clustering.ipynb
1 parent edad4b2 commit bd6233d

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

04 - Clustering.ipynb

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -233,7 +233,7 @@
233233
"- Complete or Maximal linkage uses the maximum distance between the members of the two clusters.\n",
234234
"\n",
235235
"Several different distance metrics are used to compute linkage functions:\n",
236-
"- Euclidian or l2 distance is the most widely used. This metric is only choice for the Ward linkage method.\n",
236+
"- Euclidian or l2 distance is the most widely used. This is the only metric for the Ward linkage method.\n",
237237
"- Manhattan or l1 distance is robust to outliers and has other interesting properties.\n",
238238
"- Cosine similarity, is the dot product between the location vectors divided by the magnitudes of the vectors. Notice that this metric is a measure of similarity, whereas the other two metrics are measures of difference. Similarity can be quite useful when working with data such as images or text documents.\n",
239239
"\n",

0 commit comments

Comments
 (0)