+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the expected error for estimating the Jaccard index using MinHash scheme for k different hash functions?

(a) O (log k!)

(b) O (k!)

(c) O (k^2)

(d) O (1/k½)

My query is from Hash Tables topic in portion Hash Tables of Data Structures & Algorithms I

I got this question by my school teacher while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right option is (d) O (1/k½)

Best explanation: Jaccard Coefficient Index is defined as the ratio of total elements of intersection and union of two sets. For two disjoint sets, the value of the Jaccard index is zero. The expected error for estimating the Jaccard index using MinHash scheme for k different hash functions is O (1/k½).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...