Abstract
While k-anonymity algorithm has been used widely to prevent privacy disclosure in datasets published with single sensitive attribute. We improve k-anonymity algorithm to protect privacy in multiple sensitive attributes. Based on greedy strategy, we sort sensitive attributes and tuples first. We distribute tuples to equivalence classes evenly according to sensitive values in high degree. We use statistic information to cut off association among sensitive attributes to prevent positive and negative privacy disclosure. Information entropy is introduced as metric of diversity. Experiments on real dataset showed that our algorithm is effective and efficient.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
