Traditional hierarchical clustering algorithms require the calculation of a dissimilarity matrix which is mapped to a binary tree or 'dendogram' based upon some predetermined criterion. Although 'optimally efficient' algorithms requiring O(N2) time and O(N) storage are known for several clustering m...
No comments yet
Be the first to share your thoughts!