An Improved k‐Anonymization Clustering Mechanisms Using Apache Spark for Privacy‐Preserving Big Data Publishing for Real‐Time Dataset

ABSTRACT This work presents comprehensive research of a novel privacy‐preserving approach for big data publishing, emphasizing the integration of advanced clustering and anonymization techniques within a distributed computing framework. The hypothesis underpinning this research is that combining improved clustering algorithms with a refined k‐anonymity model can significantly reduce information loss while enhancing data utility, even at large scales. To test this, the methodology employs a hybrid approach that leverages the 2‐means clustering algorithm, enhanced with a mean‐center initialization method, alongside a greedy algorithm for effective data generalization. The core techniques involve constructing a new information loss function based on information quantity theory, which assigns weights to quasi‐identifiers according to their influence on sensitive attributes, thus enabling more precise and less destructive generalization. The implementation utilizes Apache Spark's RDD programming model to facilitate parallel processing, ensuring scalability and efficiency in handling massive datasets. Experimental results demonstrate that the proposed algorithms outperform existing methods such as traditional k‐means, SparkDA, MRA, and SKA in terms of both information loss and processing time. Specifically, the fuzzy c‐means variant achieves a 25.5% information loss on a dataset of 100 million records, with processing times reduced by 31%–55% compared to Hadoop‐based solutions. Additionally, the approach maintains high data utility for statistical analysis and decision‐making, effectively balancing privacy and utility. Overall, the study confirms that the integration of improved clustering, weighted information loss assessment, and distributed processing tools like Apache Spark provides a scalable, efficient, and privacy‐preserving solution for big data anonymization, with promising implications for real‐time data publishing and analysis.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2026-02-25
DOI
https://doi.org/10.1002/cpe.70632
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Improved k‐Anonymization Clustering Mechanisms Using Apache Spark for Privacy‐Preserving Big Data Publishing for Real‐Time Dataset

Yashwant Aditya, Priyank Jain, Xiaojun Pan
Concurrency and Computation Practice and Experience
Privacy-Preserving Technologies in Data
article

An Improved k‐Anonymization Clustering Mechanisms Using Apache Spark for Privacy‐Preserving Big Data Publishing for Real‐Time Dataset

Yashwant Aditya, Priyank Jain, Xiaojun Pan
article en

Abstract

ABSTRACT This work presents comprehensive research of a novel privacy‐preserving approach for big data publishing, emphasizing the integration of advanced clustering and anonymization techniques within a distributed computing framework. The hypothesis underpinning this research is that combining improved clustering algorithms with a refined k‐anonymity model can significantly reduce information loss while enhancing data utility, even at large scales. To test this, the methodology employs a hybrid approach that leverages the 2‐means clustering algorithm, enhanced with a mean‐center initialization method, alongside a greedy algorithm for effective data generalization. The core techniques involve constructing a new information loss function based on information quantity theory, which assigns weights to quasi‐identifiers according to their influence on sensitive attributes, thus enabling more precise and less destructive generalization. The implementation utilizes Apache Spark's RDD programming model to facilitate parallel processing, ensuring scalability and efficiency in handling massive datasets. Experimental results demonstrate that the proposed algorithms outperform existing methods such as traditional k‐means, SparkDA, MRA, and SKA in terms of both information loss and processing time. Specifically, the fuzzy c‐means variant achieves a 25.5% information loss on a dataset of 100 million records, with processing times reduced by 31%–55% compared to Hadoop‐based solutions. Additionally, the approach maintains high data utility for statistical analysis and decision‐making, effectively balancing privacy and utility. Overall, the study confirms that the integration of improved clustering, weighted information loss assessment, and distributed processing tools like Apache Spark provides a scalable, efficient, and privacy‐preserving solution for big data anonymization, with promising implications for real‐time data publishing and analysis.

Concurrency and Computation Practice and ExperienceVol. 38(5)
University of Oxford (GB), Indian Institute of Information Technology, Pune (IN), Anhui Business College (CN), Science Oxford (GB)
Peace, Justice and strong institutions
Openalex Percentile: Top 35%
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.