Achieving Optimal K-Anonymity Parameters for Big Data
Explore this paper's citation graph
Summary
A greedy-based heuristic approach that provides an optimal value for k, derived from the fine-grained access and business role anonymization for big data, which forms the framework for the Sensitivity-Based Anonymization method.
- Type
- article
- Published
- 2018-05-15
- Cited by
- 0
- References
- 0
- Access
- Open access
- OpenAlex
- https://openalex.org/W2888521006
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:69894680
Keywords
Data anonymization, Computer science, Anonymity, k-anonymity, Heuristic
References
No references recorded for this paper.
Cited by
No citing papers recorded for this paper.
Related papers
- Privacy preserving big data publishing: a scalable k-anonymization approach using MapReduce
- Technique Advances for Anonymization-based Controlling Privacy Disclosure in Data Publishing
- A Scalable (α, k)-Anonymization Approach using MapReduce for Privacy Preserving Big Data Publishing
- Flexible Anonymization of Transactions with Sensitive Items
- G-Model: A Novel Approach to Privacy-Preserving 1:M Microdata Publication