The evaluation of clustering results is difficult, highly dependent on t...
Partitioning Around Medoids (PAM, k-Medoids) is a popular clustering
tec...
Hierarchical Agglomerative Clustering (HAC) is likely the earliest and m...
Support Vector Machines have been successfully used for one-class
classi...
A major challenge when using k-means clustering often is how to choose t...
The evaluation of clustering results is difficult, highly dependent on t...
The merit of projecting data onto linear subspaces is well known from, e...
The graph edit distance is an intuitive measure to quantify the dissimil...
Finding the graphs that are most similar to a query graph in a large dat...
Many approaches in the field of machine learning and data analysis rely ...
Spherical k-means is a widely used clustering algorithm for sparse and
h...
Similarity search is a fundamental problem for many data analysis techni...
BIRCH clustering is a widely known approach for clustering, that has
inf...
The intrinsic dimensionality refers to the “true” dimensionality of the
...
This paper documents the release of the ELKI data mining framework, vers...
Clustering non-Euclidean data is difficult, and one of the most used
alg...
Many word clouds provide no semantics to the word placement, but use a r...