MinHash (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "MinHash" in English language version.

refsWebsite

Global rank English rank

16doi.org

2^nd place

12semanticscholar.org

11^th place

8^th place

7psu.edu

207^th place

136^th place

5nih.gov

4^th place

3arxiv.org

69^th place

59^th place

2web.archive.org

1^st place

2bmva.org

low place

2googleusercontent.com

243^rd place

882^nd place

2worldcat.org

5^th place

1dec.com

low place

1columbia.edu

488^th place

374^th place

1sourmash.readthedocs.io

low place

1harvard.edu

18^th place

17^th place

1archive.org

6^th place

archive.org

Henzinger, Monika (2006), "Finding near-duplicate web pages: a large-scale evaluation of algorithms", Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 284, doi:10.1145/1148170.1148222, ISBN 978-1595933690, S2CID 207160068.

arxiv.org

Shrivastava, Anshumali (2016), "Exact weighted minwise hashing in constant time", arXiv:1602.08393 [cs.DS]
Moulton, Ryan; Jiang, Yunjiang (2018), "Maximally Consistent Sampling and the Jaccard Index of Probability Distributions", 2018 IEEE International Conference on Data Mining (ICDM), pp. 347–356, arXiv:1809.04052, doi:10.1109/ICDM.2018.00050, ISBN 978-1-5386-9159-5, S2CID 49746072
Zadeh, Reza; Goel, Ashish (2012), "Dimension Independent Similarity Computation", arXiv:1206.2082 [cs.DS].

bmva.org

Chum, Ondrej; Philbin, James; Zisserman, Andrew (2008), "Near Duplicate Image Detection: min-Hash and tf-idf Weighting." (PDF), BMVC, 810: 812–815
Chum, Ondřej; Philbin, James; Isard, Michael; Zisserman, Andrew (2007), "Scalable near identical image and shot detection", Proceedings of the 6th ACM International Conference on Image and Cideo Retrieval (CIVR'07), pp. 549–556, doi:10.1145/1282280.1282359, ISBN 9781595937339, S2CID 3330908; Chum, Ondřej; Philbin, James; Zisserman, Andrew (2008), "Near duplicate image detection: min-hash and tf-idf weighting", Proceedings of the British Machine Vision Conference (PDF), vol. 3, p. 4.

columbia.edu

cs.columbia.edu

Vassilvitskii, Sergey (2011), COMS 6998-12: Dealing with Massive Data (lecture notes, Columbia university) (PDF), archived from the original (PDF) on 2018-10-24.

dec.com

gatekeeper.dec.com

Broder, Andrei Z. (1998), "On the resemblance and containment of documents", Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171) (PDF), IEEE, pp. 21–29, CiteSeerX 10.1.1.24.779, doi:10.1109/SEQUEN.1997.666900, ISBN 978-0-8186-8132-5, S2CID 11748509, archived from the original (PDF) on 2015-01-31, retrieved 2014-01-18.

doi.org

Broder, Andrei Z. (1998), "On the resemblance and containment of documents", Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171) (PDF), IEEE, pp. 21–29, CiteSeerX 10.1.1.24.779, doi:10.1109/SEQUEN.1997.666900, ISBN 978-0-8186-8132-5, S2CID 11748509, archived from the original (PDF) on 2015-01-31, retrieved 2014-01-18.
Broder, Andrei Z.; Charikar, Moses; Frieze, Alan M.; Mitzenmacher, Michael (1998), "Min-wise independent permutations", Proc. 30th ACM Symposium on Theory of Computing (STOC '98), New York, NY, USA: Association for Computing Machinery, pp. 327–336, CiteSeerX 10.1.1.409.9220, doi:10.1145/276698.276781, ISBN 978-0897919623, S2CID 465847.
Ioffe, Sergey (2010). "Improved Consistent Sampling, Weighted Minhash and L1 Sketching". 2010 IEEE International Conference on Data Mining (PDF). pp. 246–255. CiteSeerX 10.1.1.227.9749. doi:10.1109/ICDM.2010.80. ISBN 978-1-4244-9131-5. S2CID 9970906.
Moulton, Ryan; Jiang, Yunjiang (2018), "Maximally Consistent Sampling and the Jaccard Index of Probability Distributions", 2018 IEEE International Conference on Data Mining (ICDM), pp. 347–356, arXiv:1809.04052, doi:10.1109/ICDM.2018.00050, ISBN 978-1-5386-9159-5, S2CID 49746072
Matoušek, Jiří; Stojaković, Miloš (2003), "On restricted min-wise independence of permutations", Random Structures and Algorithms, 23 (4): 397–408, CiteSeerX 10.1.1.400.6757, doi:10.1002/rsa.10101, S2CID 1483449.
Saks, M.; Srinivasan, A.; Zhou, S.; Zuckerman, D. (2000), "Low discrepancy sets yield approximate min-wise independent permutation families", Information Processing Letters, 73 (1–2): 29–32, CiteSeerX 10.1.1.20.8264, doi:10.1016/S0020-0190(99)00163-5.
Chum, Ondřej; Philbin, James; Isard, Michael; Zisserman, Andrew (2007), "Scalable near identical image and shot detection", Proceedings of the 6th ACM International Conference on Image and Cideo Retrieval (CIVR'07), pp. 549–556, doi:10.1145/1282280.1282359, ISBN 9781595937339, S2CID 3330908; Chum, Ondřej; Philbin, James; Zisserman, Andrew (2008), "Near duplicate image detection: min-hash and tf-idf weighting", Proceedings of the British Machine Vision Conference (PDF), vol. 3, p. 4.
Cohen, E.; Datar, M.; Fujiwara, S.; Gionis, A.; Indyk, P.; Motwani, R.; Ullman, J. D.; Yang, C. (2001), "Finding interesting associations without support pruning", IEEE Transactions on Knowledge and Data Engineering, 13 (1): 64–78, CiteSeerX 10.1.1.192.7385, doi:10.1109/69.908981.
Ondov, Brian D.; Treangen, Todd J.; Melsted, Páll; Mallonee, Adam B.; Bergman, Nicholas H.; Koren, Sergey; Phillippy, Adam M. (2016-06-20). "Mash: fast genome and metagenome distance estimation using MinHash". Genome Biology. 17 (1): 132. doi:10.1186/s13059-016-0997-x. ISSN 1474-760X. PMC 4915045. PMID 27323842.
Berlin, Konstantin; Koren, Sergey; Chin, Chen-Shan; Drake, James P; Landolin, Jane M; Phillippy, Adam M (2015-05-25). "Assembling large genomes with single-molecule sequencing and locality-sensitive hashing". Nature Biotechnology. 33 (6): 623–630. doi:10.1038/nbt.3238. ISSN 1546-1696. PMID 26006009. S2CID 17246729.
Jain, Chirag; Rodriguez-R, Luis M.; Phillippy, Adam M.; Konstantinidis, Konstantinos T.; Aluru, Srinivas (December 2018). "High throughput ANI analysis of 90K prokaryotic genomes reveals clear species boundaries". Nature Communications. 9 (1): 5114. Bibcode:2018NatCo...9.5114J. doi:10.1038/s41467-018-07641-9. PMC 6269478. PMID 30504855.
Andoni, Alexandr; Indyk, Piotr (2008), "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions", Communications of the ACM, 51 (1): 117–122, CiteSeerX 10.1.1.226.6905, doi:10.1145/1327452.1327494, S2CID 6468963.
Henzinger, Monika (2006), "Finding near-duplicate web pages: a large-scale evaluation of algorithms", Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 284, doi:10.1145/1148170.1148222, ISBN 978-1595933690, S2CID 207160068.
Charikar, Moses S. (2002), "Similarity estimation techniques from rounding algorithms", Proceedings of the 34th Annual ACM Symposium on Theory of Computing, p. 380, doi:10.1145/509907.509965, ISBN 978-1581134957, S2CID 4229473.
Gurmeet Singh, Manku; Jain, Arvind; Das Sarma, Anish (2007), "Detecting near-duplicates for web crawling", Proceedings of the 16th International Conference on World Wide Web (PDF), p. 141, doi:10.1145/1242572.1242592, ISBN 9781595936547, S2CID 1414324.
Das, Abhinandan S.; Datar, Mayur; Garg, Ashutosh; Rajaram, Shyam; et al. (2007), "Google news personalization: scalable online collaborative filtering", Proceedings of the 16th International Conference on World Wide Web, p. 271, doi:10.1145/1242572.1242610, ISBN 9781595936547, S2CID 207163129.

googleusercontent.com

static.googleusercontent.com

Ioffe, Sergey (2010). "Improved Consistent Sampling, Weighted Minhash and L1 Sketching". 2010 IEEE International Conference on Data Mining (PDF). pp. 246–255. CiteSeerX 10.1.1.227.9749. doi:10.1109/ICDM.2010.80. ISBN 978-1-4244-9131-5. S2CID 9970906.
Gurmeet Singh, Manku; Jain, Arvind; Das Sarma, Anish (2007), "Detecting near-duplicates for web crawling", Proceedings of the 16th International Conference on World Wide Web (PDF), p. 141, doi:10.1145/1242572.1242592, ISBN 9781595936547, S2CID 1414324.

harvard.edu

ui.adsabs.harvard.edu

Jain, Chirag; Rodriguez-R, Luis M.; Phillippy, Adam M.; Konstantinidis, Konstantinos T.; Aluru, Srinivas (December 2018). "High throughput ANI analysis of 90K prokaryotic genomes reveals clear species boundaries". Nature Communications. 9 (1): 5114. Bibcode:2018NatCo...9.5114J. doi:10.1038/s41467-018-07641-9. PMC 6269478. PMID 30504855.

nih.gov

pubmed.ncbi.nlm.nih.gov

Ondov, Brian D.; Treangen, Todd J.; Melsted, Páll; Mallonee, Adam B.; Bergman, Nicholas H.; Koren, Sergey; Phillippy, Adam M. (2016-06-20). "Mash: fast genome and metagenome distance estimation using MinHash". Genome Biology. 17 (1): 132. doi:10.1186/s13059-016-0997-x. ISSN 1474-760X. PMC 4915045. PMID 27323842.
Berlin, Konstantin; Koren, Sergey; Chin, Chen-Shan; Drake, James P; Landolin, Jane M; Phillippy, Adam M (2015-05-25). "Assembling large genomes with single-molecule sequencing and locality-sensitive hashing". Nature Biotechnology. 33 (6): 623–630. doi:10.1038/nbt.3238. ISSN 1546-1696. PMID 26006009. S2CID 17246729.
Jain, Chirag; Rodriguez-R, Luis M.; Phillippy, Adam M.; Konstantinidis, Konstantinos T.; Aluru, Srinivas (December 2018). "High throughput ANI analysis of 90K prokaryotic genomes reveals clear species boundaries". Nature Communications. 9 (1): 5114. Bibcode:2018NatCo...9.5114J. doi:10.1038/s41467-018-07641-9. PMC 6269478. PMID 30504855.

ncbi.nlm.nih.gov

Ondov, Brian D.; Treangen, Todd J.; Melsted, Páll; Mallonee, Adam B.; Bergman, Nicholas H.; Koren, Sergey; Phillippy, Adam M. (2016-06-20). "Mash: fast genome and metagenome distance estimation using MinHash". Genome Biology. 17 (1): 132. doi:10.1186/s13059-016-0997-x. ISSN 1474-760X. PMC 4915045. PMID 27323842.
Jain, Chirag; Rodriguez-R, Luis M.; Phillippy, Adam M.; Konstantinidis, Konstantinos T.; Aluru, Srinivas (December 2018). "High throughput ANI analysis of 90K prokaryotic genomes reveals clear species boundaries". Nature Communications. 9 (1): 5114. Bibcode:2018NatCo...9.5114J. doi:10.1038/s41467-018-07641-9. PMC 6269478. PMID 30504855.

psu.edu

citeseerx.ist.psu.edu

Broder, Andrei Z. (1998), "On the resemblance and containment of documents", Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171) (PDF), IEEE, pp. 21–29, CiteSeerX 10.1.1.24.779, doi:10.1109/SEQUEN.1997.666900, ISBN 978-0-8186-8132-5, S2CID 11748509, archived from the original (PDF) on 2015-01-31, retrieved 2014-01-18.
Broder, Andrei Z.; Charikar, Moses; Frieze, Alan M.; Mitzenmacher, Michael (1998), "Min-wise independent permutations", Proc. 30th ACM Symposium on Theory of Computing (STOC '98), New York, NY, USA: Association for Computing Machinery, pp. 327–336, CiteSeerX 10.1.1.409.9220, doi:10.1145/276698.276781, ISBN 978-0897919623, S2CID 465847.
Ioffe, Sergey (2010). "Improved Consistent Sampling, Weighted Minhash and L1 Sketching". 2010 IEEE International Conference on Data Mining (PDF). pp. 246–255. CiteSeerX 10.1.1.227.9749. doi:10.1109/ICDM.2010.80. ISBN 978-1-4244-9131-5. S2CID 9970906.
Matoušek, Jiří; Stojaković, Miloš (2003), "On restricted min-wise independence of permutations", Random Structures and Algorithms, 23 (4): 397–408, CiteSeerX 10.1.1.400.6757, doi:10.1002/rsa.10101, S2CID 1483449.
Saks, M.; Srinivasan, A.; Zhou, S.; Zuckerman, D. (2000), "Low discrepancy sets yield approximate min-wise independent permutation families", Information Processing Letters, 73 (1–2): 29–32, CiteSeerX 10.1.1.20.8264, doi:10.1016/S0020-0190(99)00163-5.
Cohen, E.; Datar, M.; Fujiwara, S.; Gionis, A.; Indyk, P.; Motwani, R.; Ullman, J. D.; Yang, C. (2001), "Finding interesting associations without support pruning", IEEE Transactions on Knowledge and Data Engineering, 13 (1): 64–78, CiteSeerX 10.1.1.192.7385, doi:10.1109/69.908981.
Andoni, Alexandr; Indyk, Piotr (2008), "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions", Communications of the ACM, 51 (1): 117–122, CiteSeerX 10.1.1.226.6905, doi:10.1145/1327452.1327494, S2CID 6468963.

semanticscholar.org

api.semanticscholar.org

Broder, Andrei Z. (1998), "On the resemblance and containment of documents", Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171) (PDF), IEEE, pp. 21–29, CiteSeerX 10.1.1.24.779, doi:10.1109/SEQUEN.1997.666900, ISBN 978-0-8186-8132-5, S2CID 11748509, archived from the original (PDF) on 2015-01-31, retrieved 2014-01-18.
Broder, Andrei Z.; Charikar, Moses; Frieze, Alan M.; Mitzenmacher, Michael (1998), "Min-wise independent permutations", Proc. 30th ACM Symposium on Theory of Computing (STOC '98), New York, NY, USA: Association for Computing Machinery, pp. 327–336, CiteSeerX 10.1.1.409.9220, doi:10.1145/276698.276781, ISBN 978-0897919623, S2CID 465847.
Ioffe, Sergey (2010). "Improved Consistent Sampling, Weighted Minhash and L1 Sketching". 2010 IEEE International Conference on Data Mining (PDF). pp. 246–255. CiteSeerX 10.1.1.227.9749. doi:10.1109/ICDM.2010.80. ISBN 978-1-4244-9131-5. S2CID 9970906.
Moulton, Ryan; Jiang, Yunjiang (2018), "Maximally Consistent Sampling and the Jaccard Index of Probability Distributions", 2018 IEEE International Conference on Data Mining (ICDM), pp. 347–356, arXiv:1809.04052, doi:10.1109/ICDM.2018.00050, ISBN 978-1-5386-9159-5, S2CID 49746072
Matoušek, Jiří; Stojaković, Miloš (2003), "On restricted min-wise independence of permutations", Random Structures and Algorithms, 23 (4): 397–408, CiteSeerX 10.1.1.400.6757, doi:10.1002/rsa.10101, S2CID 1483449.
Chum, Ondřej; Philbin, James; Isard, Michael; Zisserman, Andrew (2007), "Scalable near identical image and shot detection", Proceedings of the 6th ACM International Conference on Image and Cideo Retrieval (CIVR'07), pp. 549–556, doi:10.1145/1282280.1282359, ISBN 9781595937339, S2CID 3330908; Chum, Ondřej; Philbin, James; Zisserman, Andrew (2008), "Near duplicate image detection: min-hash and tf-idf weighting", Proceedings of the British Machine Vision Conference (PDF), vol. 3, p. 4.
Berlin, Konstantin; Koren, Sergey; Chin, Chen-Shan; Drake, James P; Landolin, Jane M; Phillippy, Adam M (2015-05-25). "Assembling large genomes with single-molecule sequencing and locality-sensitive hashing". Nature Biotechnology. 33 (6): 623–630. doi:10.1038/nbt.3238. ISSN 1546-1696. PMID 26006009. S2CID 17246729.
Andoni, Alexandr; Indyk, Piotr (2008), "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions", Communications of the ACM, 51 (1): 117–122, CiteSeerX 10.1.1.226.6905, doi:10.1145/1327452.1327494, S2CID 6468963.
Henzinger, Monika (2006), "Finding near-duplicate web pages: a large-scale evaluation of algorithms", Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 284, doi:10.1145/1148170.1148222, ISBN 978-1595933690, S2CID 207160068.
Charikar, Moses S. (2002), "Similarity estimation techniques from rounding algorithms", Proceedings of the 34th Annual ACM Symposium on Theory of Computing, p. 380, doi:10.1145/509907.509965, ISBN 978-1581134957, S2CID 4229473.
Gurmeet Singh, Manku; Jain, Arvind; Das Sarma, Anish (2007), "Detecting near-duplicates for web crawling", Proceedings of the 16th International Conference on World Wide Web (PDF), p. 141, doi:10.1145/1242572.1242592, ISBN 9781595936547, S2CID 1414324.
Das, Abhinandan S.; Datar, Mayur; Garg, Ashutosh; Rajaram, Shyam; et al. (2007), "Google news personalization: scalable online collaborative filtering", Proceedings of the 16th International Conference on World Wide Web, p. 271, doi:10.1145/1242572.1242610, ISBN 9781595936547, S2CID 207163129.

sourmash.readthedocs.io

"Welcome to sourmash! — sourmash 1.0 documentation". sourmash.readthedocs.io. Retrieved 2017-11-13.

web.archive.org

Broder, Andrei Z. (1998), "On the resemblance and containment of documents", Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171) (PDF), IEEE, pp. 21–29, CiteSeerX 10.1.1.24.779, doi:10.1109/SEQUEN.1997.666900, ISBN 978-0-8186-8132-5, S2CID 11748509, archived from the original (PDF) on 2015-01-31, retrieved 2014-01-18.
Vassilvitskii, Sergey (2011), COMS 6998-12: Dealing with Massive Data (lecture notes, Columbia university) (PDF), archived from the original (PDF) on 2018-10-24.

worldcat.org

Ondov, Brian D.; Treangen, Todd J.; Melsted, Páll; Mallonee, Adam B.; Bergman, Nicholas H.; Koren, Sergey; Phillippy, Adam M. (2016-06-20). "Mash: fast genome and metagenome distance estimation using MinHash". Genome Biology. 17 (1): 132. doi:10.1186/s13059-016-0997-x. ISSN 1474-760X. PMC 4915045. PMID 27323842.
Berlin, Konstantin; Koren, Sergey; Chin, Chen-Shan; Drake, James P; Landolin, Jane M; Phillippy, Adam M (2015-05-25). "Assembling large genomes with single-molecule sequencing and locality-sensitive hashing". Nature Biotechnology. 33 (6): 623–630. doi:10.1038/nbt.3238. ISSN 1546-1696. PMID 26006009. S2CID 17246729.