Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Open access · Published 17 March 2022

S-CPM: Semantic-Similarity Cluster based Privacy Preservation Model with Cell Generalization Principle

Satish B Basapur1, B S Shylaja1 & Venkatesh2

Journal of Computer Science, Volume 18, Issue 3, pp. 138–150 · doi.org/10.3844/jcssp.2022.138.150

6,314 accesses3,243 downloads0 citations (Crossref)Metrics
Cite Check for updates

Abstract

Timely data analysis on a wide variety and a large volume of data unveil valuable information or new insights. The analysis results could be used to innovate new avenues in health care service, business and e-service, etc. However, releasing, storing and reusing sensitive data to third parties results in breaching the data privacy of the individual. To combat privacy breach invasion, privacy-preserving techniques such as suppression, generalization and encryption-based privacy models have been proposed in the literature. The widely used privacy preservation model k-anonymity model prevents record-linkage invasions but fails to satisfy monotonicity property. It has more data distortion and fails to defend semantic-similarity, closeness, nearest-neighborhood data privacy breaches. Moreover, existing approaches are not scalable for the large-scale data set. The paper proposes a semantic similarity two-phase cluster based privacy preservation model. The proposed model considers both numerical and categorical attribute values for data anonymization. Two-phase clustering contains two phases. In the first phase, the t-centroid clustering algorithm is designed and used to partition a set of transaction records of data set D into a set of t-centroids based on the Euclidean distance between transaction records. In the second phase, the neighborhood-aware hierarchical clustering algorithm is designed. It is used to split a set of transaction records within clusters based on neighborhood aware attribute values. Two-phase clustering operations are carried out in parallel and scalable for Big Data sets. The proposed privacy model relies on cell generalization to combat records linkage and         semantic-similarity, closeness, nearest-neighborhood privacy breach invasion. All experiments are carried out on two different datasets:         Income-Census (KDD) and Bank Credit Card dataset. The experimental results demonstrate that the proposed privacy model can combat privacy breach invasion with cell generalization principles. The proposed privacy model is scalable and time efficient for large-scale data sets.

Licence and reuse

Open access. This article is licensed under a Creative Commons Attribution 4.0 International Licence (CC BY 4.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Basapur, S. B., Shylaja, B. S. & Venkatesh, (2022). S-CPM: Semantic-Similarity Cluster based Privacy Preservation Model with Cell Generalization Principle. Journal of Computer Science, 18(3), 138–150. https://doi.org/10.3844/jcssp.2022.138.150

Licence
CC BY 4.0
Issue
Volume 18, Issue 3
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
S-CPM: Semantic-Similarity Cluster based Privacy Preservation Model with Cell Generalization PrincipleJournal of Computer Science · Volume 18, Issue 3 · pp. 138–150 · CC BY 4.0Download