Sparcl finds shape-based clusters. It uses a two step approach: in the first step we select a relatively large number of candidate centroids (via ROBIN) to find seed clusters via the K-means algorithm and in the second step we use a novel similarity kernel to merge the initial seed clusters to yield the final arbitrary shaped clusters.
- C++ Compiler
:: MORE INFORMATION
Vineet Chaoji, Mohammad Al Hasan, Saeed Salem and Mohammed J. Zaki (2009)
SPARCL: An Effective and Efficient Algorithm for Mining Arbitrary Shape-based Clusters.
Knowledge and Information Systems, 21(2), Nov, pp.201-229.