Sparse Partitioning Around Medoids. - Lars Lenssen; Erich Schubert (Mach. Learn. under Resour. Constraints Vol. 1 (1), 2022)

Clustering by Direct Optimization of the Medoid Silhouette. - Lars Lenssen; Erich Schubert (SISAP, 2022)

Fast k-medoids Clustering in Rust and Python. - Erich Schubert; Lars Lenssen (J. Open Source Softw., 2022)

Fast k-Nearest-Neighbor-Consistent Clustering. - Lars Lenssen; Niklas Strahmann; Erich Schubert (LWDA, 2023)

Sparse Partitioning Around Medoids. - Lars Lenssen; Erich Schubert (CoRR, 2023)

Medoid Silhouette clustering with automatic cluster number selection. - Lars Lenssen; Erich Schubert (Inf. Syst., 2024)