A Two-Stage Density-Based Microaggregation Algorithm for Privacy Protection

碩士 === 元智大學 === 資訊管理學系 === 97 === Microaggregation, which satisfies k-anonymity is a statistical disclosure control technique that has been widely used to avoid disclosure of respondent privacy. In order to protect individual privacy, a record must be identical to at least k-1 other record after usi...

Full description

Bibliographic Details
Main Authors: Tsung-Hsien Wen, 溫宗賢
Other Authors: Yu-Chih Liu
Format: Others
Language:zh-TW
Published: 2009
Online Access:http://ndltd.ncl.edu.tw/handle/13961838219175301284
Description
Summary:碩士 === 元智大學 === 資訊管理學系 === 97 === Microaggregation, which satisfies k-anonymity is a statistical disclosure control technique that has been widely used to avoid disclosure of respondent privacy. In order to protect individual privacy, a record must be identical to at least k-1 other record after using the technology of microaggregation. However, the protection provided by microaggregation also entails information loss. Therefore, recent research has focused on how to minimize the information loss. To lower information loss, this study proposes a two-phase density-based microaggregation method, called HDF. The experiments show that HDF algorithm gets the lower information loss than other algorithms in literatures in most of the test conditions.