Pages that link to "Item:Q3527233"
From MaRDI portal
The following pages link to k-Anonymization with Minimal Loss of Information (Q3527233):
Displaying 14 items.
- Anonymizing binary and small tables is hard to approximate (Q543515) (← links)
- \(k\)-anonymous data collection (Q730905) (← links)
- Efficient systematic clustering method for \(k\)-anonymization (Q766161) (← links)
- A practical approximation algorithm for optimal \(k\)-anonymity (Q1944983) (← links)
- Generalized bucketization scheme for flexible privacy settings (Q1991860) (← links)
- Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs (Q2392556) (← 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)
- Parameterized Complexity of k-Anonymity: Hardness and Tractability (Q3000512) (← links)
- Anonymizing Categorical Data with a Recoding Method Based on Semantic Similarity (Q3164159) (← links)
- Database Theory - ICDT 2005 (Q5316598) (← links)
- Discovery Science (Q5464537) (← links)
