| 基于移项的隐私保护关联规则挖掘算法 |
| |
| 引用本文： | 李霞,陈子军,吕庆春. 基于移项的隐私保护关联规则挖掘算法[J]. 计算机工程, 2009, 35(12): 59-60 |
| |
| 作者姓名： | 李霞 陈子军 吕庆春 |
| |
| 作者单位： | 燕山大学信息学院计算机科学与工程系,秦皇岛,066004;燕山大学信息学院计算机科学与工程系,秦皇岛,066004;燕山大学信息学院计算机科学与工程系,秦皇岛,066004 |
| |
| 摘 要： | 基于启发式规则的隐私保护关联规则挖掘算法中均通过删除项或增加项改变规则的支持度,对非敏感规则的支持度影响很大。针对上述不足,提出一种将删除项和增加项2种操作相结合的方法,在执行删除项操作后寻找合适的事务,对该事务执行增加项操作。实验结果表明,利用该算法清洗数据库所产生的规则丢失率和相异度均有所下降。
|
| 关 键 词： | 关联规则 隐私保护 数据挖掘 |
| 修稿时间： | |
Privacy Preserving Association Rule Mining Algorithm Based on Item-moving |
| |
| LI Xia,CHEN Zi-jun,LV Qing-chun. Privacy Preserving Association Rule Mining Algorithm Based on Item-moving[J]. Computer Engineering, 2009, 35(12): 59-60 |
| |
| Authors: | LI Xia CHEN Zi-jun LV Qing-chun |
| |
| Affiliation: | Department of Computer Science and Engineering;Information Institute;Yanshan University;Qinhuangdao 066004 |
| |
| Abstract: | All the heuristic approaches are realized by deleting an item or inserting an item,of which the negative effect on non-restricted rules is too much.Focusing on the shortcoming,this paper presents an algorithm combining those two operations,which insert an item into proper transaction after deleting that item.Experimental results show that privacy preserving data mining algorithm based on item-moving has lower miss rate and dissimilarity. |
| |
| Keywords: | association rule privacy preserving data mining |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
|
