KAMP：Preserving k-anonymity for Combinations of Patterns

• Main Authors: Chia-Hao Hsu, 許家豪
• Other Authors: 蔡曉萍
• Format: Others
• Language: zh-TW
• Published: 2013
• Online Access: http://ndltd.ncl.edu.tw/handle/6h6s7y

碩士 === 國立中興大學 === 電機工程學系所 === 101 === As huge data are increasingly generated and accumulated, outsourcing data for storage, management, and knowledge discovery is becoming a paradigm. However, given that a lot of sensitive information and valuable knowledge are hidden in data, the outsourcing of data is vulnerable to privacy crises and leads to demands for generalization or suppression techniques to protect data from re-identification attacks. Differing from previous works that aim at satisfying the k-anonymity on individual patterns or individual items, we propose the k-anonymity of multi-pattern (KAMP) problem to protect data from re-identifying users by using a combination of patterns and also propose the KAMP-p1 algorithm to generalize and suppress data. To study the effectiveness of the proposed algorithm, we conduct experiments on a synthetic and a small real dataset. The experimental results show that KAMP-p1 algorithm can satisfy k-anonymity while preserving many patterns in order to retain useful knowledge for decision making.