Research on k-anonymity algorithm for privacy preservation
Qinjuan Ma
Abstract
Qinjuan Ma
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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)