research
∙
09/07/2023
Medoid Silhouette clustering with automatic cluster number selection
The evaluation of clustering results is difficult, highly dependent on t...
share
research
∙
09/05/2023
Sparse Partitioning Around Medoids
Partitioning Around Medoids (PAM, k-Medoids) is a popular clustering tec...
research
∙
09/05/2023
Data Aggregation for Hierarchical Clustering
Hierarchical Agglomerative Clustering (HAC) is likely the earliest and m...
research
∙
12/27/2022
LOSDD: Leave-Out Support Vector Data Description for Outlier Detection
Support Vector Machines have been successfully used for one-class classi...
research
∙
12/23/2022
Stop using the elbow criterion for k-means and how to choose the number of clusters instead
A major challenge when using k-means clustering often is how to choose t...
research
∙
09/26/2022
Clustering by Direct Optimization of the Medoid Silhouette
The evaluation of clustering results is difficult, highly dependent on t...
research
∙
09/26/2022
On Projections to Linear Subspaces
The merit of projecting data onto linear subspaces is well known from, e...
research
∙
11/15/2021
EmbAssi: Embedding Assignment Costs for Similarity Search in Large Graph Databases
The graph edit distance is an intuitive measure to quantify the dissimil...
research
∙
10/04/2021
Metric Indexing for Graph Similarity Search
Finding the graphs that are most similar to a query graph in a large dat...
research
∙
07/14/2021
MESS: Manifold Embedding Motivated Super Sampling
Many approaches in the field of machine learning and data analysis rely ...
research
∙
07/08/2021
Accelerating Spherical k-Means
Spherical k-means is a widely used clustering algorithm for sparse and h...
research
∙
07/08/2021
A Triangle Inequality for Cosine Similarity
Similarity search is a fundamental problem for many data analysis techni...
research
∙
06/23/2020
BETULA: Numerically Stable CF-Trees for BIRCH Clustering
BIRCH clustering is a widely known approach for clustering, that has inf...
research
∙
06/23/2020
ABID: Angle Based Intrinsic Dimensionality
The intrinsic dimensionality refers to the “true” dimensionality of the ...
research
∙
02/10/2019
ELKI: A large open-source library for data analysis - ELKI Release 0.7.5 "Heidelberg"
This paper documents the release of the ELKI data mining framework, vers...
research
∙
10/12/2018
Faster k-Medoids Clustering: Improving the PAM, CLARA, and CLARANS Algorithms
Clustering non-Euclidean data is difficult, and one of the most used alg...
research
∙
08/11/2017
