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