| Presentation | 2017-11-06 An algorithm to reduce information loss by swapping data in k-anonymous partitions Kodai Shigeoka, Hiroko Akiyama, Masaaki Wada, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Given a dataset consisting of multidimensional numerical vectors, we consider $k$-anonymization by first dividing the dataset into groups each containing at least $k$ data, and then replacing all data in each group by the average of the group. We propose algorithm SWAP which reduce information loss while keeping $k$-anonymity by swapping data between groups. To see the effectiveness of SWAP, we prepared many datasets of random vectors and applied SWAP after dividing the datasets by MDAV, and measured the information loss and the running time. We also compared this with the absolute minimum value of the information loss computed by backtrack algorithm. It turned out that SWAP only takes time of order close to that of MDAV while reducing the information loss to a level very close to the absolute minimum. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | $k$-anonymity / information loss / reducing information loss |
| Paper # | EMM2017-60 |
| Date of Issue | 2017-10-30 (EMM) |
| Conference Information | |
| Committee | EMM |
|---|---|
| Conference Date | 2017/11/6(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Kagoshima Univ. (Inamori Academy) |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Multimedia Fusion, Content Processing, Multimedia Retrieval, Digital Watermarking, and Related Topics |
| Chair | Keiichi Iwamura(TUS) |
| Vice Chair | Hirohisa Hioki(Kyoto Univ.) / Minoru Kuribayashi(Okayama Univ.) |
| Secretary | Hirohisa Hioki(Shizuoka Univ.) / Minoru Kuribayashi(Tokyo Metro. Univ.) |
| Assistant | Kan Hyonho(NIT, Tokyo) / Harumi Murata(Chukyo Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Enriched MultiMedia |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | An algorithm to reduce information loss by swapping data in k-anonymous partitions |
| Sub Title (in English) | |
| Keyword(1) | $k$-anonymity |
| Keyword(2) | information loss |
| Keyword(3) | reducing information loss |
| 1st Author's Name | Kodai Shigeoka |
| 1st Author's Affiliation | Osaka University(Osaka Univ.) |
| 2nd Author's Name | Hiroko Akiyama |
| 2nd Author's Affiliation | National Institute of Technology, Nagano College(NIT,Nagano College) |
| 3rd Author's Name | Masaaki Wada |
| 3rd Author's Affiliation | Osaka University(Osaka Univ.) |
| Date | 2017-11-06 |
| Paper # | EMM2017-60 |
| Volume (vol) | vol.117 |
| Number (no) | EMM-282 |
| Page | pp.pp.27-31(EMM), |
| #Pages | 5 |
| Date of Issue | 2017-10-30 (EMM) |