An Improved Algorithm Based on Divide-and-Merge Clustering Algorithm
BNAK-Divide-and-Merge clustering algorithm is an improved algorithm which is based on the Divide-and-Merge clustering algorithm proposed by David et al. Divide-and-Merge is a methodology which combines a top-down divide method with a bottom-up merge method. Although it has been proved to be a method with high efficiency and quality of clustering by implementing lots of relevant experiment, its divide phase will consume too much time and space resources when it is applied to very huge sets; furthermore the method which can figure out the number of clustering with a threshold is also not best. Accordingly, improves the original algorithm to overcome the two major flaws mentioned above.