Skip to main content

Clustering MCQ

Displaying 1 - 10 of 28

Hierarchical Clustering Algorithm: Given below are five data points having two attributes x and y:

Given below are five data points having two attributes x and y:

Observation x y
1 3 2
2 3 5
3 5 3
4 6 4
5 6 7

The distance matrix of the points, indicating the Euclidean distance between points, is as follows:

Label 1 2 3 4 5
1 0.00 3.00 2.24 3.61 5.83
2 3.00 0.00 2.83 3.16 3.61
3 2.24 2.83 0.00 1.41 4.12
4 3.61 3.16 1.41 0.00 3.00
5 5.83 3.61 4.12 3.00 0.00

Take the distance between two clusters as the minimum distance between the points in the two clusters. Based on this information, answer the following questions.

Subscribe to Clustering MCQ

About

At ProgramsBuzz, you can learn, share and grow with millions of techie around the world from different domain like Data Science, Software Development, QA and Digital Marketing. You can ask doubt and get the answer for your queries from our experts.