Ask
Login
0
2.7kviews
Use Data set in Appendix A. Create Adjacency Matrix. Use Single Link OR Complete Link Algorithm to Cluster given data set by drawing Dendogram.
written 8.2 years ago by gravatar for teamques10 teamques10 ★ 65k •   modified 8.2 years ago

enter image description here

This question appears in Mumbai University > Data Warehouse and Mining subject

Marks: 10 M

Year: Dec 2014
data warehouse and mining
ADD COMMENT EDIT
1 Answer
0
50views
written 8.2 years ago by gravatar for teamques10 teamques10 ★ 65k

Step 1: Identify the two clusters with the shortest distance in the matrix, and merge them together. Re-compute the distance matrix, as those two clusters are now in a single cluster.

enter image description here

By looking at the distance matrix above, we see the C and E have the smallest distance from all. …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.