{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:31:50Z","timestamp":1770816710995,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319112565","type":"print"},{"value":"9783319112572","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11257-2_20","type":"book-chapter","created":{"date-parts":[[2014,9,10]],"date-time":"2014-09-10T06:42:54Z","timestamp":1410331374000},"page":"253-268","source":"Crossref","is-referenced-by-count":83,"title":["A Comparison of Blocking Methods for Record Linkage"],"prefix":"10.1007","author":[{"given":"Rebecca C.","family":"Steorts","sequence":"first","affiliation":[]},{"given":"Samuel L.","family":"Ventura","sequence":"additional","affiliation":[]},{"given":"Mauricio","family":"Sadinle","sequence":"additional","affiliation":[]},{"given":"Stephen E.","family":"Fienberg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/11508069_15","volume-title":"Intelligent Data Engineering and Automated Learning - IDEAL 2005","author":"P. Christen","year":"2005","unstructured":"Christen, P.: Probabilistic Data Generation for Deduplication and Data Linkage. In: Gallagher, M., Hogan, J.P., Maire, F. (eds.) IDEAL 2005. LNCS, vol.\u00a03578, pp. 109\u2013116. Springer, Heidelberg (2005)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Christen, P.: A survey of indexing techniques for scalable record linkage and deduplication. IEEE Transactions on Knowledge and Data Engineering\u00a024 (2012)","DOI":"10.1109\/TKDE.2011.127"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-01307-2_47","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P. Christen","year":"2009","unstructured":"Christen, P., Pudjijono, A.: Accurate synthetic generation of realistic personal information. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS, vol.\u00a05476, pp. 507\u2013514. Springer, Heidelberg (2009)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-01307-2_47","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P. Christen","year":"2009","unstructured":"Christen, P., Pudjijono, A.: Accurate Synthetic Generation of Realistic Personal Information. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS, vol.\u00a05476, pp. 507\u2013514. Springer, Heidelberg (2009), http:\/\/dx.doi.org\/10.1007\/978-3-642-01307-2_47"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Christen, P., Vatsalan, D.: Flexible and Extensible Generation and Corruption of Personal Data. In: Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM 2013) (2013)","DOI":"10.1145\/2505515.2507815"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Clauset, A., Newman, M.E., Moore, C.: Finding community structure in very large networks. Physical Review E\u00a070, 066111 (2004)","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"20_CR7","unstructured":"Durham, E.A.: A framework for accurate, efficient private record linkage. Ph.D. thesis, Vanderbilt University (2012)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S. Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Physics Reports\u00a0486, 75\u2013174 (2010)","journal-title":"Physics Reports"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1561\/2200000005","volume":"2","author":"A. Goldenberg","year":"2010","unstructured":"Goldenberg, A., Zheng, A.X., Fienberg, S.E., Airoldi, E.M.: A survey of statistical network models. Foundations and Trends\u00ae in Machine Learning\u00a02, 129\u2013233 (2010)","journal-title":"Foundations and Trends\u00ae in Machine Learning"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-33627-0_11","volume-title":"Privacy in Statistical Databases","author":"R. Hall","year":"2012","unstructured":"Hall, R., Fienberg, S.: Valid statistical inference on automatically matched files. In: Domingo-Ferrer, J., Tinnirello, I. (eds.) PSD 2012. LNCS, vol.\u00a07556, pp. 131\u2013142. Springer, Heidelberg (2012)"},{"key":"20_CR11","volume-title":"Data Quality and Record Linkage Techniques","author":"T. Herzog","year":"2007","unstructured":"Herzog, T., Scheuren, F., Winkler, W.: Data Quality and Record Linkage Techniques. Springer, New York (2007)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Herzog, T., Scheuren, F., Winkler, W.: Record linkage. Wiley Interdisciplinary Reviews: Computational Statistics\u00a02 (2010), doi:10.1002\/wics.108","DOI":"10.1002\/wics.108"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Karakasidis, A., Verykios, V.S.: Reference table based k-anonymous private blocking. In: Proceedings of the 27th Annual ACM Symposium on Applied Computing, pp. 859\u2013864. ACM (2012)","DOI":"10.1145\/2245276.2245444"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-22263-4_13","volume-title":"Privacy Enhancing Technologies","author":"M. Kuzu","year":"2011","unstructured":"Kuzu, M., Kantarcioglu, M., Durham, E., Malin, B.: A constraint satisfaction cryptanalysis of bloom filters in private record linkage. In: Fischer-H\u00fcbner, S., Hopper, N. (eds.) PETS 2011. LNCS, vol.\u00a06794, pp. 226\u2013245. Springer, Heidelberg (2011)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-319-06605-9_37","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H. Liang","year":"2014","unstructured":"Liang, H., Wang, Y., Christen, P., Gayler, R.: Noise-tolerant approximate blocking for dynamic real-time entity resolution. In: Tseng, V.S., Ho, T.B., Zhou, Z.-H., Chen, A.L.P., Kao, H.-Y. (eds.) PAKDD 2014, Part II. LNCS, vol.\u00a08444, pp. 449\u2013460. Springer, Heidelberg (2014)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"McCallum, A., Nigam, K., Ungar, L.H.: Efficient clustering of high-dimensional data sets with application to reference matching. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 169\u2013178. ACM (2000)","DOI":"10.1145\/347090.347123"},{"key":"20_CR17","unstructured":"Pasula, H., Marthi, B., Milch, B., Russell, S., Shpitser, I.: Identity uncertainty and citation matching. In: Advances in Neural Information Processing Systems, pp. 1425\u20131432 (2003)"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1016\/j.patrec.2010.04.004","volume":"31","author":"L. Paulev\u00e9","year":"2010","unstructured":"Paulev\u00e9, L., J\u00e9gou, H., Amsaleg, L.: Locality sensitive hashing: A comparison of hash function types and querying mechanisms. Pattern Recognition Letters\u00a031, 1348\u20131358 (2010)","journal-title":"Pattern Recognition Letters"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Rajaraman, A., Ullman, J.D.: Mining of massive datasets. Cambridge University Press (2012)","DOI":"10.1017\/CBO9781139058452"},{"key":"20_CR20","unstructured":"Steorts, R.C., Hall, R., Fienberg, S.: A Bayesian approach to graphical record linkage and de-duplication (2013) (submitted)"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-37456-2_29","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"D. Vatsalan","year":"2013","unstructured":"Vatsalan, D., Christen, P.: Sorted nearest neighborhood clustering for efficient private blocking. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013, Part II. LNCS, vol.\u00a07819, pp. 341\u2013352. Springer, Heidelberg (2013)"},{"key":"20_CR22","unstructured":"Vatsalan, D., Christen, P., Verykios, V.S.: An efficient two-party protocol for approximate matching in private record linkage. In: Proceedings of the Ninth Australasian Data Mining Conference, vol.\u00a0121, pp. 125\u2013136. Australian Computer Society, Inc. (2011)"},{"key":"20_CR23","unstructured":"Winkler, W., Yancey, W., Porter, E.: Fast record linkage of very large files in support of decennial and administrative records projects. In: Proceedings of American Statistical Association Section on Survey Research Methods (2010)"}],"container-title":["Lecture Notes in Computer Science","Privacy in Statistical Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11257-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T13:21:51Z","timestamp":1689513711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11257-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319112565","9783319112572"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11257-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}