{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:15:17Z","timestamp":1725732917848},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385612"},{"type":"electronic","value":"9783642385629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38562-9_8","type":"book-chapter","created":{"date-parts":[[2013,6,20]],"date-time":"2013-06-20T11:14:18Z","timestamp":1371726858000},"page":"77-86","source":"Crossref","is-referenced-by-count":2,"title":["Entity Resolution on Uncertain Relations"],"prefix":"10.1007","author":[{"given":"Huabin","family":"Feng","sequence":"first","affiliation":[]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Arasu, A., Ganti, V., Kaushik, R.: Efficient exact set-similarity joins. In: VLDB 2006 (2006)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: WWW 2007 (2007)","DOI":"10.1145\/1242572.1242591"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Chandel, A., Hassanzadeh, O., Koudas, N., Sadoghi, M., Srivastava, D.: Benchmarking larative approximate selection predicates. In: SIGMOD 2007 (2007)","DOI":"10.1145\/1247480.1247521"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: ICDE 2006 (2006)","DOI":"10.1109\/ICDE.2006.9"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Li, C., Lu, J., Lu, Y.: Efficient merging and filtering algorithms for approximate string searches. In: ICDE 2008 (2008)","DOI":"10.1109\/ICDE.2008.4497434"},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/asi.4630270302","volume":"27","author":"S.E. Robertson","year":"1976","unstructured":"Robertson, S.E., Jones, K.S.: Relevance weighting of search terms. Journal of the American Society for Information Science\u00a027(3), 129\u2013146 (1976)","journal-title":"Journal of the American Society for Information Science"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Sarawagi, S., Kirpal, A.: Efficient set joins on similarity predicates. In: SIGMOD 2004 (2004)","DOI":"10.1145\/1007568.1007652"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Shang, H.: Top-k Set similarity Joins. In: ICDE 2009 (2009)","DOI":"10.1109\/ICDE.2009.111"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X.: Efficient similarity joins for near duplicate detection. In: WWW 2008 (2008)","DOI":"10.1145\/1367497.1367516"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38562-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T05:21:47Z","timestamp":1557811307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38562-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385612","9783642385629"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38562-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}