Novel Algorithms for Privacy Preserving Utility Mining
碩士 === 靜宜大學 === 資訊管理學系研究所 === 95 === Privacy Preserving Data Mining (PPDM) is a popular research direction in data mining, but so far privacy preserving utility mining was not discussed. How to strike a balance between privacy protection and knowledge discovery in the sharing process is an important...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/26222401050471659004 |
id |
ndltd-TW-095PU005396034 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-095PU0053960342015-10-13T16:56:24Z http://ndltd.ncl.edu.tw/handle/26222401050471659004 Novel Algorithms for Privacy Preserving Utility Mining 新利潤探勘的隱私保護演算法 Po-Chiang Hsu 許柏強 碩士 靜宜大學 資訊管理學系研究所 95 Privacy Preserving Data Mining (PPDM) is a popular research direction in data mining, but so far privacy preserving utility mining was not discussed. How to strike a balance between privacy protection and knowledge discovery in the sharing process is an important issue. This study focuses on the privacy preserving utility mining and present two effective algorithms, HHUIF and MSICF, to achieve the goal of hiding sensitive itemsets so that the adversaries can not mine them from the modified database. In addition, we minimize the impact on the sanitized database in the process of hiding sensitive itemsets. In our experimental results, HHUIF has the lower miss costs than MSICF does in two synthetic datasets. Besides, MSICF has the lower difference between the original and sanitized databases than HHUIF has, except in the case where MinUtility = 4000. Jieh-Shan Yeh 葉介山 2007/07/ 學位論文 ; thesis 38 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 靜宜大學 === 資訊管理學系研究所 === 95 === Privacy Preserving Data Mining (PPDM) is a popular research direction in data mining, but so far privacy preserving utility mining was not discussed. How to strike a balance between privacy protection and knowledge discovery in the sharing process is an important issue. This study focuses on the privacy preserving utility mining and present two effective algorithms, HHUIF and MSICF, to achieve the goal of hiding sensitive itemsets so that the adversaries can not mine them from the modified database. In addition, we minimize the impact on the sanitized database in the process of hiding sensitive itemsets. In our experimental results, HHUIF has the lower miss costs than MSICF does in two synthetic datasets. Besides, MSICF has the lower difference between the original and sanitized databases than HHUIF has, except in the case where MinUtility = 4000.
|
author2 |
Jieh-Shan Yeh |
author_facet |
Jieh-Shan Yeh Po-Chiang Hsu 許柏強 |
author |
Po-Chiang Hsu 許柏強 |
spellingShingle |
Po-Chiang Hsu 許柏強 Novel Algorithms for Privacy Preserving Utility Mining |
author_sort |
Po-Chiang Hsu |
title |
Novel Algorithms for Privacy Preserving Utility Mining |
title_short |
Novel Algorithms for Privacy Preserving Utility Mining |
title_full |
Novel Algorithms for Privacy Preserving Utility Mining |
title_fullStr |
Novel Algorithms for Privacy Preserving Utility Mining |
title_full_unstemmed |
Novel Algorithms for Privacy Preserving Utility Mining |
title_sort |
novel algorithms for privacy preserving utility mining |
publishDate |
2007 |
url |
http://ndltd.ncl.edu.tw/handle/26222401050471659004 |
work_keys_str_mv |
AT pochianghsu novelalgorithmsforprivacypreservingutilitymining AT xǔbǎiqiáng novelalgorithmsforprivacypreservingutilitymining AT pochianghsu xīnlìrùntànkāndeyǐnsībǎohùyǎnsuànfǎ AT xǔbǎiqiáng xīnlìrùntànkāndeyǐnsībǎohùyǎnsuànfǎ |
_version_ |
1717776772718657536 |