期刊文献+

向量空间中基于隐私保护的记录链接协议 被引量:1

Record Linking Protocol Based on Privacy-preserving in Vector Space
下载PDF
导出
摘要 以往的记录链接技术通常要求数据向某一方或第三方公开,常采用数据隐藏或加密技术进行隐私保护,其缺点是降低数据的准确性或不能很好地保持数据之间的距离。提出利用复杂对象匹配领域常用的嵌入式向量空间技术,选取随机参数生成新的坐标系,将记录通过映射算法嵌入到新空间再进行相似性比较。在保持数据间相对距离的基础上进行记录链接,在保证链接效果的同时实现隐私保护。分析证明了协议对链接双方数据的隐私保护要求。 The commonly used record - linking techniques normally require data to be disclosed to one of the participant parties or a third party. Data -hidden or encryption techniques normally be used to keep privacy,and as a result can reduce the veracity or can't preserve the distance of data. The embedding vector space techniques which are frequently used in complex objects matching area are proposed, by selecting random parameters to generate new coordinate system, embedding the original data into the new space and processing the similarity linking there. This Method keeps the distance of the data, and at the same time,preserves the privacy without reducing the linkage affection. The efficiency of the protocol is proved.
机构地区 上海金融学院
出处 《现代电子技术》 2009年第14期138-141,共4页 Modern Electronics Technique
基金 上海市教委科研创新资助项目(08ZZ171)
关键词 记录链接 嵌入式空间 隐私保护 映射算法 record linking vector space privacy - preserving mapping algorithm
  • 相关文献

参考文献10

  • 1Kelman C W,Bass J A,Holman D.Research Use of Linked Health Data-A Best Practice Protocol[J].ANZ Journal of Public Health,2002(26):251-255. 被引量:1
  • 2韩京宇,徐立臻,董逸生.一种大数据量的相似记录检测方法[J].计算机研究与发展,2005,42(12):2206-2212. 被引量:32
  • 3邱越峰,田增平,季文贇,周傲英.一种高效的检测相似重复记录的方法[J].计算机学报,2001,24(1):69-77. 被引量:72
  • 4Riesen K,Neuhaus M,Bunke H.Graph Embedding in Vector Spaces by Means of Prototype Selection[J].Graph-Based Representations in Pattern Recognition,2007:383-393. 被引量:1
  • 5Riesen K,Bunke H.Structural Classifier Ensembles for Vector Space Embedded Graphs[A].IJCNN 2007 Conference[C].2007(8):1 500-1 505. 被引量:1
  • 6Hjaltason G R,Samet H.Properties of Embedding Methods for Similarity Searching in Metric Spaces[A].IEEE TPAMI 25[C].2003(5):530-549. 被引量:1
  • 7佘春红,许向阳.关系数据库中近似重复记录的识别[J].计算机应用研究,2003,20(9):36-39. 被引量:7
  • 8Lawati A Al,Lee D,McDaniel P.Blocking-aware Private Record Linkage[A].Proc.IQIS[C].2005. 被引量:1
  • 9Trepetin S.Privacy-Preserving String Comparisons in Record Linkage Systems:A Review[J].Information Security Journal:A Global Perspective,2008 (17):253-266. 被引量:1
  • 10Bertino E,Elmag A.Privacy Preserving Schema and Data Matching[A].Proc.of ACM SIGMOD-PODS 2007 Conference[C].2007:653-664. 被引量:1

二级参考文献34

  • 1[1]Bitton D, DeWitt D J. Duplicate record elimination in large data files. ACM Trans Database Systems, 1983, 8(2):255-65 被引量:1
  • 2[2]Hernandez M, Stolfo S. The Merge/Purge problem for large databases. In: Proc ACM SIGMOD International Conference on Management of Data, 1995. 127-138 被引量:1
  • 3[3]Howard B Newcombe, Kennedy J M, Axford S J, James A P. Automatic linkage of vital records. Science, 1959, 130:954-959 被引量:1
  • 4[4]DeWitt D J, Naught J F, Schneider D A. An evaluation of non-equijoin algorithms. In: Proc 17th International Conference on Very Large Databases, Barcelona, Spain, 1991. 443-452 被引量:1
  • 5[5]Hylton J A. Identifying and merging related bibliographic records[MS dissertation]. MIT: MIT Laboratory for Computer Science Technical Report 678, 1996 被引量:1
  • 6[6]Monge A E, Elkan C P. An efficient domain-independent algorithm for detecting approximately duplicate database records. In: Proc DMKD'97, Tucson Arizona, 1997 被引量:1
  • 7[7]Kukich K. Techniques for automatically correcting words in text. ACM Computing Surveys, 1992, 24(4):377-439 被引量:1
  • 8[8]Wagner R A, Fischer M J. The string-to-string correction problem. J ACM, 1974, 21(1):168-173 被引量:1
  • 9[9]Lowrance R, Robert A Wagner. An extension of the string-to-string correction problem. J ACM, 1975, 22(2):177-183 被引量:1
  • 10[10] Sellers P H. On the theory and computation of evolutionary distances. SIAM J Applied Mathematics, 1974, 26(4):787-793 被引量:1

共引文献96

同被引文献36

  • 1Redman T C. The impact of poor data quality on the typical en- terprise[J]. Communication of ACM, 1998,41(2):79 82. 被引量:1
  • 2Bilenko M, Mooney R. Adaptive Duplicate Detection Using Learnable String Similarity Measures[C]//KDD 2003. 2003:39-48. 被引量:1
  • 3Christen P. Automatic record linkage using seeded nearest neighbour and support vector machine classification[C]//KDD 2008. 2008:151-159. 被引量:1
  • 4Chen Z, et al. Exploiting context analysis for combining multipleentity resolution systems[C]//SIGMOD 2009. 2009:207-218. 被引量:1
  • 5Sarawagi R. Answering Table Gupta : S. Augmentation Que ries from Unstructured Lists on the Web[J]. PVLDB, 2009,2 (1) :289-300. 被引量:1
  • 6Fellegi I, Sunter A. A Theory for Record Linkage [J]. JASA 1969,64(328) : 1183-1210. 被引量:1
  • 7Bhattacharya I,Getoor L. Collective Entity Resolution in Rela- tional Data[C]//TKDD 2007. 2007. 被引量:1
  • 8Richardson M, Domingos P. Markov logic networks [J]. Ma- chineLearning, 2006,62 (1/2) : 107-136. 被引量:1
  • 9Dong X, et al. Reference Recounciliation in Complex Information Spaces[C]//SIGMOD 2005. 2005. 被引量:1
  • 10Bhattacharya I, Getoor L. A Latent Dirichlet Model for Unsu- pervised Entity Resolution[C]//SDM 2007. 2007. 被引量:1

引证文献1

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部