A Family of Metrics for Clustering Algorithms

July 27, 2017 ยท The Ethereal ยท ๐Ÿ› arXiv.org

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Clark Alexander, Sofya Akhmametyeva arXiv ID 1707.08912 Category cs.DM: Discrete Mathematics Cross-listed cs.AI, cs.CG Citations 1 Venue arXiv.org Last Checked 5 months ago
Abstract
We give the motivation for scoring clustering algorithms and a metric $M : A \rightarrow \mathbb{N}$ from the set of clustering algorithms to the natural numbers which we realize as \begin{equation} M(A) = \sum_i ฮฑ_i |f_i - ฮฒ_i|^{w_i} \end{equation} where $ฮฑ_i,ฮฒ_i,w_i$ are parameters used for scoring the feature $f_i$, 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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Discrete Mathematics