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...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/13961838219175301284 |
id |
ndltd-TW-097YZU05396067 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-097YZU053960672016-05-04T04:17:09Z http://ndltd.ncl.edu.tw/handle/13961838219175301284 A Two-Stage Density-Based Microaggregation Algorithm for Privacy Protection 保護資料隱私之兩階段密度為基的微聚合演算法 Tsung-Hsien Wen 溫宗賢 碩士 元智大學 資訊管理學系 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. Yu-Chih Liu 劉俞志 2009 學位論文 ; thesis 34 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 元智大學 === 資訊管理學系 === 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.
|
author2 |
Yu-Chih Liu |
author_facet |
Yu-Chih Liu Tsung-Hsien Wen 溫宗賢 |
author |
Tsung-Hsien Wen 溫宗賢 |
spellingShingle |
Tsung-Hsien Wen 溫宗賢 A Two-Stage Density-Based Microaggregation Algorithm for Privacy Protection |
author_sort |
Tsung-Hsien Wen |
title |
A Two-Stage Density-Based Microaggregation Algorithm for Privacy Protection |
title_short |
A Two-Stage Density-Based Microaggregation Algorithm for Privacy Protection |
title_full |
A Two-Stage Density-Based Microaggregation Algorithm for Privacy Protection |
title_fullStr |
A Two-Stage Density-Based Microaggregation Algorithm for Privacy Protection |
title_full_unstemmed |
A Two-Stage Density-Based Microaggregation Algorithm for Privacy Protection |
title_sort |
two-stage density-based microaggregation algorithm for privacy protection |
publishDate |
2009 |
url |
http://ndltd.ncl.edu.tw/handle/13961838219175301284 |
work_keys_str_mv |
AT tsunghsienwen atwostagedensitybasedmicroaggregationalgorithmforprivacyprotection AT wēnzōngxián atwostagedensitybasedmicroaggregationalgorithmforprivacyprotection AT tsunghsienwen bǎohùzīliàoyǐnsīzhīliǎngjiēduànmìdùwèijīdewēijùhéyǎnsuànfǎ AT wēnzōngxián bǎohùzīliàoyǐnsīzhīliǎngjiēduànmìdùwèijīdewēijùhéyǎnsuànfǎ AT tsunghsienwen twostagedensitybasedmicroaggregationalgorithmforprivacyprotection AT wēnzōngxián twostagedensitybasedmicroaggregationalgorithmforprivacyprotection |
_version_ |
1718256574995103744 |