Pages that link to "Item:Q766161"
From MaRDI portal
The following pages link to Efficient systematic clustering method for \(k\)-anonymization (Q766161):
Displaying 12 items.
- An efficient quasi-identifier index based approach for privacy preservation over incremental data sets on cloud (Q355501) (← links)
- Trajectory clustering and \(k\)-NN for robust privacy preserving spatiotemporal databases (Q1712068) (← links)
- A practical approximation algorithm for optimal \(k\)-anonymity (Q1944983) (← links)
- Generalized bucketization scheme for flexible privacy settings (Q1991860) (← links)
- Efficient \(k\)-anonymous microaggregation of multivariate numerical data via principal component analysis (Q2224935) (← links)
- A weighted K-member clustering algorithm for K-anonymization (Q2244050) (← links)
- An decision tree algorithm for \(k\)-anonymity data (Q2887530) (← links)
- Achieving anonymity via clustering (Q2930330) (← links)
- Anonymizing Categorical Data with a Recoding Method Based on Semantic Similarity (Q3164159) (← links)
- Privacy Preserving Unsupervised Clustering over Vertically Partitioned Data (Q3603087) (← links)
- A neighborhood topological potential entropy data perturbation method for clustering analysis (Q5260194) (← links)
- (k, l)-Clustering for Transactional Data Streams Anonymization (Q6163694) (← links)
