Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,251,336 papers from all fields of science
Search
Sign In
Create Free Account
MinHash
Known as:
Min-wise independence
In computer science, MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
28 relations
Association rule learning
Bag-of-words model
Bloom filter
Chernoff bound
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Anonymous multi-source counting statistics New methodology applied to the health sector
T. Delsate
,
Mohamed Boukhebouze
International Symposium on Computers and…
2019
Corpus ID: 210971478
We present a technique for estimating the size of a statistical population spread across multiple sources. Each sources can…
Expand
2018
2018
Privacy Preservation of Location Information Based on MinHash Algorithm in Online Ride-Hailing Services
Miaomiao Li
,
Licheng Wang
International Conference on Advanced Cloud and…
2018
Corpus ID: 53282684
In the era of big data, the development of location-aware technologies such as mobile communications, sensing devices, and mobile…
Expand
2018
2018
A Filter of Minhash for Image Similarity Measures
J. Long
,
Qunfeng Liu
,
Xinpan Yuan
,
Chengyuan Zhang
,
Junfeng Liu
Journal of Advanced Computational Intelligence…
2018
Corpus ID: 49653082
Image similarity measures play an important role in nearest neighbor search and duplicate detection for large-scale image…
Expand
2015
2015
A Novel Unsupervised 2-Stage k-NN Re-Ranking Algorithm for Image Retrieval
Dawei Li
,
Mooi Choo Choo Chuah
IEEE International Symposium on Multimedia
2015
Corpus ID: 36187957
In many image retrieval systems, re-ranking is an important final step to improve the retrieval accuracy given an initial ranking…
Expand
2014
2014
Automatic Template Extraction from Heterogeneous Web Pages
Kunal Kundan
,
Sonali Rangdale
2014
Corpus ID: 15456475
In this paper, we will enlist the process of extracting template from heterogeneous Web Pages. Extracting structured information…
Expand
2014
2014
Secure cloud storage and search scheme for mobile devices
Abir Awad
,
Adrian Matthews
,
Brian Lee
MELECON - 17th IEEE Mediterranean…
2014
Corpus ID: 21292641
In this paper, we consider the problem of securing mobile-cloud storage services. We design and develop a novel and secure…
Expand
2014
2014
A Two-Stage Methodology Using K-NN and False-Positive Minimizing ELM for Nominal Data Classification
Anton Akusok
,
Yoan Miché
,
J. Hegedus
,
Rui Nian
,
A. Lendasse
Cognitive Computation
2014
Corpus ID: 255606225
This paper focuses on the problem of making decisions in the context of nominal data under specific constraints. The underlying…
Expand
2012
2012
EXTRACTION OF STRUCTURED INFORMATION FROM UNSTRUCTURED OR SEMI- STRUCTURED MACHINE READABLE WEB PAGES
Vinod Kumar Raavi
,
S. Somayajula
2012
Corpus ID: 2108931
In now a days the extraction of structured information from unstructured or semi- structured machine readable documents…
Expand
1999
1999
Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques
D. Hochbaum
Lecture Notes in Computer Science
1999
Corpus ID: 27989304
Session Random 1.- Completeness and Robustness Properties of Min-Wise Independent Permutations.- Low Discrepancy Sets Yield…
Expand
1998
1998
A Derandomization Using Min-Wise Independent Permutations Extended abstract for submission to Random ’ 98 not for distribution
A. Broder
,
M. Charikar
,
M. Mitzenmacher
1998
Corpus ID: 5204628
Min-wise independence is a recently introduced notion of limited independence, similar in spirit to pairwise independence. The…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE