Before I sleep today I will produce the HCA tree. I don't want to spend any more time being confused about which two nodes should be next to each other.
I'll be coding in Java, the algorithm will be similar to huffman encoding.
sudo code:
given confusion matrix, create nodes that represent each node's similarity. Use greedy approach (approximation) to construct the first pair, then proceed from there.
I don't particularly know if this'll work but I'll start from there.
No comments:
Post a Comment