{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:02Z","timestamp":1740108242326,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T00:00:00Z","timestamp":1560297600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T00:00:00Z","timestamp":1560297600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100009001","name":"University of York","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100009001","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Stat"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00180-019-00901-2","type":"journal-article","created":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T12:02:25Z","timestamp":1560340945000},"page":"871-891","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing expectations and marginal likelihoods for permutations"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0247-7713","authenticated-orcid":false,"given":"Ben","family":"Powell","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5337-2746","authenticated-orcid":false,"given":"Paul A.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,12]]},"reference":[{"issue":"430","key":"901_CR1","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1080\/01621459.1995.10476563","volume":"90","author":"TR Belin","year":"1995","unstructured":"Belin TR, Rubin DB (1995) A method for calibrating false-match rates in record linkage. J Am Stat Assoc 90(430):694\u2013707","journal-title":"J Am Stat Assoc"},{"unstructured":"Berkelaar M et al (2015) lpSolve: interface to \u2018Lpsolve\u2019 v. 5.5 to solve linear\/integer programs. R package version 5.6.13. \nhttps:\/\/CRAN.R-project.org\/package=lpSolve","key":"901_CR2"},{"issue":"1","key":"901_CR3","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BF01584237","volume":"21","author":"DP Bertsekas","year":"1981","unstructured":"Bertsekas DP (1981) A new algorithm for the assignment problem. Math Program 21(1):152\u2013171","journal-title":"Math Program"},{"doi-asserted-by":"crossref","unstructured":"Bilenko M, Kamath B, Mooney RJ (2006) Adaptive blocking: learning to scale up record linkage. In: 2006. ICDM\u201906. 6th international conference on data mining. IEEE, New York, pp 87\u201396","key":"901_CR4","DOI":"10.1109\/ICDM.2006.13"},{"issue":"2","key":"901_CR5","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0097-3165(77)90051-6","volume":"22","author":"RA Brualdi","year":"1977","unstructured":"Brualdi RA, Gibson PM (1977) Convex polyhedra of doubly stochastic matrices. I. Applications of the permanent function. J Comb Theory Ser A 22(2):194\u2013230. \nhttps:\/\/doi.org\/10.1016\/0097-3165(77)90051-6","journal-title":"J Comb Theory Ser A"},{"issue":"1","key":"901_CR6","first-page":"2029","volume":"14","author":"M Chertkov","year":"2013","unstructured":"Chertkov M, Yedidia AB (2013) Approximating the permanent with fractional belief propagation. J Mach Learn Res 14(1):2029\u20132066","journal-title":"J Mach Learn Res"},{"issue":"2\u20133","key":"901_CR7","first-page":"55","volume":"9","author":"N Cibella","year":"2007","unstructured":"Cibella N, Fortini M, Scannapieco M, Tosco L, Tuoto T et al (2007) Relais: an open source toolkit for record linkage. Riv Stat Ufficiale 9(2\u20133):55\u201368","journal-title":"Riv Stat Ufficiale"},{"issue":"3","key":"901_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/363958.363994","volume":"7","author":"FJ Damerau","year":"1964","unstructured":"Damerau FJ (1964) A technique for computer detection and correction of spelling errors. Commun ACM 7(3):171\u2013176","journal-title":"Commun ACM"},{"key":"901_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1214\/lnms\/1215090070","volume":"36","author":"P Diaconis","year":"2001","unstructured":"Diaconis P, Graham R, Holmes SP (2001) Statistical problems involving permutations with restricted positions. Lect Notes Monogr Ser 36:195\u2013222","journal-title":"Lect Notes Monogr Ser"},{"issue":"1","key":"901_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2007.250581","volume":"19","author":"AK Elmagarmid","year":"2007","unstructured":"Elmagarmid AK, Ipeirotis PG, Verykios VS (2007) Duplicate record detection: a survey. IEEE Trans Knowl Data Eng 19(1):1\u201316","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"328","key":"901_CR11","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1080\/01621459.1969.10501049","volume":"64","author":"IP Fellegi","year":"1969","unstructured":"Fellegi IP, Sunter AB (1969) A theory for record linkage. J Am Stat Assoc 64(328):1183\u20131210","journal-title":"J Am Stat Assoc"},{"unstructured":"Hankin RKS (2017) Permutations: permutations of a finite set. R package version 1.0-2. \nhttps:\/\/CRAN.R-project.org\/package=permutations","key":"901_CR12"},{"issue":"3","key":"901_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1093\/comjnl\/6.3.293","volume":"6","author":"BR Heap","year":"1963","unstructured":"Heap BR (1963) Permutations by interchanges. Comput J 6(3):293\u2013298. \nhttps:\/\/doi.org\/10.1093\/comjnl\/6.3.293","journal-title":"Comput J"},{"key":"901_CR14","volume-title":"Data quality and record linkage techniques","author":"T Herzog","year":"2007","unstructured":"Herzog T, Scheuren F, Winkler W (2007) Data quality and record linkage techniques. Springer, New York"},{"issue":"9","key":"901_CR15","doi-asserted-by":"publisher","first-page":"2756","DOI":"10.1016\/j.csda.2012.02.026","volume":"56","author":"G Kim","year":"2012","unstructured":"Kim G, Chambers R (2012) Regression analysis under incomplete linkage. Comput Stat Data Anal 56(9):2756\u20132770. \nhttps:\/\/doi.org\/10.1016\/j.csda.2012.02.026","journal-title":"Comput Stat Data Anal"},{"key":"901_CR16","volume-title":"The art of computer programming: generating all tuples and permutations. Addison-Wesley series in computer science and information proceedings","author":"D Knuth","year":"2005","unstructured":"Knuth D (2005) The art of computer programming: generating all tuples and permutations. Addison-Wesley series in computer science and information proceedings. Addison-Wesley, Reading"},{"issue":"469","key":"901_CR17","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1198\/016214504000001277","volume":"100","author":"P Lahiri","year":"2005","unstructured":"Lahiri P, Larsen MD (2005) Regression analysis with linked data. J Am Stat Assoc 100(469):222\u2013230. \nhttps:\/\/doi.org\/10.1198\/016214504000001277","journal-title":"J Am Stat Assoc"},{"unstructured":"McLeod P, Heasman D, Forbes I (2011) Simulated record linkage data. Technical report, Office for National Statistics. \nhttps:\/\/ec.europa.eu\/eurostat\/cros\/content","key":"901_CR18"},{"unstructured":"Mersmann O (2018) Microbenchmark: accurate timing functions. R package version 1.4-6. \nhttps:\/\/CRAN.R-project.org\/package=microbenchmark","key":"901_CR19"},{"unstructured":"Michelson M, Knoblock CA (2006) Learning blocking schemes for record linkage. In: Association for the advancement of artificial intelligence, pp 440\u2013445","key":"901_CR20"},{"key":"901_CR21","first-page":"1160","volume":"99","author":"H Pasula","year":"1999","unstructured":"Pasula H, Russell S, Ostland M, Ritov Y (1999) Tracking many objects with many sensors. Int Joint Conf Artif Intell 99:1160\u20131171","journal-title":"Int Joint Conf Artif Intell"},{"issue":"17","key":"901_CR22","doi-asserted-by":"publisher","first-page":"5305","DOI":"10.1016\/j.disc.2007.11.048","volume":"309","author":"F Ruskey","year":"2009","unstructured":"Ruskey F, Williams A (2009) The coolest way to generate combinations. Discrete Math 309(17):5305\u20135320","journal-title":"Discrete Math"},{"key":"901_CR23","volume-title":"Combinatorial mathematics. Carus mathematical monographs","author":"H Ryser","year":"1963","unstructured":"Ryser H (1963) Combinatorial mathematics. Carus mathematical monographs. Mathematical Association of America, New York"},{"unstructured":"Savicky P (2014) Pspearman: Spearman\u2019s rank correlation test. R package version 0.3-0. \nhttps:\/\/CRAN.R-project.org\/package=pspearman","key":"901_CR24"},{"issue":"1","key":"901_CR25","first-page":"39","volume":"19","author":"F Scheuren","year":"1993","unstructured":"Scheuren F, Winkler WE (1993) Regression analysis of data files that are computer matched. Surv Methodol 19(1):39\u201358","journal-title":"Surv Methodol"},{"key":"901_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11222-016-9712-8","volume":"28","author":"Y She","year":"2018","unstructured":"She Y, Tang S (2018) Iterative proportional scaling revisited: a modern optimization perspective. J Comput Graph Stat 28:1\u201313","journal-title":"J Comput Graph Stat"},{"unstructured":"Simpson GL (2016) Permute: functions for generating restricted permutations of data. R package version 0.9-4. \nhttps:\/\/CRAN.R-project.org\/package=permute","key":"901_CR27"},{"issue":"2","key":"901_CR28","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1214\/aoms\/1177703591","volume":"35","author":"R Sinkhorn","year":"1964","unstructured":"Sinkhorn R (1964) A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann Math Stat 35(2):876\u2013879. \nhttps:\/\/doi.org\/10.1214\/aoms\/1177703591","journal-title":"Ann Math Stat"},{"issue":"2","key":"901_CR29","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant LG (1979) The complexity of computing the permanent. Theor Comput Sci 8(2):189\u2013201","journal-title":"Theor Comput Sci"},{"doi-asserted-by":"crossref","unstructured":"Whang SE, Menestrina D, Koutrika G, Theobald M, Garcia-Molina H (2009) Entity resolution with iterative blocking. In: Proceedings of the 2009 ACM SIGMOD international conference on management of data. ACM, New York, pp 219\u2013232","key":"901_CR30","DOI":"10.1145\/1559845.1559870"},{"unstructured":"Yancey WE (2002) Bigmatch: A program for extracting probable matches from a large file for record linkage. Tech. Rep.\u00a01, US Census Bureau, \nhttps:\/\/www.census.gov\/srd\/papers\/pdf\/rrc2002-01.pdf","key":"901_CR31"}],"container-title":["Computational Statistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-019-00901-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00180-019-00901-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-019-00901-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T23:07:12Z","timestamp":1591830432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00180-019-00901-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,12]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["901"],"URL":"https:\/\/doi.org\/10.1007\/s00180-019-00901-2","relation":{},"ISSN":["0943-4062","1613-9658"],"issn-type":[{"type":"print","value":"0943-4062"},{"type":"electronic","value":"1613-9658"}],"subject":[],"published":{"date-parts":[[2019,6,12]]},"assertion":[{"value":"4 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}