Software

Data Clustering with Leaders and Subleaders Algorithm

Free registration required

Executive Summary

In this paper, an efficient hierarchical clustering algorithm, suitable for large data sets is proposed for effective clustering and prototype selection for pattern classification. It is another simple and efficient technique which uses incremental clustering principles to generate a hierarchical structure for finding the subgroups/subclusters within each cluster. As an example, a two level clustering algorithm-leaders-subleaders, an extension of the leader algorithm is presented. Classification Accuracy (CA) obtained using the representatives generated by the leaders-subleaders method is found to be better than that of using leaders as representatives. Even if more number of prototypes are generated, classification time is less as only a part of the hierarchical structure is searched.

  • Format: PDF
  • Size: 433.2 KB