摘要
结合粒计算粗糙集理论和k-匿名理论的最新研究现状,从粒化角度出发,提出个性粒化k-匿名隐私保护方法.针对电子商务中隐私保护个性粒化决策选择度的不同,提出一种新的隐私保护方法:个性粒化k-匿名并给出了相关算法和定义,旨在实现更为合理的个性化隐私保护,提高隐私保护的精度.
Based on the researches of recently granular computing rough set theory and k-anonymous theory, we propose a new anonymous method, called personalized-granular k- anonymity. It is the first time we use private granular decision to decide the privacy preser- vation degree, which can be clustered into different spacious, to achieve the different privacy protection demands. The heuristic algorithms and the correlative definitions are also given in the paper. It has been theoretically proved that the new method can achieve more reasonable privacy protection, and improve its accuracy.
出处
《数学的实践与认识》
CSCD
北大核心
2010年第11期97-104,共8页
Mathematics in Practice and Theory
基金
河北省教育厅科学研究计划项目"保护隐私的分类挖掘技术研究"(2009421)
关键词
粒计算
粗糙集
电子商务
个性粒化
K-匿名
隐私保护
granular computing
rough set
decision table decomposition
private granularity
k-anonymity
private protection