期刊文献+

基于SVR预测的可逆数据库水印技术

REVERSIBLE DATABASE WATERMARKING TECHNOLOGY BASED ON SVR PREDICTION
下载PDF
导出
摘要 频繁模式树(FP-tree)的关联规则是利用数据挖掘算法来确定受保护的属性和其他数据库之间存在的关系,支持向量回归方法(SVR)用来预测每个受保护的属性值。提出通过嵌入原始数据库的重要特征来检测数据库是否被篡改过的实现方法。通过对比差值扩展(DE)的原始值和预测值之间的差异,数据库管理员可以在受保护的数据库中嵌入数字水印,如果受保护的数据库是扭曲的,在SVR功能下仍然是可以预测保护值的。FPtree挖掘方法用于降低SVR的训练时间,如果该数据库已被篡改,我们可以从受保护的数据库中提取水印,来验证并定位篡改元组,恢复原来的属性值,如果该数据库没有遭到攻击,我们也可以利用水印保护数据库。因此,提出的数据库的电子水印方式可以有效地验证数据库的完整性和保护数据库的安全性。 The association rule of FP-tree ( relationship between protected property and other frequent pattern tree ) uses data mining algorithm to determine the databases. SVR (Support vector regression) method is used to predict each protected attribute value. We propose a method to detect whether the database has been tampered with by embedding the important feature of the original database. By comparing the difference between original and predicted values of the DE (difference expansion ), the database administrator can embed digital watermark in a protected database. If the protected database is distorted, it is still possible to predict the protection value under the SVR function. In this paper, FP-tree mining method is used to reduce the training time of SVR. If the database has been tampered with, we can extract the watermark from the protected database to verify and locate the tampered tuples and restore the original attribute value. If the database is not under attack, we can also use the protection of database watermarking. Therefore, the database can effectively verify the integrity of the database and protect the security of the database.
作者 龙晓泉
出处 《计算机应用与软件》 2017年第12期64-67,137,共5页 Computer Applications and Software
关键词 数据库水印 差值扩展 支持向量回归 FP—tree挖掘 Database watermarking Difference expansion Support vector regression FP-tree mining
  • 相关文献

参考文献6

二级参考文献47

  • 1牛夏牧,赵亮,黄文军,张慧.利用数字水印技术实现数据库的版权保护[J].电子学报,2003,31(z1):2050-2053. 被引量:69
  • 2梁吉业,王俊红.基于概念格的规则产生集挖掘算法[J].计算机研究与发展,2004,41(8):1339-1344. 被引量:57
  • 3钟伟民,皮道映,孙优贤.Support vector machine based nonlinear model multi-step-ahead optimizing predictive control[J].Journal of Central South University of Technology,2005,12(5):591-595. 被引量:9
  • 4AGRAWAL R, KIERNAN J. Watermarking relational databases [ C]// Proc of the 28th VLDB Conference. 2002 : 155-168.
  • 5SION R, ATALLAH M, PRABHAKAR S. Rights protection for rela- tional data [ J]. IEEE Trans on Knowledge and Data Enginee- ring ,2004,16 ( 12 ) : 1509 - 1525.
  • 6FENG Guo-rui ,JIANG Leng-ge, HE Chen ,et al. Chaotic spread spec- trum watermark of optimal space-filling curves [ J ]. Chaos Solitons and Fractals ,2006,27 (3) :580-587.
  • 7向胡 李军义 潘季芳.一种基于虚拟主键的数据库水印算法.计算机研究与发展,2009,46(1):66-70.
  • 8CAO Zai-hui,SUN Jima-hua,HU Zhong-yan. Image algorithm for wa- termarking relational databases based on chaos [ C ]//Advances in Wireless Networks and Information Systems. Heidelberg: Springer, 2010 :411-418.
  • 9FARFOURA M E, HORNG S. A novel blind reversible method for watermarking relational databases [ C ]//Proc of Intematioanl Sympo- sium on Parallel and Distributed Processing with Applications. 2010: 563- 569.
  • 10AGRAWAL R, IMIEUNSKI T, SWAMI A, et al. Mining associationrules between sets of items in large databases [C] // Proc of ACMSIGMOD International Conference on Management of Data. NewYork: ACM Press, 1993:207-216.

共引文献55

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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