Robust Record Linkage Blocking Using Suffix Arrays and Bloom Filters
暂无分享,去创建一个
Sanjay Chawla | Peter Christen | Hui Ke | Timothy de Vries | S. Chawla | P. Christen | T. D. Vries | Huishu Ke
[1] Jiawei Han,et al. ACM Transactions on Knowledge Discovery from Data: Introduction , 2007 .
[2] J. T. Marshall. Canada's national vital statistics index , 1947 .
[3] Ivan P. Fellegi,et al. A Theory for Record Linkage , 1969 .
[4] Bernard Chazelle,et al. The Bloomier filter: an efficient data structure for static support lookup tables , 2004, SODA '04.
[5] Ahmed K. Elmagarmid,et al. Duplicate Record Detection: A Survey , 2007, IEEE Transactions on Knowledge and Data Engineering.
[6] Matthew A. Jaro,et al. Advances in Record-Linkage Methodology as Applied to Matching the 1985 Census of Tampa, Florida , 1989 .
[7] Andrei Broder,et al. Network Applications of Bloom Filters: A Survey , 2004, Internet Math..
[8] Panagiotis G. Ipeirotis,et al. Duplicate Record Detection: A Survey , 2007 .
[9] Sanjay Chawla,et al. Robust record linkage blocking using suffix arrays , 2009, CIKM.
[10] Salvatore J. Stolfo,et al. Real-world Data is Dirty: Data Cleansing and The Merge/Purge Problem , 1998, Data Mining and Knowledge Discovery.
[11] M. Goldacre,et al. Computerised linking of medical records: methodological guidelines. , 1993, Journal of epidemiology and community health.
[12] Peter Christen. Towards Parameter-free Blocking for Scalable Record Linkage , 2007 .
[13] Peter Christen,et al. A Comparison of Fast Blocking Methods for Record Linkage , 2003, KDD 2003.
[14] Michael Mitzenmacher,et al. Compressed bloom filters , 2001, PODC '01.
[15] Peter Christen,et al. Febrl -: an open source data cleaning, deduplication and record linkage system with a graphical user interface , 2008, KDD.
[16] Lifang Gu,et al. Record Linkage: Current Practice and Future Directions , 2003 .
[17] Rainer Schnell,et al. Bmc Medical Informatics and Decision Making Privacy-preserving Record Linkage Using Bloom Filters , 2022 .
[18] Michael Mitzenmacher,et al. Less hashing, same performance: Building a better Bloom filter , 2008 .
[19] Keizo Oyama,et al. A Fast Linkage Detection Scheme for Multi-Source Information Integration , 2005, International Workshop on Challenges in Web Information Retrieval and Integration.
[20] C. Lee Giles,et al. Adaptive sorted neighborhood methods for efficient record linkage , 2007, JCDL '07.
[21] JUSTIN ZOBEL,et al. Inverted files for text search engines , 2006, CSUR.
[22] Peter Christen,et al. A Comparison of Personal Name Matching: Techniques and Practical Issues , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).
[23] Andrew McCallum,et al. Efficient clustering of high-dimensional data sets with application to reference matching , 2000, KDD '00.
[24] Stasha Ann Bown Larsen,et al. Record Linkage , 2018, Encyclopedia of Database Systems.
[25] Howard B. Newcombe,et al. Record linkage: making maximum use of the discriminating power of identifying information , 1962, CACM.
[26] Ahmed K. Elmagarmid,et al. TAILOR: a record linkage toolbox , 2002, Proceedings 18th International Conference on Data Engineering.
[27] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[28] Chen Li,et al. Efficient record linkage in large data sets , 2003, Eighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings..
[29] W. Winkler. Overview of Record Linkage and Current Research Directions , 2006 .
[30] Jaideep Vaidya,et al. Privacy-preserving indexing of documents on the network , 2003, The VLDB Journal.
[31] Michael Mitzenmacher,et al. Less hashing, same performance: Building a better Bloom filter , 2006, Random Struct. Algorithms.
[32] P. Ivax,et al. A THEORY FOR RECORD LINKAGE , 2004 .