{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T20:29:26Z","timestamp":1792787366335,"version":"4.5.0"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T00:00:00Z","timestamp":1544054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Czech Republic Project","award":["GBP103\/12\/G084"],"award-info":[{"award-number":["GBP103\/12\/G084"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2019,1,31]]},"abstract":"<jats:p>\n                    This article addresses the problem of matching the most similar data objects to a given query object. We adopt a generic model of similarity that involves the domain of objects and metric distance functions only. We examine the case of a large dataset in a complex data space, which makes this problem inherently difficult. Many indexing and searching approaches have been proposed, but they have often failed to efficiently prune complex search spaces and access large portions of the dataset when evaluating queries. We propose an approach to enhancing the existing search techniques to significantly reduce the number of accessed data objects while preserving the quality of the search results. In particular, we extend each data object with its\n                    <jats:italic>sketch<\/jats:italic>\n                    , a short binary string in Hamming space. These sketches approximate the similarity relationships in the original search space, and we use them to filter out non-relevant objects not pruned by the original search technique. We provide a\u00a0probabilistic model to tune the parameters of the sketch-based filtering separately for each query object. Experiments conducted with different similarity search techniques and real-life datasets demonstrate that the secondary filtering can speed-up similarity search several times.\n                  <\/jats:p>","DOI":"10.1145\/3231936","type":"journal-article","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T08:34:16Z","timestamp":1544085256000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Binary Sketches for Secondary Filtering"],"prefix":"10.1145","volume":"37","author":[{"given":"Vladimir","family":"Mic","sequence":"first","affiliation":[{"name":"Masaryk University, Brno, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Novak","sequence":"additional","affiliation":[{"name":"Masaryk University, Brno, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pavel","family":"Zezula","sequence":"additional","affiliation":[{"name":"Masaryk University, Brno, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,12,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/763693.763696"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783405"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497439"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-009-0339-z"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SISAP.2009.25"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502808"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the International Conference on Very Large Data Bases","volume":"23","author":"Ciaccia Paolo","year":"1997"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"John Daugman. 2003. The importance of being random: Statistical principles of iris recognition. Pattern Recogn. 36 2 (2003).  John Daugman. 2003. The importance of being random: Statistical principles of iris recognition. Pattern Recogn. 36 2 (2003).","DOI":"10.1016\/S0031-3203(02)00030-4"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the International Conference on Computer Vision Theory and Applications (VISAPP\u201914)","volume":"2","author":"Delvinioti A."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the International Conference on machine Learning (ICML\u201914)","volume":"32","author":"Donahue Jeff","year":"2014"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390358"},{"key":"e_1_2_1_13_1","unstructured":"Keinosuke Fukunaga. 2013. Introduction to Statistical Pattern Recognition. Academic Press.  Keinosuke Fukunaga. 2013. Introduction to Statistical Pattern Recognition. Academic Press."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1876037.1876078"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.91"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88682-2_24"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3065386"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32153-5_7"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031213"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217935.1217966"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 10th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS\u201915)","author":"Mic Vladimir","year":"2015"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2016.0098"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46759-7_19"},{"key":"e_1_2_1_24_1","unstructured":"MPEG7. 2002. Multimedia content description interfaces. Information technology -- Multimedia Content Description Interface -- Visual: Part 3. International Organization for Standardization Geneva Switzerland. https:\/\/www.iso.org\/standard\/34230.html.  MPEG7. 2002. Multimedia content description interfaces. Information technology -- Multimedia Content Description Interface -- Visual: Part 3. International Organization for Standardization Geneva Switzerland. https:\/\/www.iso.org\/standard\/34230.html."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SISAP.2009.22"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.10.002"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2010.12.004"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxt114"},{"key":"e_1_2_1_29_1","volume-title":"Database and Expert Systems Applications","author":"Novak David"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49214-7_2"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.222"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995373"},{"key":"e_1_2_1_33_1","unstructured":"Hanan Samet. 2006. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann.   Hanan Samet. 2006. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276319"},{"key":"e_1_2_1_35_1","volume-title":"Video Google: A text retrieval approach to object matching in videos. In null","author":"Sivic Josef","year":"2003"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the Dateso 2004 Annual International Workshop on DAtabases, TExts, Specifications and Objects. 27--37","author":"Skopal Tom\u00e1s","year":"2004"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1254882.1254900"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1121569"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050069"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3231936","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3231936","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:08:17Z","timestamp":1750194497000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3231936"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,6]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1,31]]}},"alternative-id":["10.1145\/3231936"],"URL":"https:\/\/doi.org\/10.1145\/3231936","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,6]]},"assertion":[{"value":"2017-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-12-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}