Clustering-based privacy preserving anonymity approach for table data sharing

Chunhui Piao (), Liping Liu (), Yajuan Shi (), Xuehong Jiang () and Ning Song ()
Additional contact information
Chunhui Piao: Shijiazhuang Tiedao University
Liping Liu: Shijiazhuang Tiedao University
Yajuan Shi: Shijiazhuang Tiedao University
Xuehong Jiang: Construction Information Center of Hebei Province
Ning Song: Shijiazhuang Tiedao University

International Journal of System Assurance Engineering and Management, 2020, vol. 11, issue 4, No 2, 768-773

Abstract: Abstract Government data sharing can effectively improve the efficiency and quality of government services and enhance the ability of providing government services. However, data sharing may bring the risk of citizen privacy leakage. It is a challenging problem on improving government governance and service levels when sharing government data while guaranteed citizens’ privacy. For the diversity types and complex attributes of government data, this paper proposes a cluster-based anonymous table data sharing privacy protection method (CATDS). Firstly, preprocessing the data table. According to the correlation degree between attributes, the clustering algorithm is used to divide the data attribute column to generate multiple tables. That can reduce the data dimension and improve the algorithm execution speed. Then clustering the table data using k-medoids clustering algorithm to generate a clustering result table that initially satisfies the ķ-anonymity requirement. That can reduce the next generalization degree and improve the data availability. Finally, anonymizing the resulting clusters through generalization technique to ensure the privacy of the shared data. By comparing the CATDS with the Incognito algorithm which is a classical ķ-anonymity algorithm, it is proved that the proposed algorithm can effectively reduce the amount of information loss and improve the availability of shared table data while protecting the private information of shared table data.

Keywords: Data sharing; Table data; Privacy-preserving; k-Medoids clustering algorithm; ķ-Anonymity (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13198-019-00834-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:ijsaem:v:11:y:2020:i:4:d:10.1007_s13198-019-00834-5

Ordering information: This journal article can be ordered from
http://www.springer.com/engineering/journal/13198

DOI: 10.1007/s13198-019-00834-5

Access Statistics for this article

International Journal of System Assurance Engineering and Management is currently edited by P.K. Kapur, A.K. Verma and U. Kumar

More articles in International Journal of System Assurance Engineering and Management from Springer, The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().