Pointwise Metrics for Clustering Evaluation

• URL: http://arxiv.org/abs/2405.10421v1
• Date: Thu, 16 May 2024 19:49:35 GMT
• Title: Pointwise Metrics for Clustering Evaluation
• Authors: Stephan van Staden,
• Abstract summary: This paper defines pointwise clustering metrics, a collection of metrics for characterizing the similarity of two clusterings. The metric definitions are based on standard set-theoretic notions and are simple to understand. It is possible to assign metrics to individual items, clusters, arbitrary slices of items, and the overall clustering.
• Score: 0.0
• License:
• Abstract: This paper defines pointwise clustering metrics, a collection of metrics for characterizing the similarity of two clusterings. These metrics have several interesting properties which make them attractive for practical applications. They can take into account the relative importance of the various items that are clustered. The metric definitions are based on standard set-theoretic notions and are simple to understand. They characterize aspects that are important for typical applications, such as cluster homogeneity and completeness. It is possible to assign metrics to individual items, clusters, arbitrary slices of items, and the overall clustering. The metrics can provide deep insights, for example they can facilitate drilling deeper into clustering mistakes to understand where they happened, or help to explore slices of items to understand how they were affected. Since the pointwise metrics are mathematically well-behaved, they can provide a strong foundation for a variety of clustering evaluation techniques. In this paper we discuss in depth how the pointwise metrics can be used to evaluate an actual clustering with respect to a ground truth clustering.

Related papers

• KULCQ: An Unsupervised Keyword-based Utterance Level Clustering Quality Metric [0.5671051073036456]
  Keywords-based Utterance Level Clustering Quality (KULCQ) is an unsupervised metric that leverages keyword analysis to evaluate clustering quality. Our results show that KULCQ better captures semantic relationships in conversational data while maintaining consistency with geometric clustering principles.
  arXiv  Detail & Related papers  (2024-11-15T00:21:02Z)
• Can an unsupervised clustering algorithm reproduce a categorization system? [1.0485739694839669]
  We investigate whether unsupervised clustering can reproduce ground truth classes in a labeled dataset. We show that success depends on feature selection and the chosen distance metric.
  arXiv  Detail & Related papers  (2024-08-19T18:27:14Z)
• ABCDE: Application-Based Cluster Diff Evals [49.1574468325115]
  It aims to be practical: it allows items to have associated importance values that are application-specific, it is frugal in its use of human judgements when determining which clustering is better, and it can report metrics for arbitrary slices of items. The approach to measuring the delta in the clustering quality is novel: instead of trying to construct an expensive ground truth up front and evaluating the each clustering with respect to that, ABCDE samples questions for judgement on the basis of the actual diffs between the clusterings.
  arXiv  Detail & Related papers  (2024-07-31T08:29:35Z)
• Algorithm-Agnostic Interpretations for Clustering [0.0]
  We propose algorithm-agnostic interpretation methods to explain clustering outcomes in reduced dimensions. The permutation feature importance for clustering represents a general framework based on shuffling feature values. All methods can be used with any clustering algorithm able to reassign instances through soft or hard labels.
  arXiv  Detail & Related papers  (2022-09-21T18:08:40Z)
• Normalised clustering accuracy: An asymmetric external cluster validity measure [2.900810893770134]
  Clustering algorithms are traditionally evaluated using either internal or external validity measures. In this paper, we argue that the commonly used classical partition similarity scores miss some desirable properties. We propose and analyse a new measure: a version of the optimal set-matching accuracy.
  arXiv  Detail & Related papers  (2022-09-07T05:08:34Z)
• On the Intrinsic and Extrinsic Fairness Evaluation Metrics for Contextualized Language Representations [74.70957445600936]
  Multiple metrics have been introduced to measure fairness in various natural language processing tasks. These metrics can be roughly categorized into two categories: 1) emphextrinsic metrics for evaluating fairness in downstream applications and 2) emphintrinsic metrics for estimating fairness in upstream language representation models.
  arXiv  Detail & Related papers  (2022-03-25T22:17:43Z)
• You Never Cluster Alone [150.94921340034688]
  We extend the mainstream contrastive learning paradigm to a cluster-level scheme, where all the data subjected to the same cluster contribute to a unified representation. We define a set of categorical variables as clustering assignment confidence, which links the instance-level learning track with the cluster-level one. By reparametrizing the assignment variables, TCC is trained end-to-end, requiring no alternating steps.
  arXiv  Detail & Related papers  (2021-06-03T14:59:59Z)
• Towards Improved and Interpretable Deep Metric Learning via Attentive Grouping [103.71992720794421]
  Grouping has been commonly used in deep metric learning for computing diverse features. We propose an improved and interpretable grouping method to be integrated flexibly with any metric learning framework.
  arXiv  Detail & Related papers  (2020-11-17T19:08:24Z)
• Quantifying Learnability and Describability of Visual Concepts Emerging in Representation Learning [91.58529629419135]
  We consider how to characterise visual groupings discovered automatically by deep neural networks. We introduce two concepts, visual learnability and describability, that can be used to quantify the interpretability of arbitrary image groupings.
  arXiv  Detail & Related papers  (2020-10-27T18:41:49Z)
• Scalable Hierarchical Agglomerative Clustering [65.66407726145619]
  Existing scalable hierarchical clustering methods sacrifice quality for speed. We present a scalable, agglomerative method for hierarchical clustering that does not sacrifice quality and scales to billions of data points.
  arXiv  Detail & Related papers  (2020-10-22T15:58:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.