Pages that link to "Item:Q1944983"
From MaRDI portal
The following pages link to A practical approximation algorithm for optimal \(k\)-anonymity (Q1944983):
Displaying 14 items.
- Constrained obfuscation of relational databases (Q508612) (← links)
- Efficient systematic clustering method for \(k\)-anonymization (Q766161) (← links)
- Hardness of \(k\)-anonymous microaggregation (Q1983125) (← links)
- A weighted K-member clustering algorithm for K-anonymization (Q2244050) (← links)
- Graphic sequences, distances and \(k\)-degree anonymity (Q2345626) (← links)
- The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706) (← links)
- A modification of the Lloyd algorithm for \(k\)-anonymous quantization (Q2510470) (← links)
- An decision tree algorithm for \(k\)-anonymity data (Q2887530) (← links)
- Achieving anonymity via clustering (Q2930330) (← links)
- Minimizing Information Loss and Preserving Privacy (Q3116060) (← links)
- \(a\)-diversity \(k\)-anonymity large data adaptive delay scheduling algorithm based on wavelet analysis (Q3385890) (← links)
- k-Anonymization with Minimal Loss of Information (Q3527233) (← links)
- Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings (Q4339006) (← links)
- Database Theory - ICDT 2005 (Q5316598) (← links)
