Name
Title | ||
|---|---|---|
An Approach To Achieving K-Partition For Preserving Privacy By Using Multi-Constraint Anonymous Parameter Based On Rough Sets |
Abstract | ||
|---|---|---|
We propose an approach to achieving different K-partition for preserving privacy by using the multi-constraint anonymous parameter design method based on the attribute significance of rough set, in order to reduce the imbalance phenomenon between the privacy protection and data availability caused by adopting the same anonymous intensity. In this approach, taking into account the significance of quasi-identifier attributes, we carry out the dimension division automatically and obtain multi-constraint anonymous parameters. After that an anonymous algorithm is executed on the separate partition. Experimental results show that the proposed method can obtain a better balance between the privacy protection degree and data availability. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.4304/jcp.9.10.2493-2499 | JOURNAL OF COMPUTERS |
Keywords | Field | DocType |
Privacy Preservation, Anonymous Parameters, Rough Set, Attribute Significance | Data mining,Parameter design,Data availability,Computer science,Rough set,Partition (number theory) | Journal |
Volume | Issue | ISSN |
9 | 10 | 1796-203X |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tao Liu | 1 | 0 | 0.34 |
| Taorong Qiu | 2 | 47 | 11.55 |
| Wenying Duan | 3 | 0 | 0.34 |
| Xiaoming Bai | 4 | 18 | 6.07 |