85 citations · 177 across the 3 of their papers we have counts for
Showing stat.MLShow all
2 papers · 1 filter
stat.ML2023★ 21 cited
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…
stat.ML2022★ 71 cited
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…