期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

隐私保护数据挖掘算法MASK的改进 被引量：7

Improvement of MASK Algorithm in Privacy Preserving Data Mining
下载PDF
导出
摘要 为了在数据挖掘过程中既保护敏感信息和知识不被泄露,又使得到的挖掘结果相对准确,对XMASK算法进行改进。在重构原数据项支持度的过程中利用布尔集合的特性简化计数过程。通过实验将改进算法与原MASK算法和XMASK算法进行比对。结果表明,该算法提高了运行的时间效率。 How to prevent sensitive information and knowledge from leaking while getting relatively accurate mining results in the data mining process had become an important field of data mining re- search project. In this paper, based on XMASK algorithm, we used the features of Boolean set to sim- plify the counting distorted database process in the reconstruction of the original data support, which can significantly improve the time efficiency of MASK
作者 王茜 张鲲鹏
机构地区 重庆大学计算机学院
出处 《重庆理工大学学报（自然科学）》 CAS 2012年第6期63-66,共4页 Journal of Chongqing University of Technology：Natural Science
关键词 数据挖掘 隐私保护 MASK算法 时间效率 data mining privacy-preserving MASK algorithm time efficiency
分类号 TP311 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献8

  • 1Verykios V S, Bertino E, Fovino I N, et al. State-of-the- Art in privacy preserving datamining [ J ]. SIGMOD Record ,2004,33 ( 1 ) :50 - 57.
  • 2陈晓明,李军怀,彭军,刘海玲,张璟.隐私保护数据挖掘算法综述[J].计算机科学,2007,34(6):183-186. 被引量：16
  • 3Rizvi S, Haritsa J R. Maintaining Data Privacy in Association Rule Mining [ C ]//Proc. of 28^th Int. Conf. On Very Large Databases,USA: [s. n. ] ,2002.
  • 4武振华,刘山,崔健国.基于分治策略的MASK算法的改进[J].微计算机信息,2009,25(36):78-80. 被引量：1
  • 5Agrawal R,Imielinski T,Swami A. Mining association rules between sets of items in large databases [ C ]//Proc. Of ACM SIGMOD Intl. Conf. On management of data. USA: [ s. n. ] ,1993.
  • 6Agrawal S, Krishnan V, Haritsa J R. On addressing efficiency concerns in privacy-preserving minning [ M ]// Lee Y J,Li J Z,Whang K Y,et al. Proc. of the 9th Intl. Conf. On Database Systems for Advanced Applications. LNCX 2973. Jeju Island : Springer-Verlag, 2004 : 113 - 124.
  • 7黄毅群,卢正鼎,胡和平,李瑞轩.分布式环境下保持隐私的关联规则挖掘算法[J].计算机工程,2006,32(13):12-14. 被引量：7
  • 8Alexey Pryakhin, Matthias Schubert, Arthur Zimek, et al. Future trends in data mining [ J ]. Data Min Knowl Disc ,2007,15:87 - 97.

二级参考文献31

  • 1陈芸,张伟.隐私保护数据挖掘方法的研究[J].微计算机信息,2006(07X):239-241. 被引量：7
  • 2Verykios VS, Bertino E, Fovino IN, Provenza LP, Saygin Y, Theodoridis Y. State-of-the-Art in privacy preserving data mining. SIGMOD Record, 2004,33(1):50-57.
  • 3Han J, Kamber M. Data Mining: Concepts and Techniques. Beijing: China Machine Press, 2001.
  • 4Rizvi S, Haritsa J R. Maintaining Data Privacy in Association Rule Mining [C]. Proc. of 28th Int. Conf. on Very Large Databases, 2002.
  • 5D. Agrawal and C. Aggarwal, \On the Design and Quanti_cation of Privacy Preserving Data Mining Algorithms", Proc. of 20thACM Symp. on Principles of Database Systems (PODS), May 2001.
  • 6Agrawal R, Srikant R. Privacy-preserving Data Mining [C]. Prec. Of the ACM SIGMOD Conference on Management of Data. ACM Press,2000-05: 439--450.
  • 7Agrawal S, Krishnan V, Haritsa JR. On addressing efficiency concerns in privacy-preserving mining. In: Lee YJ, Li JZ, Whang KY, Lee D, eds. Proc. of the 9th Int'l Conf. on Database Systems for Advanced Applications. LNCS 2973, Jeju Island: Springer- Verlag,2004. 113-124.
  • 8Han Jiawei Kamber M.数据挖掘概念与技术[M].北京:机械工业出版社,2001..
  • 9Crannor L F,Reagle J,Ackerman M S.Beyond Concern:Understanding Net Users' Attitudes About Online Privacy[R].Technical Report TR 99.4.3,AT&T Labs-Research,1999-04.
  • 10Agrawal R,Srikant R.Privacy-preserving Data Mining[C].Proceedings of the ACM SIGMOD Conference on Management of Data,Dallas,TX,2000:439-450.

共引文献20

同被引文献70

  • 1陆介平,杨明,孙志挥,鞠时光.快速挖掘全局最大频繁项目集[J].软件学报,2005,16(4):553-560. 被引量：27
  • 2何波,王华秋,刘贞,王越.快速挖掘频繁项集的并行算法[J].计算机应用,2006,26(2):391-392. 被引量：5
  • 3刘挺,马金山,李生.基于词汇支配度的汉语依存分析模型[J].软件学报,2006,17(9):1876-1883. 被引量：24
  • 4Han Jia-wei, Kamber M. Data Mining:Concepts and Techniques [M]. Morgan Kaufmann Publishers, 2001.
  • 5Pfoser D,Jensen C S. Capturing the Uncertainty of Moving-Ob- jectRepresentations[C] // Proceedings of the 6th International Symposium on Advances inSpatial Databases. 1999:111-132.
  • 6UCI Machine Learning Repository [DB/OL]. http://archive. ies. uci. edu/ml/, 1992-07-16.
  • 7Ahrnad A, Dey L. A K-mean clustering algorithm for mixed nu- meric and categorical data[J]. Data and Knowledge Enginee- ring, 2007,63 : 503-527.
  • 8HanJiawei,MichelineKambe.数据挖掘概念与技术[M].北京:机械工业出版社,2012:13.
  • 9Agrawal R,ImielinSki T,Swami A. Mining association rules between sets of items in large database[A].Washington,DC,1993.207-216.
  • 10Han J W,Pei J,Yin Y. Mining frequent patterns without candidate generation[A].Dallas:ACM Press,2000.1-12.

引证文献7

二级引证文献32

重庆理工大学学报（自然科学）
2012年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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