Introduction to Data Mining
1. Given the following distance matrix of four data points 1, 2, 3, and 4:
( Requirement: Report all the partial trees and matrices for the intermediate steps.)
|
|
1 |
2 |
3 |
4 |
|
1 |
0 |
|
|
|
|
2 |
20 |
0 |
|
|
|
3 |
5 |
25 |
0 |
|
|
4 |
15 |
40 |
20 |
0 |
Perform hierarchical clustering using single-linkage, complete linkage, and average linkage similarity measures (30 points);