資料載入中.....
|
請使用永久網址來引用或連結此文件:
https://nccur.lib.nccu.edu.tw/handle/140.119/138286
|
| 題名: | An Enhanced Mondrian Anonymization Model based on Self-Organizing Map |
| 作者: | 左瑞麟
Tso, Raylin
Wang, Peter Shaojui
Huang, Pin-Yen
Tsai, Yu-An |
| 貢獻者: | 資科系 |
| 日期: | 2020-08 |
| 上傳時間: | 2021-12-09 16:09:02 (UTC+8) |
| 摘要: | In the era of big data, privacy preservation has been the focus for data mining. Mondrian anonymization is a state-of-the-art data anonymization algorithm for relational dataset, widely used in many classical syntactic privacy-preserving data mining methods, like k-anonymity, l-diversity, t-closeness, etc. Mondrian anonymization is named for its multidimensional data partitioning in geometric space to find the best partitions for data anonymization. However, one problem with using Mondrian anonymization is taking too much time and memory for the high-dimensional data. Another problem is that the Mondrian-based privacy preservation may lead to the unstable performance of data mining models. For example, in Mondrian-based k-anonymity, the accuracy results of data mining may drop dramatically with the growth of k value. For solving these problems, in this paper we propose an enhanced Mondrian anonymization model based on Self-Organizing Map (SOM-Mondrian). With the help of SOM, multidimensional data are converted from a high dimensional space into two-dimensional space; at the same time, preserving their topological properties of the input space. The resulting two-dimensional data are then used by Mondrian algorithm to find the best partitions for data anonymization. To our best knowledge, we are the first to propose SOM-based method for Mondrian anonymization. Experimental results show that, after applying our proposed method, the processing time of Mondrian anonymization decreases significantly from 12.11 seconds to 0.16 seconds; besides, the accuracy of data mining applications increases, about 2% higher than the results under the standard Mondrian anonymization, and also shows steadier and more robust (the degree of variation is reduced by 75%) to the varying k value. |
| 關聯: | 2020 15th Asia Joint Conference on Information Security (AsiaJCIS) |
| 資料類型: | conference |
| DOI 連結: | https://doi.org/10.1109/AsiaJCIS50894.2020.00026 |
| DOI: | 10.1109/AsiaJCIS50894.2020.00026 |
| 顯示於類別: | [資訊科學系] 會議論文
|
文件中的檔案:
| 檔案 |
描述 |
大小 | 格式 | 瀏覽次數 |
|---|
| 20.pdf | | 412Kb | Adobe PDF2 | 226 | 檢視/開啟 |
|
在政大典藏中所有的資料項目都受到原著作權保護.
|
