Further Generalizations of the Jaccard Index

• URL: http://arxiv.org/abs/2110.09619v2
• Date: Wed, 20 Oct 2021 10:12:15 GMT
• Title: Further Generalizations of the Jaccard Index
• Authors: Luciano da F. Costa
• Abstract summary: Quantifying the similarity between two sets constitutes a particularly interesting and useful operation in several theoretical and applied problems involving set theory. The Jaccard index has been extensively used in the most diverse types of problems, also motivating respective generalizations. It is also posited that these indices can play an important role while analyzing and integrating datasets in modeling approaches and pattern recognition activities.
• Score: 1.0152838128195467
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Quantifying the similarity between two sets constitutes a particularly interesting and useful operation in several theoretical and applied problems involving set theory. Aimed at quantifying the similarity between two sets, the Jaccard index has been extensively used in the most diverse types of problems, also motivating respective generalizations. The present work addressew further generalizations of this index, including its modification into a coincidence index capable of accounting also for the level of interiority of the sets, an extension for sets in continuous vector spaces, the consideration of weights associated to the involved set elements, the generalization to multiset addition, densities and generic scalar fields, as well as a means to quantify the joint interdependence between random variables. The also interesting possibility to take into account more than two sets was also addressed, including the description of an index capable of quantifying the level of chaining between three sets. Several of the described and suggested generalizations have been illustrated with respect to numeric case examples. It is also posited that these indices can play an important role while analyzing and integrating datasets in modeling approaches and pattern recognition activities.

Related papers

• The common ground of DAE approaches. An overview of diverse DAE frameworks emphasizing their commonalities [0.0]
  We look for common ground by considering various index and regularity notions. We show why not only the index but also these canonical characteristic values are crucial to describe the properties of the DAE.
  arXiv  Detail & Related papers  (2024-12-20T13:05:01Z)
• Supervised Pattern Recognition Involving Skewed Feature Densities [49.48516314472825]
  The classification potential of the Euclidean distance and a dissimilarity index based on the coincidence similarity index are compared. The accuracy of classifying the intersection point between the densities of two adjacent groups is taken into account.
  arXiv  Detail & Related papers  (2024-09-02T12:45:18Z)
• An Overview and Comparison of Axiomatization Structures Regarding Inconsistency Indices' Properties in Pairwise Comparisons Methods [3.670919236694521]
  Inconsistency index is a function which maps every pairwise comparison matrix (PCM) into a real number. Inconsistency index can be considered more trustworthy when it satisfies a set of suitable properties.
  arXiv  Detail & Related papers  (2024-08-23T16:20:09Z)
• HiPerformer: Hierarchically Permutation-Equivariant Transformer for Time Series Forecasting [56.95572957863576]
  We propose a hierarchically permutation-equivariant model that considers both the relationship among components in the same group and the relationship among groups. The experiments conducted on real-world data demonstrate that the proposed method outperforms existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-05-14T05:11:52Z)
• Generalization Bounds for Set-to-Set Matching with Negative Sampling [2.3859169601259347]
  The problem of matching two sets of multiple elements, namely set-to-set matching, has received a great deal of attention in recent years. This paper aims to perform a generalization error analysis in set-to-set matching to reveal the behavior of the model in that task.
  arXiv  Detail & Related papers  (2023-02-25T05:05:59Z)
• Differentiated Relevances Embedding for Group-based Referring Expression Comprehension [57.52186959089885]
  Key of referring expression comprehension lies in capturing the cross-modal visual-linguistic relevance. We propose the multi-group self-paced relevance learning schema to adaptively assign within-group object-expression pairs with different priorities. Experiments on three standard REC benchmarks demonstrate the effectiveness and superiority of our method.
  arXiv  Detail & Related papers  (2022-03-12T09:09:48Z)
• On Similarity [1.0152838128195467]
  We develop a principled approach that takes the Kronecker's delta function of two scalar values as the prototypical reference for similarity quantification. Generalizations of these indices to take into account the sign of the scalar values were then presented and developed to multisets, vectors, and functions in real spaces. Several important results have been obtained, including the interpretation of the Jaccard index as a yielding implementation of the Kronecker's delta function.
  arXiv  Detail & Related papers  (2021-11-02T11:13:39Z)
• Compositional Attention: Disentangling Search and Retrieval [66.7108739597771]
  Multi-head, key-value attention is the backbone of the Transformer model and its variants. Standard attention heads learn a rigid mapping between search and retrieval. We propose a novel attention mechanism, called Compositional Attention, that replaces the standard head structure.
  arXiv  Detail & Related papers  (2021-10-18T15:47:38Z)
• A Dataset-Level Geometric Framework for Ensemble Classifiers [0.76146285961466]
  Majority voting and weighted majority voting are two commonly used combination schemes in ensemble learning. We present a group of properties of these two combination schemes formally under a dataset-level geometric framework.
  arXiv  Detail & Related papers  (2021-06-16T09:48:12Z)
• HAWKS: Evolving Challenging Benchmark Sets for Cluster Analysis [2.5329716878122404]
  Comprehensive benchmarking of clustering algorithms is difficult. There is no consensus regarding the best practice for rigorous benchmarking. We demonstrate the important role evolutionary algorithms play to support flexible generation of such benchmarks.
  arXiv  Detail & Related papers  (2021-02-13T15:01:34Z)
• Finite-Function-Encoding Quantum States [52.77024349608834]
  We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions. We investigate some of their structural properties.
  arXiv  Detail & Related papers  (2020-12-01T13:53:23Z)
• Learning from Aggregate Observations [82.44304647051243]
  We study the problem of learning from aggregate observations where supervision signals are given to sets of instances. We present a general probabilistic framework that accommodates a variety of aggregate observations. Simple maximum likelihood solutions can be applied to various differentiable models.
  arXiv  Detail & Related papers  (2020-04-14T06:18:50Z)

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.