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 hierarchical clustering, which linkage method considers the maximum distance between points in the clusters when merging two clusters?Complete linkageAverage linkageSingle linkageWard linkage

How is the optimal number of clusters determined in hierarchical clustering?*1 pointBy minimizing the between-cluster sum of squaresBy maximizing the within-cluster sum of squaresBy examining the dendrogram and selecting an appropriate cut-off pointBy using the elbow method on the resulting tree structure

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

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 agglomerative hierarchical clustering, what does the algorithm begin with?1 pointEach data point in a separate clusterAll data points in one clusterA predefined number of clustersThe optimal number of clusters