Achieving Optimal K-Anonymity Parameters for Big Data
نویسندگان
چکیده
منابع مشابه
Achieving k-Anonymity for Associative Classification in Incremental-data Scenarios
When a data mining model is to be developed, one of the most important issues is preserving the privacy of the input data. In this paper, we address the problem of data transformation to preserve the privacy with regard to a data mining technique, associative classification, in an incremental-data scenario. We propose an incremental polynomialtime algorithm to transform the data to meet a priva...
متن کاملAchieving k-anonymity in DataMarts used for gene expressions exploitation
Gene expression profiling is a sophisticated method to discover differences in activation patterns of genes between different patient collectives. By reasonably defining patient groups from a medical point of view, subsequent gene expression analysis may reveal disease-related gene expression patterns that are applicable for tumor markers and pharmacological target identification. When releasin...
متن کاملAchieving High Performance for Big Data Analytics
Irregular algorithms such as graph algorithms, sorting, and sparse matrix multiplication, present numerous programming challenges that include scalability, load balancing, and efficient memory utilization. In this age of Big Data we face additional challenges since the data is often streaming at a high velocity and we wish to make near real-time decisions for real-world events. For instance, we...
متن کاملParallelizing K-Anonymity Algorithm for Privacy Preserving Knowledge Discovery from Big Data
Disclosure control has become inevitable as privacy is given paramount importance while publishing data for mining. The data mining community enjoyed revival after Samarti and Sweeney proposed k-anonymization for privacy preserving data mining. The k-anonymity has gained high popularity in research circles. Though it has some drawbacks and other PPDM algorithms such as l-diversity, t-closeness ...
متن کاملAchieving k-Anonymity by Clustering in Attribute Hierarchical Structures
Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view of k-anonymity is clustering with a constraint of the minimum number of objects in every cluster. Most existing approaches to achieving k-anonymity by clustering are for numerical (or ordinal) attributes. In this paper, we stud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information, Communication Technology and Applications
سال: 2018
ISSN: 2205-0930
DOI: 10.17972/ijicta20184136