An Analytical Approach to the Jaccard Similarity Index
read the original abstract
The Jaccard similarity index has often been employed in science and technology as a means to quantify the similarity between two sets. When modified to operate on real-valued values, the Jaccard similarity index can be applied to compare vectors, an operation which plays a central role in visualization, classification, and modeling. The present work aims at developing an analytical approach for estimating the probability density of the Jaccard similarity values as implied by set of data elements characterized by specific statistical densities, with emphasis on the uniform and normal cases. Several theoretical and practical situations can benefit directly from such an approach, as it allows several of the properties of the similarity comparisons among a given dataset to be better understood and anticipated. Situations in which the described approach can be applied include the estimation and visualization of data interrelationships in terms of similarity networks, as well as diverse problems in data analysis, pattern recognition and scientific modeling. In addition to presenting the analytical developments and results, examples are also provided in order to illustrate the potential of the approach. The work also includes extension of the reported developments to modifications of the Jaccard index intended for regularization and control of the sharpness of the implemented comparisons.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Forecasting the Maintained Score from the OpenSSF Scorecard: A Study of GitHub Repositories Linked to PyPI Packages
Machine learning models forecast future OpenSSF Maintained scores on PyPI-linked GitHub repos with accuracies above 0.95 for bucketed maintenance levels and 0.79 for trend categories.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.