作者: Stanley Trepetin
DOI: 10.1080/19393550802492503
关键词: Identifier 、 Linkage (mechanical) 、 Computer security 、 Information retrieval 、 Event (computing) 、 Record linkage 、 Ideal (set theory) 、 Computer science 、 Face (geometry) 、 String (computer science) 、 Data set (IBM mainframe)
摘要: We face a growing need to be able perform linkage among data set records connect about the same individual, organization or event so that further analysis becomes possible. At time, we also do better job of protecting privacy individuals identified by records. Therefore, it would ideal if could effectively performed based not on actual but some anonymous form without diminishing ability link whose identifiers are only “close” each other, equal, because typical recording errors. This paper reviews existing proposals for how such anonymized string comparisons might accomplished, demonstrates methods have various operational deficiencies. It therefore argues new, more capable needed.