37.What is true about complete linkage in hierarchical clustering?  A. We merge in each step the 2 clusters whose closest members have member have smallest distance  B. the inter cluster distance is defined as the shortest distance between two points (one point in each cluster)  C. distance between 2 clusters is defined as average distance between each points in one cluster to every point in other cluster  D. Clusters are separated by sparse regions based on density

In hierarchical clustering, which linkage method considers the maximum distance between points in the clusters when merging two clusters?Average linkageComplete linkageWard linkage Single linkage

The ______________ linkage criterion is a popular choice for hierarchical clustering, which merges the two clusters based on the mean distance between their points.Select one:a.Centroidb.Singlec.Averaged.Complete

In hierarchical clustering, what does the 'ward' linkage criterion aim to minimise?Number of clustersTotal within-cluster varianceMaximum distance between clustersSum of squared distances from each point to the nearest cluster centroid

In agglomerative hierarchical clustering, what happens when two clusters are merged?The original clusters remain unchangedThe number of clusters increases by oneThe distance matrix is updated to reflect the new clusterThe algorithm terminates

In hierarchical clustering, the distance between clusters is typically measured using the ______________ criterion.Select one:a.Cosine similarityb.Manhattan distancec.Linkage criteriond.Euclidean distance