What is the final resultant cluster size in Divisive algorithm, which is one of the hierarchical clustering approaches?

zero
three
singleton
two

The correct answer is: D. two

Divisive clustering is a hierarchical clustering algorithm that starts with a single cluster containing all the data points. The algorithm then recursively splits the cluster into two smaller clusters until each cluster contains only one data point. The final resultant cluster size in Divisive algorithm is two.

Option A is incorrect because the final resultant cluster size in Divisive algorithm is two, not zero.

Option B is incorrect because the final resultant cluster size in Divisive algorithm is two, not three.

Option C is incorrect because the final resultant cluster size in Divisive algorithm is two, not singleton.

Exit mobile version