Lars Lenssen

 Lars Lenssen
Lars Lenssen
Room: OH14 R335
Phone: +49 231/755-8254
lars lenssen () tu-dortmund de

PhD student working on clustering objectives.

Publication list

2024

Lars Lenssen and Erich Schubert.
Medoid Silhouette clustering with automatic cluster number selection
In: Information Systems 120, 102290, 2024.
[DOI: 10.1016/j.is.2023.102290] | [preprint (arXiv)] | [BibTeX]

2023

Lars Lenssen and Erich Schubert.
Sparse Partitioning Around Medoids
In: Machine Learning under Resource Constraints -- Fundamentals 1, 182-196, 2023.
[DOI: 10.1515/9783110785944-005] | [preprint (arXiv)] | [BibTeX]
Lars Lenssen, Niklas Strahmann and Erich Schubert.
Fast k-Nearest-Neighbor-Consistent Clustering
In: Proceedings of the Conference "Lernen, Wissen, Daten, Analysen" (LWDA), Marburg, Germany, 2023, to appear, KDML best paper award.
[BibTeX]

2022

Lars Lenssen and Erich Schubert.
Clustering by Direct Optimization of the Medoid Silhouette
In: Similarity Search and Applications - 15th International Conference, SISAP 2022, Bologna, Italy, October 5-7, 2022, Proceedings, 190-204, 2022, best student paper award.
[DOI: 10.1007/978-3-031-17849-8_15] | [Preprint (arXiv)] | [BibTeX]
Erich Schubert and Lars Lenssen.
Fast k-medoids Clustering in Rust and Python
In: J. Open Source Softw. 7(75), 4183, 2022.
[DOI: 10.21105/joss.04183] | [BibTeX]
Erich Schubert and Lars Lenssen.
Fast k-medoids Clustering in Rust and Python
Open-Source software, Zenodo, 2022.
[DOI: 10.5281/zenodo.6802320] | [BibTeX]