A k-means-type algorithm is proposed for efficiently clustering data constrained to lie on the surface of a p-dimensional unit sphere, or data that are mean-zero-unit-variance standardized ...

Based on the full analysis of the advantages and disadvantages of the traditional K - means and BIRCH clustering algorithms, an improved incremental clustering algorithm based on the core tree is ...