{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:53Z","timestamp":1750221053156,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T00:00:00Z","timestamp":1539734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,17]]},"DOI":"10.1145\/3269206.3271690","type":"proceedings-article","created":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T12:08:27Z","timestamp":1540210107000},"page":"1203-1212","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Engineering a Simplified 0-Bit Consistent Weighted Sampling"],"prefix":"10.1145","author":[{"given":"Edward","family":"Raff","sequence":"first","affiliation":[{"name":"Booz Allen Hamilton, Columbia, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jared","family":"Sylvester","sequence":"additional","affiliation":[{"name":"Booz Allen Hamilton, Columbia, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Nicholas","sequence":"additional","affiliation":[{"name":"University of Maryland, Baltimore County, Catonsville, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/829502.830043"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(97)00031-7"},{"key":"e_1_3_2_1_3_1","volume-title":"Procedings of the British Machine Vision Conference 2008","author":"Chum O.","year":"2008","unstructured":"O. Chum , J. Philbin , and A. Zisserman . 2008. Near Duplicate Image Detection: min-Hash and tf-idf Weighting . Procedings of the British Machine Vision Conference 2008 ( 2008 ), 1--50. O. Chum, J. Philbin, and A. Zisserman. 2008. Near Duplicate Image Detection: min-Hash and tf-idf Weighting. Procedings of the British Machine Vision Conference 2008 (2008), 1--50."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242610"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/314500.314600"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.80"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046742"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783406"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978542.1978566"},{"key":"e_1_3_2_1_12_1","volume-title":"K\u00f6 nig","author":"Li Ping","year":"2011","unstructured":"Ping Li , Anshumali Shrivastava , Joshua L. Moore , and Arnd C . K\u00f6 nig . 2011 . Hashing Algorithms for Large-Scale Learning. In Advances in Neural Information Processing Systems 24, J. Shawe-Taylor, R. S. Zemel, P. L. Bartlett, F. Pereira, and K. Q. Weinberger (Eds.). Curran Associates, Inc ., 2672--2680. http:\/\/papers.nips.cc\/paper\/4403-hashing-algorithms-for-large-scale-learning.pdf Ping Li, Anshumali Shrivastava, Joshua L. Moore, and Arnd C. K\u00f6 nig. 2011. Hashing Algorithms for Large-Scale Learning. In Advances in Neural Information Processing Systems 24, J. Shawe-Taylor, R. S. Zemel, P. L. Bartlett, F. Pereira, and K. Q. Weinberger (Eds.). Curran Associates, Inc., 2672--2680. http:\/\/papers.nips.cc\/paper\/4403-hashing-algorithms-for-large-scale-learning.pdf"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242592"},{"key":"e_1_3_2_1_15_1","first-page":"1","article-title":"JSAT: Java Statistical Analysis Tool, a Library for Machine Learning","volume":"18","author":"Raff Edward","year":"2017","unstructured":"Edward Raff . 2017 . JSAT: Java Statistical Analysis Tool, a Library for Machine Learning . Journal of Machine Learning Research , Vol. 18 , 23 (2017), 1 -- 5 . http:\/\/jmlr.org\/papers\/v18\/16-131.html Edward Raff. 2017. JSAT: Java Statistical Analysis Tool, a Library for Machine Learning. Journal of Machine Learning Research, Vol. 18, 23 (2017), 1--5. http:\/\/jmlr.org\/papers\/v18\/16-131.html","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098111"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3128572.3140446"},{"volume-title":"Advances In Neural Information Processing Systems 29","author":"Shrivastava Anshumali","key":"e_1_3_2_1_18_1","unstructured":"Anshumali Shrivastava . 2016. Simple and Efficient Weighted Minwise Hashing . In Advances In Neural Information Processing Systems 29 , D. D. Lee, U. V. Luxburg, I. Guyon, and R. Garnett (Eds.). Curran Associates, Inc. , 1498--1506. http:\/\/papers.nips.cc\/paper\/6472-simple-and-efficient-weighted-minwise-hashing.pdf Anshumali Shrivastava. 2016. Simple and Efficient Weighted Minwise Hashing. In Advances In Neural Information Processing Systems 29, D. D. Lee, U. V. Luxburg, I. Guyon, and R. Garnett (Eds.). Curran Associates, Inc., 1498--1506. http:\/\/papers.nips.cc\/paper\/6472-simple-and-efficient-weighted-minwise-hashing.pdf"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 31st International Conference on Machine Learning -","volume":"32","author":"Shrivastava Anshumali","year":"2014","unstructured":"Anshumali Shrivastava and Ping Li . 2014 . Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search . In Proceedings of the 31st International Conference on Machine Learning - Volume 32 (ICML'14). JMLR.org, I-557--I-565. http:\/\/dl.acm.org\/citation.cfm?id=3044805.3044869 Anshumali Shrivastava and Ping Li. 2014. Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search. In Proceedings of the 31st International Conference on Machine Learning - Volume 32 (ICML'14). JMLR.org, I-557--I-565. http:\/\/dl.acm.org\/citation.cfm?id=3044805.3044869"},{"key":"e_1_3_2_1_20_1","volume-title":"Jingkuan Song, and Jianqiu Ji.","author":"Wang Jingdong","year":"2014","unstructured":"Jingdong Wang , Heng Tao Shen , Jingkuan Song, and Jianqiu Ji. 2014 . Hashing for Similarity Search: A Survey . (8 2014). http:\/\/arxiv.org\/abs\/1408.2927 Jingdong Wang, Heng Tao Shen, Jingkuan Song, and Jianqiu Ji. 2014. Hashing for Similarity Search: A Survey. (8 2014). http:\/\/arxiv.org\/abs\/1408.2927"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052598"},{"key":"e_1_3_2_1_22_1","volume-title":"HistoSketch: Fast Similarity-Preserving Sketching of Streaming Histograms with Concept Drift. In 2017 IEEE International Conference on Data Mining (ICDM). IEEE, 545--554","author":"Yang Dingqi","year":"2017","unstructured":"Dingqi Yang , Bin Li , Laura Rettig , and Philippe Cudre-Mauroux . 2017 . HistoSketch: Fast Similarity-Preserving Sketching of Streaming Histograms with Concept Drift. In 2017 IEEE International Conference on Data Mining (ICDM). IEEE, 545--554 . Dingqi Yang, Bin Li, Laura Rettig, and Philippe Cudre-Mauroux. 2017. HistoSketch: Fast Similarity-Preserving Sketching of Streaming Histograms with Concept Drift. In 2017 IEEE International Conference on Data Mining (ICDM). IEEE, 545--554."}],"event":{"name":"CIKM '18: The 27th ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Torino Italy","acronym":"CIKM '18"},"container-title":["Proceedings of the 27th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3271690","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3269206.3271690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:44:22Z","timestamp":1750207462000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3271690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,17]]},"references-count":20,"alternative-id":["10.1145\/3269206.3271690","10.1145\/3269206"],"URL":"https:\/\/doi.org\/10.1145\/3269206.3271690","relation":{},"subject":[],"published":{"date-parts":[[2018,10,17]]},"assertion":[{"value":"2018-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}