What is the main difference between K-means and hierarchical clustering?
Practice Questions
Q1
What is the main difference between K-means and hierarchical clustering?
K-means is a partitional method, while hierarchical is a divisive method
K-means requires the number of clusters to be defined, while hierarchical does not
K-means can only be used for numerical data, while hierarchical can handle categorical data
K-means is faster than hierarchical clustering for small datasets
Questions & Step-by-Step Solutions
What is the main difference between K-means and hierarchical clustering?
Correct Answer: K-means is partitional, hierarchical is tree-based.
Step 1: Understand that K-means is a method that groups data into a specific number of clusters that you choose beforehand.
Step 2: Realize that hierarchical clustering creates a tree-like structure of clusters, allowing you to see how clusters are related without needing to decide on the number of clusters first.
Step 3: Remember that K-means requires you to set the number of clusters (like 3 clusters), while hierarchical clustering can show you many clusters and how they connect.
