{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:34:54Z","timestamp":1725798894124},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319100845"},{"type":"electronic","value":"9783319100852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10085-2_5","type":"book-chapter","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T03:14:54Z","timestamp":1408504494000},"page":"59-73","source":"Crossref","is-referenced-by-count":4,"title":["Predicting Pair Similarities for Near-Duplicate Detection in High Dimensional Spaces"],"prefix":"10.1007","author":[{"given":"Marco","family":"Fisichella","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Ceroni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Nejdl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM\u00a051(1) (2008)","DOI":"10.1145\/1327452.1327494"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P., Nguyen, H.L., Razenshteyn, I.: Beyond locality-sensitive hashing. CoRR, abs\/1306.1547 (2013)","DOI":"10.1137\/1.9781611973402.76"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P., Patrascu, M.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: FOCS (2006)","DOI":"10.1109\/FOCS.2006.49"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Goel, A., Shinde, R.: Efficient distributed locality sensitive hashing. In: CIKM (2012)","DOI":"10.1145\/2396761.2398596"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bawa, M., Condie, T., Ganesan, P.: Lsh forest: self-tuning indexes for similarity search. In: WWW (2005)","DOI":"10.1145\/1060745.1060840"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Bellman, R.E.: Adaptive control processes - A guided tour (1961)","DOI":"10.1515\/9781400874668"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Chum, O., Philbin, J., Isard, M., Zisserman, A.: Scalable near identical image and shot detection. In: CIVR (2007)","DOI":"10.1145\/1282280.1282359"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Dasgupta, A., et al.: Fast locality-sensitive hashing. In: KDD (2011)","DOI":"10.1145\/2020408.2020578"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: SCG (2004)","DOI":"10.1145\/997817.997857"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Deng, F.: Approximately detecting duplicates for streaming data using stable bloom filters. In: SIGMOD (2006)","DOI":"10.1145\/1142473.1142477"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-15364-8_11","volume-title":"Database and Expert Systems Applications","author":"M. Fisichella","year":"2010","unstructured":"Fisichella, M., Deng, F., Nejdl, W.: Efficient incremental near duplicate detection based on locality sensitive hashing. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010, Part I. LNCS, vol.\u00a06261, pp. 152\u2013166. Springer, Heidelberg (2010)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Gao, L., Wang, X.S.: Continuous similarity-based queries on streaming time series. IEEE Trans. on Knowl. and Data Eng.\u00a017(10) (2005)","DOI":"10.1109\/TKDE.2005.161"},{"key":"5_CR13","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB (1999)"},{"key":"5_CR14","unstructured":"Gonzalez, R.C., Woods, R.E.: Digital Image Processing, 3rd edn. (2006)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Haghani, P., Michel, S., Aberer, K.: Distributed similarity search in high dimensions using locality sensitive hashing. In: EDBT (2009)","DOI":"10.1145\/1516360.1516446"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC (1998)","DOI":"10.1145\/276698.276876"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Jacox, E.H., Samet, H.: Metric space similarity joins. ACM Trans. Database Syst.\u00a033(2) (2008)","DOI":"10.1145\/1366102.1366104"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Koudas, N., Chin, B., Kian-lee, O., Zhang, T.R.: Approximate nn queries on streams with guaranteed error\/performance bounds. In: VLDB (2004)","DOI":"10.1016\/B978-012088469-8\/50071-1"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Lian, X., Chen, L.: Efficient similarity search over future stream time series. IEEE Trans. on Knowl. and Data Eng.\u00a020(1) (2008)","DOI":"10.1109\/TKDE.2007.190666"},{"key":"5_CR20","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe lsh: efficient indexing for high-dimensional similarity search. In: VLDB (2007)"},{"key":"5_CR21","unstructured":"Teixeira, T., et al.: Scalable locality-sensitive hashing for similarity search in high-dimensional, large-scale multimedia datasets. CoRR, abs\/1310.4136 (2013)"},{"key":"5_CR22","unstructured":"Torralba, A., Fergus, R., Freeman, W.: Tech. rep. mit-csail-tr-2007-024. Technical report, Massachusetts Institute of Technology (2007)"},{"key":"5_CR23","unstructured":"Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB (1998)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10085-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:44:41Z","timestamp":1558975481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10085-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319100845","9783319100852"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10085-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}