Lars Lenssen

According to our database, Lars Lenssen authored at least 6 papers between 2022 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Medoid Silhouette clustering with automatic cluster number selection.

Lars Lenssen, Erich Schubert

Inf. Syst., February, 2024

2023

Sparse Partitioning Around Medoids.

Lars Lenssen, Erich Schubert

CoRR, 2023

Fast k-Nearest-Neighbor-Consistent Clustering.

Lars Lenssen, Niklas Strahmann, Erich Schubert

Proceedings of the Lernen, 2023

2022

Fast k-medoids Clustering in Rust and Python.

Erich Schubert, Lars Lenssen

J. Open Source Softw., 2022

Clustering by Direct Optimization of the Medoid Silhouette.

Lars Lenssen, Erich Schubert

Proceedings of the Similarity Search and Applications - 15th International Conference, 2022

Sparse Partitioning Around Medoids.

Lars Lenssen, Erich Schubert

Proceedings of the Machine Learning under Resource Constraints - Volume 1: Fundamentals, 2022