期刊文献+

基于滑动窗口的敏感关联规则隐藏 被引量:1

Sensitive association rule hiding based on sliding window
下载PDF
导出
摘要 提出了一种新的基于数据流的关联规则隐藏算法HSRDS,采用一种变化的频繁模式树(TFP-Tree)作为原始数据与清洗后数据的过渡结构,并结合滑动窗口技术,快速实现最新数据的敏感规则隐藏。同时在进行敏感关联规则隐藏的过程中,提出了两个阈值σ和δ,使得保证敏感规则成功隐藏的同时,也能最小化隐藏规则所产生的负面效应。 We propose an algorithm, HSRDS, which achieves the sensitive association rule hiding based on data stream. In this algorithm, we adopt Transformative FP-Tree (TFP-Tree) as transitional structure between original data set and sanitized data set, and complete the sensitive association rule hiding of the newest data combined with sliding window. Furthermore, in the progress of hiding sensitive association rule, we inject two thresholds that are σ and δ, to guarantee that the sensitive association rule can be hidden successfully, at the same time the side effect, resulting from the hiding sensitive rule, can be minimized.
出处 《吉林大学学报(工学版)》 EI CAS CSCD 北大核心 2013年第1期172-178,共7页 Journal of Jilin University:Engineering and Technology Edition
基金 国家自然科学基金项目(61073041 61073043) 黑龙江省自然科学基金项目(F200901) 哈尔滨市科技创新人才研究专项项目(2011RFXXG015 2010RFXXG002) 高等学校博士学科点专项科研基金项目(20112304110011)
关键词 计算机应用 敏感关联规则 数据挖掘 规则隐藏 computer application sensitive association rule data mining rule hiding
  • 相关文献

参考文献6

  • 1Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases [C]//Proc the ACM SIGMOD International Conference on Management of Data, Washington, DC, 1993.
  • 2Shyue-liang W, Jafari A. Hiding informative association rule sets[J]. Expert Systems with Applications,2007,33(2):316-323.
  • 3Shyue-liang W. Hiding sensitive predictive association rules[C]//IEEE International Conference on Information Reuse and Integration, 2005:164-169.
  • 4Oliveira S, Zaiane O. Protecting sensitive knowledge by data sanitization[C] // Proceedings of the Third IEEE International Conference on Data Mining, 2003:99-106.
  • 5Amiri A. Dare to share: protecting sensitive knowledge with data sanitization[J]. Decision Support Systems, 2007, 43(1) :181-191.
  • 6Agrawal R, Srikant R. Fast algorithms for mining association rules[C]//Conf of the 20 VLDB Conference, 1994 :487-499.

同被引文献14

  • 1徐计,王国胤,于洪.基于粒计算的大数据处理[J].计算机学报,2014,37(113):1-22.
  • 2Wu Weizhi,Leung Y,Mi Jusheng.Granular computing and knowledge reduction in formal contexts[J].IEEE Trans on Knowledge and Data Engineering,2009,21(10):1461-1474.
  • 3Ko P H.Granular computing for relational data classification[J].Journal of Intelligent Information Systems,2013,41(2):187-210.
  • 4Shen Yanguang,Shen Jing,Fan Yongjian.Study on the application of multilevel association rules based on granular computing[C] //Proc of IEEE International Conference on Intelligent Computation Technology and Automation.2010:564-567.
  • 5Fang Gang,Wu Yue.Frequent spatiotemporal association patterns mining based on granular computing[J].Informatica,2013,37(4):443-453.
  • 6Qiu Taorong,Chen Xiaoqing,Liu Qing,et al.Granular computing approach to finding association rules in relational database[J].International Journal of Intelligent Systems,2010,25(2):165-179.
  • 7Tsai Limin,Lin Shujing,Yang Donlin.Efficient mining of generalized negative association rules[C] //Proc of IEEE International Conference on Granular Computing.Washington DC:IEEE Computer Society,2010:471-476.
  • 8张春生,庄丽艳,李艳.Apriori算法低频规则的有效性及实现[J].计算机应用,2011,31(2):435-437. 被引量:4
  • 9董林,舒红,李莎.直接从空间数据中挖掘频繁模式[J].计算机应用研究,2013,30(8):2330-2333. 被引量:4
  • 10张春生,庄丽艳.基于Apriori的相容数据集间关联规则演绎方法[J].计算机应用,2013,33(10):2796-2800. 被引量:4

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部