About the journal

• Home page
• Contact information
• Aims and scope
• Indexing information
• Editorial policies
• ComSIS consortium
• Journal boards
• Managing board

For authors

• Information for contributors
• Paper submission
• Article submission through OJS
• Copyright transfer form
• Download section

For readers

• Forthcoming articles
• Current issue
• Archive

For reviewers

• View and review submissions

News

• Journal's Facebook page
• Calls for special issues
• New issue notification

Anonymization on Refining Partition: Same Privacy, More Utility

Hong Zhu¹, Shengli Tian², Genyuan Du² and Meiyi Xie¹

1. School of Computer Science and Technology, Huazhong University of Science and Technology
   Wuhan, Hubei, 430074, P.R.China
   zhuhong@hust.edu.cn
2. School of Information Engineering, Xuchang University
   Xuchang, Henan, 461000, P.R.China
   zelintian@gmail.com

Abstract

In privacy preserving data publishing, to reduce the correlation loss between sensitive attribute (SA) and non-sensitive attributes(NSAs) caused by anonymization methods (such as generalization, anatomy, slicing and randomization, etc.), the records with same NSAs values should be divided into same blocks to meet the anonymizing demands of ℓ-diversity. However, there are often many blocks (of the initial partition), in which there are more than ℓ records with different SA values, and the frequencies of different SA values are uneven. Therefore, anonymization on the initial partition causes more correlation loss. To reduce the correlation loss as far as possible, in this paper, an optimizing model is first proposed. Then according to the optimizing model, the refining partition of the initial partition is generated, and anonymization is applied on the refining partition. Although anonymization on refining partition can be used on top of any existing partitioning method to reduce the correlation loss, we demonstrate that a new partitioning method tailored for refining partition could further improve data utility. An experimental evaluation shows that our approach could efficiently reduce correlation loss.

Key words

anonymization, refining partition, correlation loss

Digital Object Identifier (DOI)

https://doi.org/10.2298/CSIS141212052Z

Publication information

Volume 12, Issue 4 (November 2015)
Special Issue on Recent Advances in Information Processing, Parallel and Distributed Computing
Year of Publication: 2015
ISSN: 2406-1018 (Online)
Publisher: ComSIS Consortium

Full text

Available in PDF
Portable Document Format

How to cite

Zhu, H., Tian, S., Du, G., Xie, M.: Anonymization on Refining Partition: Same Privacy, More Utility. Computer Science and Information Systems, Vol. 12, No. 4, 1193–1216. (2015), https://doi.org/10.2298/CSIS141212052Z