Quiz collegato alla guida · Medio Livello

Quiz sul clustering gerarchico

Leggi le altezze del dendrogramma, distingui le regole di collegamento e comprendi come le scelte di ridimensionamento e taglio influiscono sui risultati del clustering gerarchico.

Percorsi guida correlatiClustering gerarchico
Domanda 1 di 8

Quale sequenza costruisce il clustering gerarchico agglomerativo?

Anteprima di ogni domanda8 domande

Le risposte e le spiegazioni vengono visualizzate mentre rispondi al quiz.

  1. Quale sequenza costruisce il clustering gerarchico agglomerativo?
    • Repeated cluster merges from individual observations toward larger groups
    • Repeatedly split one cluster into smaller groups from the top down
    • Assign each point to a fixed centroid and update those centroids
    • Join each point to its nearest neighbor once without building nested groups
  2. Which rule defines single linkage between two clusters?
    • The maximum pairwise distance across clusters
    • The minimum pairwise distance across clusters
    • The average of all pairwise distances
    • The increase in within-cluster sum of squares
  3. Quale collegamento utilizza la coppia di cluster incrociati più lontana?
    • Average linkage
    • Single linkage
    • Complete linkage
    • Ward linkage
  4. Cosa codifica l'altezza di fusione di un dendrogramma?
    • The p-value for a test that the two groups differ
    • The number of observations contained in the merged branch
    • The proportion of observations assigned to the left child
    • The linkage distance or criterion value at that merge
  5. Perché può essere utile un grande salto nell’altezza del dendrogramma?
    • It proves the exact number of natural populations
    • It may suggest candidate cuts that keep separated branches apart
    • It means every leaf is an outlier
    • It identifies the optimal feature scaling
  6. Perché il collegamento singolo può creare uno schema di concatenamento?
    • It requires all points to be equally distant
    • It uses the average distance between every pair
    • A sequence of near neighbors can connect otherwise elongated groups
    • It minimizes centroid variance
  7. What does Ward linkage seek to minimize when merging?
    • The entropy of labels
    • The largest single pairwise distance only
    • The number of leaves in the tree
    • The increase in within-cluster sum of squares
  8. Why standardize features before Euclidean hierarchical clustering when units vary greatly?
    • Otherwise a large-scale feature can dominate distances
    • Scaling changes the dendrogram into a supervised model
    • It forces average linkage to equal Ward linkage
    • It guarantees that the chosen cut is stable