Parallel computing techniques for high-performance probabilistic record linkage
暂无分享,去创建一个
[1] William E. Winkler. Quality of Very Large Databases , 2001 .
[2] Dennis Shasha,et al. An extensible Framework for Data Cleaning , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[3] Erhard Rahm,et al. Data Cleaning: Problems and Current Approaches , 2000, IEEE Data Eng. Bull..
[4] Salvatore J. Stolfo,et al. The merge/purge problem for large databases , 1995, SIGMOD '95.
[5] Lawrence Philips,et al. The double metaphone search algorithm , 2000 .
[6] Howard B. Newcombe,et al. Record linkage: making maximum use of the discriminating power of identifying information , 1962, CACM.
[7] William W. Cohen. The WHIRL Approach to Integration: An Overview , 1998 .
[8] Andrian Marcus,et al. Data Cleansing: Beyond Integrity Analysis , 2000, IQ.
[9] Anil Sethi,et al. Matching records in a national medical patient index , 2001, CACM.
[10] William E. Winkler,et al. Approximate String Comparison and its Effect on an Advanced Record Linkage System , 1997 .
[11] Andrian Marcus,et al. Data Cleansing: Beyond Integrity Analysis 1 , 2000 .
[12] C. Kelman,et al. Monitoring Health Care Using National Administrative Data Collections , 2000 .
[13] Ivan P. Fellegi,et al. A Theory for Record Linkage , 1969 .
[14] George Karypis,et al. Introduction to Parallel Computing , 1994 .
[15] William E. Yancey. Frequency-Dependent Probability Measures for Record Linkage , 2000 .
[16] Ahmed K. Elmagarmid,et al. Automating the approximate record-matching process , 2000, Inf. Sci..
[17] Peter Christen,et al. A Toolbox Approach to Flexible and Efficient Data Mining , 2001, PAKDD.