A self-adaptation data publishing algorithm framework

We present a new self-adaptation data publishing framework based on the concept of personalized anonymity for a certain application field (e.g. digital library). Our technique applies a self-adaptive mechanism to meet the needs of the different data applications with the minimum generalization for satisfying everybody's requirements, and thus, retains the largest amount of information from the metadata. We propose an algorithm framework for computing a generalized table with small information loss, which guarantees the appropriate breach probability for each tuple under the guidance of domain knowledge. The strategy of the sensitive attribute generalization and quasi-attribute generalization is well applied in the algorithm.

[1]  Jian Pei,et al.  Utility-based anonymization using local recoding , 2006, KDD '06.

[2]  Yufei Tao,et al.  Personalized privacy preservation , 2006, Privacy-Preserving Data Mining.

[3]  Yufei Tao,et al.  ANGEL: Enhancing the Utility of Generalization for Privacy Preserving Publication , 2009, IEEE Transactions on Knowledge and Data Engineering.

[4]  Dan Suciu,et al.  The Boundary Between Privacy and Utility in Data Publishing , 2007, VLDB.

[5]  Philip S. Yu,et al.  Privacy-preserving data publishing: A survey of recent developments , 2010, CSUR.

[6]  Jiang Wu,et al.  k-Anonymity via Clustering Domain Knowledge for Privacy Preservation , 2008, 2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery.

[7]  Ninghui Li,et al.  Towards optimal k-anonymization , 2008, Data Knowl. Eng..

[8]  Ashwin Machanavajjhala,et al.  l-Diversity: Privacy Beyond k-Anonymity , 2006, ICDE.