+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which technique is used for finding similarity between two sets?

(a) MinHash

(b) Stack

(c) Priority Queue

(d) PAT Tree

My doubt stems from Hash Tables in section Hash Tables of Data Structures & Algorithms I

The question was posed to me in an international level competition.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right option is (a) MinHash

The best explanation: In computer science as well as data mining, to find the similarity between two given sets, a technique called MinHash or min-wise independent permutation scheme is used. It helps in the quick estimation of the similarity between two sets.

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.