+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which technique was firstly used clustering documents using the similarity of two words or strings?

(a) MinHash

(b) Stack

(c) Priority Queue

(d) PAT Tree

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

The question was asked in quiz.

1 Answer

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

Easiest 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 similarity between two sets. It is used in clustering documents using the similarity of two words or strings.

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

...