85 citations · 177 across the 3 of their papers we have counts for
3 papers
Clustering with minimum spanning trees: How good can it be?
Marek Gagolewski, Anna Cena, Maciej Bartoszuk +1
Minimum spanning trees (MSTs) provide a convenient representation of datasets in numerous pattern recognition activities. Moreover, they are relatively fast to compute. In this pap…
Genie: A new, fast, and outlier-resistant hierarchical clustering algorithm
Marek Gagolewski, Maciej Bartoszuk, Anna Cena
The time needed to apply a hierarchical clustering algorithm is most often dominated by the number of computations of a pairwise dissimilarity measure. Such a constraint, for large…
Are Cluster Validity Measures (In)valid?
Marek Gagolewski, Maciej Bartoszuk, Anna Cena
Internal cluster validity measures (such as the Calinski-Harabasz, Dunn, or Davies-Bouldin indices) are frequently used for selecting the appropriate number of partitions a dataset…