2011•Computer Engineering and Applications JournalRequires access

Research on k-anonymity algorithm for privacy preservation

Qinjuan Ma

Open publisher page 0 citations

Abstract

Privacy preservation has been an essential issue for individuals or organizations.k-anonymity is one of the primary techniques realizing privacy protection in data dissemination environment.Current k-anonymity solutions based on generalization and suppression techniques suffer from high information loss and low usability mainly due to reliance on pre-defined generalization hierarchies or order imposed on each attribute domain.It develops a new k-anonymity algorithm based on clustering technology.Experimental results show that the method can improve the usability of the released data while preserving privacy.

About this research paper

What this paper is about

Privacy preservation has been an essential issue for individuals or organizations.k-anonymity is one of the primary techniques realizing privacy protection in data dissemination environment.Current k-anonymity solutions based on generalization and suppression techniques suffer from high information loss and low usability mainly due to reliance on pre-defined generalization hierarchies or order imposed on each attribute domain.It develops a new k-anonymity algorithm based on clustering technology.Experimental results show that the method can improve the usability of the released data while preserving privacy.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Privacy preservation has been an essential issue for individuals or organizations.k-anonymity is one of the primary techniques realizing privacy protection in data dissemination environment.Current k-anonymity solutions based on generalization and suppression techniques suffer from high information loss and low usability mainly due to reliance on pre-defined generalization hierarchies or order imposed on each attribute domain.It develops a new k-anonymity algorithm based on clustering technology.Experimental results show that the method can improve the usability of the released data while preserving privacy.

Key concepts: k-anonymity, Anonymity, Computer science, Usability, Generalization, Cluster analysis, Information privacy, Domain (mathematical analysis)

Related papers

Back to paper searchBrowse research topicsOriginal source
Research on k-anonymity algorithm for privacy preservation — Research Paper | ScholarLens