{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:21:48Z","timestamp":1725794508896},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319074665"},{"type":"electronic","value":"9783319074672"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07467-2_17","type":"book-chapter","created":{"date-parts":[[2014,5,20]],"date-time":"2014-05-20T05:11:19Z","timestamp":1400562679000},"page":"160-170","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Search of Cosine and Tanimoto Near Duplicates among Vectors with Domains Consisting of Zero, a\u00a0Positive Number and a Negative Number"],"prefix":"10.1007","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[]},{"given":"Przemyslaw","family":"Podsiadly","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Arasu, A., Ganti, V., Kaushik, R.: Efficient exact set-similarity joins. In: Proc. of VLDB 2006. ACM (2006)","key":"17_CR1"},{"doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: Proc. of WWW 2007, pp. 131\u2013140. ACM (2007)","key":"17_CR2","DOI":"10.1145\/1242572.1242591"},{"issue":"8-13","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1016\/S0169-7552(97)00031-7","volume":"29","author":"A.Z. Broder","year":"1997","unstructured":"Broder, A.Z., Glassman, S.C., Manasse, M.S., Zweig, G.: Syntactic Clustering of the Web. Computer Networks\u00a029(8-13), 1157\u20131166 (1997)","journal-title":"Computer Networks"},{"doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.L.: A primitive operator for similarity joins in data cleaning. In: Proceedings of ICDE 2006. IEEE Computer Society (2006)","key":"17_CR4","DOI":"10.1109\/ICDE.2006.9"},{"unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity Search in High Dimensions via hashing. In: Proc. of VLDB 1999, pp. 518\u2013529 (1999)","key":"17_CR5"},{"key":"17_CR6","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-31087-4_6","volume-title":"Advanced Research in Applied Artificial Intelligence","author":"M. Kryszkiewicz","year":"2012","unstructured":"Kryszkiewicz, M.: Efficient Determination of Binary Non-Negative Vector Neighbors with Regard to Cosine Similarity. In: Jiang, H., Ding, W., Ali, M., Wu, X. (eds.) IEA\/AIE 2012. LNCS (LNAI), vol.\u00a07345, pp. 48\u201357. Springer, Heidelberg (2012)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-36546-1_46","volume-title":"Intelligent Information and Database Systems","author":"M. Kryszkiewicz","year":"2013","unstructured":"Kryszkiewicz, M.: Bounds on Lengths of Real Valued Vectors Similar with Regard to the Tanimoto Similarity. In: Selamat, A., Nguyen, N.T., Haron, H. (eds.) ACIIDS 2013, Part I. LNCS, vol.\u00a07802, pp. 445\u2013454. Springer, Heidelberg (2013)"},{"key":"17_CR8","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-642-40769-7_46","volume-title":"Flexible Query Answering Systems","author":"M. Kryszkiewicz","year":"2013","unstructured":"Kryszkiewicz, M.: On Cosine and Tanimoto Near Duplicates Search among Vectors with Domains Consisting of Zero, a Positive Number and a Negative Number. In: Larsen, H.L., Martin-Bautista, M.J., Vila, M.A., Andreasen, T., Christiansen, H. (eds.) FQAS 2013. LNCS (LNAI), vol.\u00a08132, pp. 531\u2013542. Springer, Heidelberg (2013)"},{"issue":"11","key":"17_CR9","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/361219.361220","volume":"18","author":"G. Salton","year":"1975","unstructured":"Salton, G., Wong, A., Yang, C.S.: A vector space model for automatic indexing. Communications of the ACM\u00a018(11), 613\u2013620 (1975)","journal-title":"Communications of the ACM"},{"issue":"6","key":"17_CR10","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1021\/ci9800211","volume":"38","author":"P. Willett","year":"1998","unstructured":"Willett, P., Barnard, J.M., Downs, G.M.: Chemical similarity searching. J. Chem. Inf. Comput. Sci.\u00a038(6), 983\u2013996 (1998)","journal-title":"J. Chem. Inf. Comput. Sci."},{"unstructured":"Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann (1999)","key":"17_CR11"},{"doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X.: Efficient similarity joins for near duplicate detection. In: Proc. of WWW Conference, pp. 131\u2013140 (2008)","key":"17_CR12","DOI":"10.1145\/1367497.1367516"}],"container-title":["Lecture Notes in Computer Science","Modern Advances in Applied Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07467-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T17:43:28Z","timestamp":1558892608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07467-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319074665","9783319074672"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07467-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}