-- Nov 30 In-Class Exercise Thread
Our initial forests are the three vectors (1,2,3), (4,5,6), (5,6,7)
And we want the k=2 most important clusters
We will cycle through each pairs of the trees and compute the
square euclidean distance.
The pairs are as follows
((1,2,3), (4,5,6)) ((1,2,3), (5,6,7)) ((4,5,6), (5,6,7))
The square euclidean distances are 27, 48, and 3
Pairs ((4,5,6), (5,6,7)) are nearest.
We delete these two trees from the forest. Let E' = (4.5, 5.5, 6.5).
We make a new tree T' with root label E' and subtrees (4,5,6) and (5,6,7)
Our new forest have two trees: (1,2,3) and (4.5, 5.5, 6.5)
We have exactly 2 trees in the forest, which
is equal to k. Our output is (1,2,3) and (4.5, 5.5, 6.5)
Our initial forests are the three vectors (1,2,3), (4,5,6), (5,6,7)
And we want the k=2 most important clusters
We will cycle through each pairs of the trees and compute the
square euclidean distance.
The pairs are as follows
((1,2,3), (4,5,6)) ((1,2,3), (5,6,7)) ((4,5,6), (5,6,7))
The square euclidean distances are 27, 48, and 3
Pairs ((4,5,6), (5,6,7)) are nearest.
We delete these two trees from the forest. Let E' = (4.5, 5.5, 6.5).
We make a new tree T' with root label E' and subtrees (4,5,6) and (5,6,7)
Our new forest have two trees: (1,2,3) and (4.5, 5.5, 6.5)
We have exactly 2 trees in the forest, which
is equal to k. Our output is (1,2,3) and (4.5, 5.5, 6.5)