%0 Journal Article
%T K-Anonymization Approaches for Supporting Multiple Constraints<br>支持多约束的K-匿名化方法
%A YANG Xiao-Chun
%A LIU Xiang-Yu
%A WANG Bin
%A YU Ge
%A <br>杨晓春
%A 刘向宇
%A 王斌
%A 于戈
%J 软件学报
%D 2006
%I 
%X K-Anonymization is an important approach to protect data privacy in data publishing scenario. Existing approaches mainly consider data processing with single constraint. There exist multiple constraints cases in the real applications, which makes the K-anonymization more complex. Simply applying the approaches with single constraint to the problem of multiple constraints may cause high information loss and low efficiency. Based on the idea of Classfly, a family of multiple constraints supported K-anonymization approaches named Classfly+ are proposed according to the features of mutiple constraints. Three K-anonymization approaches are proposed, which are naive approach, complete IndepCSet, and partial IndepCSet Classfly+ approaches. Experimental results show that Classfly+ can decrease the information loss and improve efficiency of k-anonymization.
%K k-anonymization
%K data privacy
%K generalization
%K multiple constraints
%K information loss<br>K-匿名化
%K 数据隐私
%K 概括
%K 多约束
%K 信息损失
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=F880233C88A98D9D&yid=37904DC365DD7266&vid=BCA2697F357F2001&iid=94C357A881DFC066&sid=966030800FCA5D46&eid=328E221C70C13B92&journal_id=1000-9825&journal_name=软件学报&referenced_num=21&reference_num=10