[1]姚瑶,吉根林.面向垂直划分数据库的隐私保护分布式聚类算法[J].南京师范大学学报(工程技术版),2008,08(04):099-102.
 Yao Yao,Ji Genlin.Privacy-Preserving Distributed Clustering Algorithm Facing Vertically Partitioned Databases[J].Journal of Nanjing Normal University(Engineering and Technology),2008,08(04):099-102.
点击复制

面向垂直划分数据库的隐私保护分布式聚类算法
分享到:

南京师范大学学报(工程技术版)[ISSN:1006-6977/CN:61-1281/TN]

卷:
08卷
期数:
2008年04期
页码:
099-102
栏目:
出版日期:
2008-12-30

文章信息/Info

Title:
Privacy-Preserving Distributed Clustering Algorithm Facing Vertically Partitioned Databases
作者:
姚瑶;吉根林;
南京师范大学数学与计算机科学学院, 江苏南京210097
Author(s):
Yao YaoJi Genlin
School of Mathematics and Computer Science,Nanjing Normal University,Nanjing 210097,China
关键词:
分布式聚类 隐私保护 扰乱技术
Keywords:
d istr ibuted c luste ring pr ivacy prese rv ing perturbation technology
分类号:
TP311.13
摘要:
针对垂直划分的分布式数据库提出了一种基于隐私保护的分布式聚类算法PPDC-VP,该算法基于K-Means的思想实现分布式聚类,并且聚类过程中应用扰乱技术保护本站点真实信息不被传送到其它站点,从而达到隐私保护的目的.理论分析和实验结果表明PPDC-VP算法是有效的.
Abstract:
A im ing at the ve rtica lly partitioned database, th is paper presents a d istributed cluste ring algorithm PPDC- VP based on privacy-preserv ing. The a lgo rithm is based on the idea o f K-M eans to realize distributed c luste ring, and uses the perturbation technology to protect the rea l info rma tion o f the site from be ing transferred to other sites in c lustering procedure. Theore tica l ana lysis and expe rim en tal results show that algorithm PPDC- VP is effective

参考文献/References:

[ 1] Kantabutra S, Couch A L. Paralle l k-m eans cluster ing a lgo rithm on Now s[ J]. NECTEC Technical Journa,l 2000, 1( 6): 243-247.
[ 2] Januzaj E, Kr iege lH P, Pfe ifleM. DBDC: density based d istributed c luste ring[ C] / / Pro c the 9th Int’ lConf Ex tending Database Techno logy. H erak lion, G reece: Springer, 2004: 88-105.
[ 3] S tan ley R M, Olive ira, Osm arR Za iane. Privacy preserving c lustering by data transform ation[ C] / / Proc o f the 18 th B razilian Symposium on Databases. M anaus, Brazi:l Springer, 2003: 304-318.
[ 4] Stanley R M, O live ira Osm ar R. Za iane. Ach iev ing privacy preservation when shar ing data for cluster ing [ C ] / / Proc of the Interna
tiona lWo rkshop on Secure DataM anagem ent in a ConnectedWo rld. To ronto, Canada: Spr inge r, 2004: 67-82.
[ 5] Lin X, C lifton C, ZhuM. Privacy preserv ing cluste ringw ith distr ibuted EM m ix turem ode ling[ J]. Know ledge and Inform ation System s, 2005, 8( 1): 68-81.
[ 6] Va idya J, C lifton C. Privacy-preserv ing K-m eans cluster ing [ C ] / / The 9th ACM SIGKDD Internationa l Con ference on Knowledge D iscovery and DataM in ing. W ashing ton DC, USA: ACM Press, 2003: 593-599.
[ 7] B Germ an. G lass Identification Database[ DB /OL]. 1987[ 2007] http: / /m learn. ics. uc.i edu /da tabases
[ 8] V ision Group. Im age Segm enta tion data[ DB /OL]. 1990[ 2007] http: / /m lea rn. ics. uc.i edu /databases /statlog /segm ent

备注/Memo

备注/Memo:
基金项目: 国家自然科学基金( 40771163)资助项目.
通讯联系人: 吉根林, 教授, 博士生导师, 研究方向: 数据挖掘技术及其应用. E-m ail: glji@n jnu. edu. cn
更新日期/Last Update: 2013-04-24