Volume 9 Number 10 (Oct. 2014)
Home > Archive > 2014 > Volume 9 Number 10 (Oct. 2014) >
JCP 2014 Vol.9(10): 2493-2499 ISSN: 1796-203X
doi: 10.4304/jcp.9.10.2493-2499

An Approach to Achieving K-partition for Preserving Privacy by Using Multi-constraint Anonymous Parameter Based on Rough Sets

Tao Liu, Taorong Qiu, Wenying Duan, Xiaoming Bai
Department of Computer, Nanchang University, Nanchang,330031,China

Abstract—We propose an approach to achieving different K-partition for preserving privacy by using the multiconstraint 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 multiconstraint 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.

Index Terms—Privacy Preservation; Anonymous Parameters; Rough Set; Attribute Significance

[PDF]

Cite: Tao Liu, Taorong Qiu, Wenying Duan, Xiaoming Bai, "An Approach to Achieving K-partition for Preserving Privacy by Using Multi-constraint Anonymous Parameter Based on Rough Sets," Journal of Computers vol. 9, no. 10, pp. 2493-2499, 2014.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>