Evaluating single-cell cluster stability using the Jaccard similarity index
نویسندگان
چکیده
منابع مشابه
Evaluating the Jaccard-Tanimoto Index on Multi-core Architectures
The Jaccard/Tanimoto coefficient is an important workload, used in a large variety of problems including drug design fingerprinting, clustering analysis, similarity web searching and image segmentation. This paper evaluates the Jaccard coefficient on the the Cell/B.E.processor and the Intel R ©Xeon R ©dual-core platform. In our work, we have developed a novel parallel algorithm specially suited...
متن کاملNew Similarity Measures Between Generalized Trapezoidal Fuzzy Numbers Using the Jaccard Index
Similarity measures between generalized trapezoidal fuzzy numbers (GTFNs) are employed to indicate the degrees of similarity between GTFNs. Although several similarity measures of GTFNs have been proposed in the literature, none has considered using the Jaccard index. In general, the Jaccard index is a statistic used for comparing the similarity and diversity of sample sets. This paper presents...
متن کاملUnilateral Jaccard Similarity Coefficient
Similarity measures are essential to solve many pattern recognition problems such as classification, clustering, and retrieval problems. Various similarity measures are categorized in both syntactic and semantic relationships. In this paper we present a novel similarity, Unilateral Jaccard Similarity Coefficient (uJaccard), which doesn’t only take into consideration the space among two points b...
متن کاملCorrecting Jaccard and other similarity indices for chance agreement in cluster analysis
Correcting a similarity index for chance agreement requires computing its expectation under fixed marginal totals of a matching counts matrix. For some indices, such as Jaccard, Rogers and Tanimoto, Sokal and Sneath, and Gower and Legendre the expectations cannot be easily found. We show how such similarity indices can be expressed as functions of other indices and expectations found by approxi...
متن کاملHyperMinHash: Jaccard index sketching in LogLog space
In this extended abstract, we describe and analyse a streaming probabilistic sketch, HYPERMINHASH, to estimate the Jaccard index (or Jaccard similarity coefficient) over two sets A and B. HyperMinHash can be thought of as a compression of standard logn-space MinHash by building off of a HyperLogLog count-distinct sketch. For a multiplicative approximation error 1+ on a Jaccard index t, given a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2020
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btaa956