面向聚类分析的邻域拓扑势熵数据扰动方法  

A neighborhood topological potential entropy data perturbation method for clustering analysis

作　　者：张冰[1] 杨静[1] 张健沛[1] 谢静[1] 

机构地区：[1]哈尔滨工程大学计算机科学与技术学院,黑龙江哈尔滨150001

出　　处：《哈尔滨工程大学学报》2014年第9期1149-1155,共7页Journal of Harbin Engineering University

基　　金：国家自然科学基金资助项目(61370083;61073043;61073041);高等学校博士学科点专项科研基金资助项目(20112304110011;20122304110012);哈尔滨市科技创新人才研究专项资金资助项目(优秀学科带头人)(2011RFXXG015)

摘　　要：针对现有数据扰动方法难以维持原始数据的聚类可用性问题,提出了一种隐私保护数据扰动算法DPTPE.基于邻域拓扑势熵将节点划分为不同类型,对于邻域分散型节点,以该节点的k邻域中节点坐标的均值替换其原始坐标;对于邻域紧密型节点,在其安全邻域中随机选择一个节点替换该节点。实验结果表明,DPTPE算法可以保护数据的隐私安全,还能够较好地维持数据集的聚类可用性。The existing data perturbation methods can hardly maintain the clustering results of the original data. As a trade-off, a privacy preserving data perturbation algorithm DPTPE is proposed, which partitions the nodes into two types. For a neighborhood dispersed node, use the average value of the nodes＆#39;k neighborhood values to replace the initial value;for a neighborhood concentrated node, randomly choose a node value from the nodes＆#39;safety neighborhood to replace the initial value. Experiments show that DPTPE algorithm can not only avoid leaking the data privacy, but can also better maintain the clustering utility of the data set.

关 键 词：隐私保护 聚类分析 数据扰动 邻域拓扑势熵 安全邻域 

分 类 号：TP391.4[自动化与计算机技术—计算机应用技术]