Consistency preserving database watermarking algorithm for decision trees  

作　　者：Qianwen Li Xiang Wang Qingqi Pei Xiaohua Chen Kwok-Yan Lam 

机构地区：[1]School of Telecommunications Engineering,Xidian University,Xi'an,710071,China [2]School of Cyber Engineering,Xidian University,Xi'an,710071,China [3]School of Telecommunications Engineering,Xidian University,Xi'an,China [4]2012 Laboratories,Huawei Technologes,Huawei Technology Co,Ltd,Hangzhou,310000,China [5]The School of Computer Science and Engineering,Nanyang Technological University,639798,Singapore

出　　处：《Digital Communications and Networks》2024年第6期1851-1863,共13页数字通信与网络(英文版)

基　　金：supported by the National Key Research and Development Program of China under Grant 2021YFB2700600;the National Natural Science Foundation of China under Grant 62132013 and 61902292;the Key Research and Development Programs of Shaanxi under Grants 2021ZDLGY06-03;the Truth-Seeking Research Scholarship Fund of Xidian University。

摘　　要：Database watermarking technologies provide an effective solution to data security problems by embedding the watermark in the database to prove copyright or trace the source of data leakage.However,when the watermarked database is used for data mining model building,such as decision trees,it may cause a different mining result in comparison with the result from the original database caused by the distortion of watermark embedding.Traditional watermarking algorithms mainly consider the statistical distortion of data,such as the mean square error,but very few consider the effect of the watermark on database mining.Therefore,in this paper,a consistency preserving database watermarking algorithm is proposed for decision trees.First,label classification statistics and label state transfer methods are proposed to adjust the watermarked data so that the model structure of the watermarked decision tree is the same as that of the original decision tree.Then,the splitting values of the decision tree are adjusted according to the defined constraint equations.Finally,the adjusted database can obtain a decision tree consistent with the original decision tree.The experimental results demonstrated that the proposed algorithm does not corrupt the watermarks,and makes the watermarked decision tree consistent with the original decision tree with a small distortion.

关 键 词：Consistency preserving Decision tree Database watermarking Data mining 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]