K-means is comparatively simple and works well with large datasets, but it assumes clusters are circular/spherical in shape, so it can only find simple cluster geometries. Data clustering is the ...
In this paper, the authors contain a partitional based algorithm for clustering high-dimensional objects in subspaces for iris gene dataset. In high dimensional data, clusters of objects often exist ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback