{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:43:35Z","timestamp":1777495415400,"version":"3.51.4"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030034924","type":"print"},{"value":"9783030034931","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03493-1_3","type":"book-chapter","created":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T15:16:52Z","timestamp":1541690212000},"page":"17-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extended Min-Hash Focusing on Intersection Cardinality"],"prefix":"10.1007","author":[{"given":"Hisashi","family":"Koga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taiki","family":"Itabashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gibran Fuentes","family":"Pineda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takahisa","family":"Toda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,9]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. In: Proceedings of Compression and Complexity of Sequences 1997, pp. 21\u201329 (1997). https:\/\/doi.org\/10.1109\/SEQUEN.1997.666900","DOI":"10.1109\/SEQUEN.1997.666900"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Christiani, T., Pagh, R.: Set similarity search beyond minhash. In: Proceedings of ACM STOC, pp. 1094\u20131107 (2017)","DOI":"10.1145\/3055399.3055443"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Chum, O., Philbin, J., Zisserman, A.: Near duplicate image detection: min-hash and tf-idf weighting. In: Proceedings of BMVC, pp. 50.1\u201350.10 (2008)","DOI":"10.5244\/C.22.50"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/978-3-642-15549-9_47","volume-title":"Computer Vision \u2013 ECCV 2010","author":"DC Lee","year":"2010","unstructured":"Lee, D.C., Ke, Q., Isard, M.: Partition min-hash for partial duplicate image discovery. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010. LNCS, vol. 6311, pp. 648\u2013662. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15549-9_47"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Li, P., K\u00f6nig, C.: b-bit minwise hashing. In: Proceedings of WWW, pp. 671\u2013680 (2010). https:\/\/doi.org\/10.1145\/1772690.1772759","DOI":"10.1145\/1772690.1772759"},{"key":"3_CR6","unstructured":"Li, P., Owen, A.B., Zhang, C.: One permutation hashing. In: Proceedings of 26th NIPS 2012, pp. 3122\u20133130 (2012)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Matas, J., Chum, O., Urban, M., Pajdla, T.: Robust wide baseline stereo from maximally stable extremal regions. In: Proceedings of BMVC, pp. 36.1\u201336.10 (2002)","DOI":"10.5244\/C.16.36"},{"issue":"10","key":"3_CR8","doi-asserted-by":"publisher","first-page":"2024","DOI":"10.1587\/transinf.E94.D.2024","volume":"94\u2013D","author":"GF Pineda","year":"2011","unstructured":"Pineda, G.F., Koga, H., Watanabe, T.: Scalable object discovery: a hash-based approach to clustering co-occurring visual words. IEICE Trans. 94\u2013D(10), 2024\u20132035 (2011)","journal-title":"IEICE Trans."},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Shrivastava, A., Li, P.: Asymmetric minwise hashing for indexing binary inner products and set containment. In: Proceedings of WWW, pp. 981\u2013991 (2015). https:\/\/doi.org\/10.1145\/2736277.2741285","DOI":"10.1145\/2736277.2741285"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Zhao, W.L., J\u00e9gou, H., Gravier, G.: Sim-Min-Hash: an efficient matching technique for linking large image collections. In: Proceedings of ACM MM, pp. 577\u2013580 (2013). https:\/\/doi.org\/10.1145\/2502081.2502152","DOI":"10.1145\/2502081.2502152"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03493-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:09:04Z","timestamp":1710360544000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03493-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030034924","9783030034931"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03493-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"9 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDEAL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Data Engineering and Automated Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ideal2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aida.ii.uam.es\/ideal2018\/#!\/main","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}