Search Results for author:
Found 4 papers, 1 papers with code
Clustering via Boundary Erosion
In order to detect clusters in arbitrary shapes, a novel and generic solution based on boundary erosion is proposed.
Fast k-means based on KNN Graph
In the k-means iteration, each data sample is only compared to clusters that its nearest neighbors reside.
Scalable Nearest Neighbor Search based on kNN Graph
In this paper, a scalable solution based on hill-climbing strategy with the support of k-nearest neighbor graph (kNN) is presented.
Boost K-Means
The performance of k-means has been enhanced from different perspectives over the years.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
