Efficient systematic clustering method for k-anonymization

DOI10.1007/S00236-010-0131-6zbMATH Open1237.68076OpenAlexW1985313039MaRDI QIDQ766161FDOQ766161

Authors: Md. Enamul Kabir, Hua Wang, Elisa Bertino 

Publication date: 23 March 2012

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-010-0131-6

Recommendations

• A practical approximation algorithm for optimal \(k\)-anonymity
• k-Anonymization with Minimal Loss of Information
• Achieving anonymity via clustering
• A weighted K-member clustering algorithm for K-anonymization
• A new approach for achieving \(k\)-anonymity in database based on fuzzy clustering and 0-1 integer programming

zbMATH Keywords

\(k\)-anonymity modelclustering partitions

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Cites Work

• Clustering to minimize the maximum intercluster distance
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION

Cited In (16)

• Generalized bucketization scheme for flexible privacy settings
• A practical approximation algorithm for optimal \(k\)-anonymity
• An decision tree algorithm for \(k\)-anonymity data
• Efficient \(k\)-anonymous microaggregation of multivariate numerical data via principal component analysis
• Greedy clustering-anonymity method for privacy preservation of table data-publishing
• ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
• (k, l)-Clustering for Transactional Data Streams Anonymization
• Anonymizing categorical data with a recoding method based on semantic similarity
• A weighted K-member clustering algorithm for K-anonymization
• A dynamic anonymization privacy-preserving model based on hierarchical sequential three-way decisions
• A neighborhood topological potential entropy data perturbation method for clustering analysis
• A new approach for achieving \(k\)-anonymity in database based on fuzzy clustering and 0-1 integer programming
• An efficient quasi-identifier index based approach for privacy preservation over incremental data sets on cloud
• Achieving anonymity via clustering
• Privacy Preserving Unsupervised Clustering over Vertically Partitioned Data
• Trajectory clustering and \(k\)-NN for robust privacy preserving spatiotemporal databases

Uses Software

• UCI-ml

This page was built for publication: Efficient systematic clustering method for \(k\)-anonymization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766161)