A Family of Metrics for Clustering Algorithms
Clark Alexander, Sofya Akhmametyeva

TL;DR
This paper introduces a flexible family of metrics for evaluating clustering algorithms based on feature scores like stability and noise sensitivity, with a method to empirically determine scoring parameters.
Contribution
It proposes a new scoring metric for clustering algorithms that incorporates multiple feature-based scores with empirically derived parameters.
Findings
Defined a mathematical form for the metric M(A)
Provided a method to score features like stability and noise sensitivity
Presented a sample set of scores for evaluation
Abstract
We give the motivation for scoring clustering algorithms and a metric from the set of clustering algorithms to the natural numbers which we realize as \begin{equation} M(A) = \sum_i \alpha_i |f_i - \beta_i|^{w_i} \end{equation} where are parameters used for scoring the feature , which is computed empirically.. We give a method by which one can score features such as stability, noise sensitivity, etc and derive the necessary parameters. We conclude by giving a sample set of scores.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Advanced Clustering Algorithms Research · Data Mining Algorithms and Applications
