K-Anonymization Approaches for Supporting Multiple Constraints
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    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.

    Reference
    Related
    Cited by
Get Citation

杨晓春,刘向宇,王斌,于戈.支持多约束的K-匿名化方法.软件学报,2006,17(5):1222-1231

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:June 15,2005
  • Revised:December 16,2005
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063