Algorithm for k-anonymity based on projection area density partition
In data publishing privacy preserving,while classifying temporary anonymous groups,the existing algorithms didn’t consider the distance between adjacent data points,and could easily produce a lot of unnecessary information loss,thus affecting the availability of released anonymous data sets.To solve...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2015-08-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015204/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539699350437888 |
|---|---|
| author | Chao WANG Jing YANG Jian-pei ZHANG Gang LV |
| author_facet | Chao WANG Jing YANG Jian-pei ZHANG Gang LV |
| author_sort | Chao WANG |
| collection | DOAJ |
| description | In data publishing privacy preserving,while classifying temporary anonymous groups,the existing algorithms didn’t consider the distance between adjacent data points,and could easily produce a lot of unnecessary information loss,thus affecting the availability of released anonymous data sets.To solve the above problem,the concept of rectangular projection area,the projection area density and partition coefficient characterization were presented,aim to increase the recording points’s projection area density to divide temporary anonymous group reasonably,and to make the information loss of divided anonymous groups as small as possible.And presents the algorithm for k-anonymity based on projection area density partition,by optimizing the rounded partition function and properties dimension selection strategy,to reduce unnecessary information loss and to further improve the availability of released data sets,without reducing the number of anonymous groups.The rationality and validity of the algorithm are verified by theoretical analysis and multiple experiments. |
| format | Article |
| id | doaj-art-f3faed3a18574a2581166aa26d0aba01 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2015-08-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-f3faed3a18574a2581166aa26d0aba012025-01-14T06:53:24ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2015-08-013612513459694949Algorithm for k-anonymity based on projection area density partitionChao WANGJing YANGJian-pei ZHANGGang LVIn data publishing privacy preserving,while classifying temporary anonymous groups,the existing algorithms didn’t consider the distance between adjacent data points,and could easily produce a lot of unnecessary information loss,thus affecting the availability of released anonymous data sets.To solve the above problem,the concept of rectangular projection area,the projection area density and partition coefficient characterization were presented,aim to increase the recording points’s projection area density to divide temporary anonymous group reasonably,and to make the information loss of divided anonymous groups as small as possible.And presents the algorithm for k-anonymity based on projection area density partition,by optimizing the rounded partition function and properties dimension selection strategy,to reduce unnecessary information loss and to further improve the availability of released data sets,without reducing the number of anonymous groups.The rationality and validity of the algorithm are verified by theoretical analysis and multiple experiments.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015204/privacy preservingtemporary anonymous grouprectangular projection areaprojection area density |
| spellingShingle | Chao WANG Jing YANG Jian-pei ZHANG Gang LV Algorithm for k-anonymity based on projection area density partition Tongxin xuebao privacy preserving temporary anonymous group rectangular projection area projection area density |
| title | Algorithm for k-anonymity based on projection area density partition |
| title_full | Algorithm for k-anonymity based on projection area density partition |
| title_fullStr | Algorithm for k-anonymity based on projection area density partition |
| title_full_unstemmed | Algorithm for k-anonymity based on projection area density partition |
| title_short | Algorithm for k-anonymity based on projection area density partition |
| title_sort | algorithm for k anonymity based on projection area density partition |
| topic | privacy preserving temporary anonymous group rectangular projection area projection area density |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015204/ |
| work_keys_str_mv | AT chaowang algorithmforkanonymitybasedonprojectionareadensitypartition AT jingyang algorithmforkanonymitybasedonprojectionareadensitypartition AT jianpeizhang algorithmforkanonymitybasedonprojectionareadensitypartition AT ganglv algorithmforkanonymitybasedonprojectionareadensitypartition |