Search Results for author:
Found 3 papers, 2 papers with code
Medoid Silhouette clustering with automatic cluster number selection
We discuss the efficient medoid-based variant of the Silhouette, perform a theoretical analysis of its properties, provide two fast versions for the direct optimization, and discuss the use to choose the optimal number of clusters.
Sparse Partitioning Around Medoids
FastPAM recently introduced a speedup for large k to make it applicable for larger problems, but the method still has a runtime quadratic in N. In this chapter, we discuss a sparse and asymmetric variant of this problem, to be used for example on graph data such as road networks.
Clustering by Direct Optimization of the Medoid Silhouette
One of the versions guarantees equal results to the original variant and provides a run speedup of $O(k^2)$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
