A Family of Metrics for Clustering Algorithms

07/27/2017
by   Clark Alexander, et al.
0

We give the motivation for scoring clustering algorithms and a metric M : A →N from the set of clustering algorithms to the natural numbers which we realize as M(A) = ∑_i α_i |f_i - β_i|^w_i 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2013

A Bayesian Method Reexamined

This paper examines the "K2" network scoring metric of Cooper and Hersko...
research
10/22/2021

Validation of point process predictions with proper scoring rules

We introduce a class of proper scoring rules for evaluating spatial poin...
research
03/01/2022

Sensitivity Measures Based on Scoring Functions

We propose a holistic framework for constructing sensitivity measures fo...
research
11/22/2019

Responsible Scoring Mechanisms Through Function Sampling

Human decision-makers often receive assistance from data-driven algorith...
research
11/23/2020

Ensemble- and Distance-Based Feature Ranking for Unsupervised Learning

In this work, we propose two novel (groups of) methods for unsupervised ...
research
12/31/2021

Clustering Vietnamese Conversations From Facebook Page To Build Training Dataset For Chatbot

The biggest challenge of building chatbots is training data. The require...
research
04/04/2021

OnTarget: An Electronic Archery Scoring

There are several challenges in creating an electronic archery scoring s...

Please sign up or login with your details

Forgot password? Click here to reset