基于小波变换的分布式隐私保护聚类算法  

Privacy preserving clustering algorithm based on wavelet transform for distributed data

作　　者：薛安荣[1] 刘彬[1] 闻丹丹[1] 

机构地区：[1]江苏大学计算机科学与通信工程学院,江苏镇江212013

出　　处：《计算机应用》2014年第4期1029-1033,共5页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60773049)

摘　　要：针对现有隐私保护聚类算法无法满足效率与隐私之间较好折中的问题,提出一种基于安全多方计算(SMC)与数据扰动相结合的分布式隐私保护聚类算法。各数据方用小波变换实现数据压缩和信息隐藏,并用属性列的随机重排来防止数据重构可能产生的信息泄露。该算法仅使用压缩重排后的数据参与分布聚类计算,因此计算量和通信量小,算法效率高,而多重保护措施有效保护了隐私数据。因小波变换具有高保真性,所以聚类精度受小波变换的影响较小。理论分析和实验结果表明,所提算法安全高效,在处理高维数据时全局F测量值和执行效率优于基于Haar小波的离散余弦变换(DCT-H)算法,解决了效率与隐私之间的折中问题。The existing privacy preserving clustering data mining algorithms cannot meet better trade-off between efficiency and privacy.To resolve this problem,a distributed privacy preserving clustering algorithm based on Secure Multiparty Computation （SMC） combined with perturbation was proposed.Data owners utilized the wavelet to achieve both data reduction and information hiding,and rearranged the attribute columns randomly to prevent data reconstruction which has potential danger of causing information disclosure.The proposed algorithm reduced computation and communication cost because it only used reduced data in its computation.Thus the efficiency of the algorithm was improved.At the same time,the incorporation of multiple protection measures in the computation effectively preserved data privacy.The clustering accuracy was less affected because of the high dependabihty of wavelet transform.The theoretical analysis and experimental results indicate that the proposed algorithm is secure and highly effective,and the overall F-measure and the efficiency of the proposed algorithm outperform the DCT-H （Discrete Cosine Transform-Haar） algorithm when dealing with high-dimensional datasets.Above all,it effectively resolves the trade-off issue between efficiency and privacy.

关 键 词：隐私保护 聚类 小波变换 安全多方计算 分布式 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]