0
$\begingroup$

I'm studying unsupervised learning methods (clustering) and i've seen the Complete Linkage Method. I've also seen the following statement:

Unlike single linkage, the complete linkage method can be strongly affected by draw cases (where there are 2 groups/clusters with the same distance value in the distance matrix).

I'd like an example where this occurs and, if possible, an explanation why this occur.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.