{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T19:30:37Z","timestamp":1777491037288,"version":"3.51.4"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Veda"},{"name":"Funnelback Pty. Ltd."},{"name":"Linkage Project","award":["LP100200079"],"award-info":[{"award-number":["LP100200079"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2016,1,1]]},"DOI":"10.1109\/tkde.2015.2468711","type":"journal-article","created":{"date-parts":[[2015,8,14]],"date-time":"2015-08-14T14:57:06Z","timestamp":1439564226000},"page":"166-180","source":"Crossref","is-referenced-by-count":30,"title":["Semantic-Aware Blocking for Entity Resolution"],"prefix":"10.1109","volume":"28","author":[{"given":"Qing","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyuan","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huizhi","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559870"},{"key":"ref38","first-page":"448","article-title":"Using information content to evaluate semantic similarity in a taxonomy","author":"resnik","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref33","author":"miller","year":"1998","journal-title":"WordNet An Electronic Lexical Database"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347123"},{"key":"ref31","first-page":"41","article-title":"Graph-parallel entity resolution using LSH & IMM","author":"malhotra","year":"0","journal-title":"EDBT\/ICDT Workshops"},{"key":"ref30","first-page":"251","article-title":"Measuring similarity between ontologies","author":"maedche","year":"0","journal-title":"Proc of the 13th Int Conf on Knowl Engineer and Knowl Manage Ontol and the Semant Web"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.54"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124305"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1998076.1998093"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109688"},{"key":"ref10","article-title":"Towards parameter-free blocking for scalable record linkage","author":"christen","year":"2007","journal-title":"Dept Comput Sci"},{"key":"ref40","article-title":"Towards a probabilistic taxonomy of many concepts","author":"wu","year":"2011"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31164-2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.127"},{"key":"ref13","article-title":"Preparation of a real voter data set for record linkage and duplicate detection research","author":"christen","year":"2013","journal-title":"Australian National University"},{"key":"ref14","first-page":"475","article-title":"Learning to match and cluster large high-dimensional data sets for data integration","author":"richman","year":"0","journal-title":"Proc ACM SIGKDD Int Conf Knowl Discovery Data Mining"},{"key":"ref15","first-page":"305","article-title":"Robust record linkage blocking using suffix arrays","author":"chawla","year":"0","journal-title":"Proc 18th ACM Conf Inf Knowl Manage"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0104-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994694"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.2307\/2286061"},{"key":"ref19","first-page":"1606","article-title":"Computing semantic relatedness using Wikipedia-based explicit semantic analysis","author":"gabrilovich","year":"0","journal-title":"Proc 20th Int Joint Conf Artif Intell"},{"key":"ref28","first-page":"525","article-title":"HARRA: Fast iterative hashed record linkage for large-scale data collections","author":"lee","year":"0","journal-title":"Proceedings of the 11th International Conference on Extending Database Technology Advances in Database Technology"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807252"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2012.11.008"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"ref6","first-page":"25","article-title":"A comparison of fast blocking methods for record linkage","author":"baxter","year":"0","journal-title":"Proc ACM Int Conf Knowl Discovery Data Mining"},{"key":"ref29","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"lv","year":"0","journal-title":"Proc Int Conf Very Large Databases"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060840"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"ref7","first-page":"87","article-title":"Adaptive blocking: Learning to scale up record linkage","author":"bilenko","year":"0","journal-title":"Proc Int Conf Data Mining"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/WIRI.2005.2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2816813"},{"key":"ref1","first-page":"274","article-title":"Efficient record linkage using a double embedding scheme","author":"adly","year":"0","journal-title":"Proc Int Conf Data Mining"},{"key":"ref20","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"0","journal-title":"Proc Intl Conf on Very Large Databases"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009761603038"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/568271.223807"},{"key":"ref42","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-29151-2","volume":"32","author":"zezula","year":"2006","journal-title":"Similarity Search The Metric Space Approach"},{"key":"ref24","first-page":"136","article-title":"Efficient semantic-aware detection of near duplicate resources","author":"ioannou","year":"0","journal-title":"Proc 7th Int Conf Semantic Web Res Appl"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1255175.1255213"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.60"},{"key":"ref25","first-page":"137","article-title":"Efficient record linkage in large data sets","author":"jin","year":"0","journal-title":"Proc 8th Int Conf Database Syst Adv Applicat"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7347496\/7202898.pdf?arnumber=7202898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:46:05Z","timestamp":1641987965000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7202898\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,1]]},"references-count":42,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2015.2468711","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2016,1,1]]}}}