5 Questions
What is the main difference between agglomerative and divisive hierarchical clustering algorithms?
Agglomerative algorithms merge clusters from the bottom-up, while divisive algorithms divide one big cluster into smaller clusters from the top-down.
What does a root node represent in a dendrogram?
A cluster formed after merging two or more smaller clusters.
Which method uses the distance between the closest members of two clusters in agglomerative hierarchical clustering?
Single linkage
What is the purpose of a dendrogram in hierarchical clustering?
To represent the hierarchy of clusters and the process of merging or dividing clusters.
What is represented by leaf nodes in a dendrogram?
Individual data points
Learn about the different categories of hierarchical clustering algorithms, including agglomerative and divisive approaches and how they group data points into clusters.
Make Your Own Quizzes and Flashcards
Convert your notes into interactive study material.
Get started for free
