首页 | 本学科首页   官方微博 | 高级检索  
     

基于隐私保护的分类挖掘
引用本文:葛伟平,汪卫,周皓峰,施伯乐.基于隐私保护的分类挖掘[J].计算机研究与发展,2006,43(1):39-45.
作者姓名:葛伟平  汪卫  周皓峰  施伯乐
作者单位:复旦大学计算机与信息技术系,上海,200433
基金项目:中国科学院资助项目;国家科技攻关项目
摘    要:基于隐私保护的分类挖掘是近年来数据挖掘领域的热点之一,如何对原始真实数据进行变换,然后在变换后的数据集上构造判定树是研究的重点.基于转移概率矩阵提出了一个新颖的基于隐私保护的分类挖掘算法,可以适用于非字符型数据(布尔类型、分类类型和数字类型)和非均匀分布的原始数据,可以变换标签属性.实验表明该算法在变换后的数据集上构造的分类树具有较高的精度.

关 键 词:数据挖掘  分类  判定树  隐私保护  转移概率矩阵
收稿时间:07 12 2004 12:00AM
修稿时间:2004-07-122005-05-17

Privacy Preserving Classification Mining
Ge Weiping,Wang Wei,Zhou Haofeng,Shi Baile.Privacy Preserving Classification Mining[J].Journal of Computer Research and Development,2006,43(1):39-45.
Authors:Ge Weiping  Wang Wei  Zhou Haofeng  Shi Baile
Affiliation:Department of Computing and Information Technology, Fudan University, Shanghai 200433
Abstract:Privacy preserving classification mining is one of the fast-growing sub-areas of data mining. How to perturb original data and then build a decision tree based on perturbed data is the key research challenge. By applying transition probability matrix a novel privacy preserving classification mining algorithm is proposed, which suits non-char type data (Boolean, categorical, and numeric type) and non-uniform probability distribution of original data, and can perturb label attribute. Experimental results demonstrate that the decision tree built using this algorithm on perturbed data has a classifying accuracy comparable to that of the decision tree built using un-privacy-preserving algorithm on original data.
Keywords:data mining  classification  decision tree  privacy preserving  transition probability matrix
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号