Consider the clustering solution obtained in Question 5 of Tutorial 10. Which of the following whiskeys end up in the same cluster as Bunnahabhain?

When using clustering, a target variable does not have to be precisely defined at training time.

The choice of linkage usually does not have much effect on the final clustering solution.

Finding the characteristics that differentiate the most profitable customers from the less profitable customers is an example of an unsupervised learning task.

The k-means clustering algorithm automatically adjusts the number of clusters.

The single link agglomerative clustering algorithm groups two clusters on the basis of the maximum distance between points in the two clusters.

Hierarchical clustering methods require a predefined number of clusters, much like k-means.

Which of the following statements is not true about clustering?

Which of the following is not a linkage function in hierarchical clustering?