IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v51y2022i18p6182-6196.html
   My bibliography  Save this article

Assessing the accuracy of individual link with varying block sizes and cutoff values using MaCSim approach

Author

Listed:
  • Shovanur Haque
  • Kerrie Mengersen

Abstract

Record linkage is the process of matching together records from different data sources that belong to the same entity. Record linkage is increasingly being used by many organizations including statistical, health, government etc. to link administrative, survey, and other files to create a robust file for more comprehensive analysis. Therefore, it becomes necessary to assess the ability of a linking method to achieve high accuracy or compare between methods with respect to accuracy. In this paper, we evaluate the accuracy of individual link using varying block sizes and different cutoff values by utilizing a Markov Chain based Monte Carlo simulation approach (MaCSim). MaCSim utilizes two linked files to create an agreement matrix. The agreement matrix is simulated to generate re-sampled versions of the agreement matrix. A defined linking method is used in each simulation to link the files and the accuracy of the linking method is assessed. The aim of this paper is to facilitate optimal choice of block size and cutoff value to achieve high accuracy in terms of minimizing average False Discovery Rate and False Negative Rate. The analyses have been performed using a synthetic dataset provided by the Australian Bureau of Statistics (ABS) and indicated promising results.

Suggested Citation

  • Shovanur Haque & Kerrie Mengersen, 2022. "Assessing the accuracy of individual link with varying block sizes and cutoff values using MaCSim approach," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 51(18), pages 6182-6196, September.
  • Handle: RePEc:taf:lstaxx:v:51:y:2022:i:18:p:6182-6196
    DOI: 10.1080/03610926.2020.1857771
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2020.1857771
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2020.1857771?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:51:y:2022:i:18:p:6182-6196. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.