Academic Journals Database
Disseminating quality controlled scientific knowledge

K-ANONYMITY: The History of an IDEA

ADD TO MY LIST
 
Author(s): Swagatika Devi

Journal: International Journal of Soft Computing & Engineering
ISSN 2231-2307

Volume: 2;
Issue: 1;
Start page: 347;
Date: 2012;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: K-Anonymity | Generalization | Suppression | Pattern discovery.

ABSTRACT
Publishing data about individuals without revealing sensitive information about them is an important problem. In recent years, a new definition of privacy called k-anonymity has gained popularity. In a k-anonymized dataset, each record is indistinguishable from at least k−1 other records with respect to certain “identifying” attributes. In this paper, we discuss the concept of k-anonymity, from its original proposal illustrating its enforcement via generalization and suppression. We also discuss different ways in which generalization and suppressions can be applied to satisfy k- anonymity. By shifting the concept of k-anonymity from data to patterns, we formally characterize the notion of a threat to anonymity in the context of pattern discovery. We provide an overview of the different techniques and how they relate to one another. The individual topics will be covered in sufficient detail to provide the reader with a good reference point. The idea is to provide an overview of the field for a new reader from the perspective of the data mining community.
Why do you need a reservation system?      Affiliate Program