Matches in DBpedia 2014 for { <http://dbpedia.org/resource/MinHash> ?p ?o. }
Showing items 1 to 39 of
39
with 100 items per page.
- MinHash abstract "In computer science, MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how similar two sets are. The scheme was invented by Andrei Broder (1997), and initially used in the AltaVista search engine to detect duplicate web pages and eliminate them from search results.It has also been applied in large-scale clustering problems, such as clustering documents by the similarity of their sets of words.".
- MinHash wikiPageExternalLink set-similarity-and-min-hash.aspx.
- MinHash wikiPageExternalLink locality-sensitive-hashing-lsh-and-min-hash.aspx.
- MinHash wikiPageExternalLink mmds.html.
- MinHash wikiPageExternalLink simhash.
- MinHash wikiPageExternalLink simple-simhashing-3kbzhsxyg4467-6.
- MinHash wikiPageExternalLink minhash-java-implementation.
- MinHash wikiPageExternalLink DistanceAndSimilarityMeasures.html.
- MinHash wikiPageExternalLink google-all-pairs-similarity-search.
- MinHash wikiPageExternalLink __init__.py.
- MinHash wikiPageID "30632997".
- MinHash wikiPageRevisionID "603989804".
- MinHash authorlink "Andrei Broder".
- MinHash first "Andrei".
- MinHash hasPhotoCollection MinHash.
- MinHash last "Broder".
- MinHash year "1997".
- MinHash subject Category:Clustering_criteria.
- MinHash subject Category:Hash_functions.
- MinHash subject Category:Hashing.
- MinHash subject Category:Probabilistic_data_structures.
- MinHash type Abstraction100002137.
- MinHash type ClusteringCriteria.
- MinHash type Function113783816.
- MinHash type HashFunctions.
- MinHash type MathematicalRelation113783581.
- MinHash type Measure100033615.
- MinHash type Relation100031921.
- MinHash type Standard107260623.
- MinHash type SystemOfMeasurement113577171.
- MinHash comment "In computer science, MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how similar two sets are. The scheme was invented by Andrei Broder (1997), and initially used in the AltaVista search engine to detect duplicate web pages and eliminate them from search results.It has also been applied in large-scale clustering problems, such as clustering documents by the similarity of their sets of words.".
- MinHash label "MinHash".
- MinHash label "最小哈希".
- MinHash sameAs m.0g9_c6s.
- MinHash sameAs Q11091745.
- MinHash sameAs Q11091745.
- MinHash sameAs MinHash.
- MinHash wasDerivedFrom MinHash?oldid=603989804.
- MinHash isPrimaryTopicOf MinHash.