Skip to main navigation Skip to search Skip to main content

Two-Group k-Adic Similarity Coefficients for Binary Classifiers

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

When using two different sets of binary classification rules on the same items, we obtain two sets of binary vectors. We can, for example, consider the case of two groups of doctors with different experiences classifying patients as diseased or disease-free or two sets of different algorithms classifying consumers as churners or non-churners. In this paper, we propose to extend the well-known Jaccard coefficient and simple matching coefficient to quantify the similarity between two sets of binary vectors. The generalization will be based on the k-adic definition of similarity within sets. We derive the large sample variances of the new coefficients, investigate desirable properties of the established similarity coefficients, and present the applications to real-world datasets.
Original languageEnglish
Pages (from-to)391-413
Number of pages23
JournalJournal of Classification
Volume42
Issue number2
Early online date1 Dec 2024
DOIs
Publication statusPublished - Jul 2025

Keywords

  • Similarity
  • Binary sets
  • Consensus agreement
  • Jaccard coefficient
  • Simple matching coefficient
  • RESEMBLANCE MEASURES
  • MEASURING AGREEMENT
  • LOW KAPPA
  • ABSENCE
  • ASSOCIATION

Fingerprint

Dive into the research topics of 'Two-Group k-Adic Similarity Coefficients for Binary Classifiers'. Together they form a unique fingerprint.

Cite this