Combinatorial approaches to privacy-preserving data mining
Sourabh Rungtadrsoourabhrungta@rungta.orgDepartment of Computer Science & EngineeringRungta College of Engineering & TechnologyRungta International Skills UniversityBhilai, Chhattisgarh, 490024, IndiaView full profile → , *Nimesh RajCorresponding authornimesh.raj.orp@chitkara.edu.inCentre of Research Impact and Outcome (CRIO)Chitkara UniversityRajpura, Punjab, 140417, IndiaView full profile → , Nagireddy Mounikanagireddymounika.nm@proton.meCentre for Multidisciplinary ResearchAnurag UniversityHyderabad, Telangana, 500088, India0009-0007-6628-2548View full profile → , Varsha Kiran Patilvarsha.patil@aissmsioit.orgDepartment of Electronics & Telecommunication EngineeringAISSMS Institute of Information TechnologyPune, Maharashtra, 411001, IndiaView full profile → , Manisha Tushar Jadhavmanisha.jadhav@vit.eduDepartment of Electronics & Telecommunication EngineeringVishwakarma Institute of TechnologyPune, Maharashtra, 411037, IndiaView full profile → , Chetansinh R. Vaghelacrvaghela.maths.gsc@gokuluniversity.ac.inFaculty of ScienceGokul Global UniversitySidhpur, Gujarat, 384151, India0000-0001-5692-5190View full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Apr 2026
- Published Online:
- 31 Oct 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-3059
- Pages:
- 4383–4395
Abstract
The rapidly increasing number of data-driven applications in various fields like healthcare, finance, and smart governance has raised the issue of privacy and security of sensitive information when mining data. The present paper suggests a new combinatorial model of privacy-preserving data mining utilizing the mathematical tools graph theory, set systems, and combinatorial optimization. The main goal is to develop an effective anonymization model that has minimal information loss, as well as meets high privacy restrictions. The algorithms include building similarity graphs on input data sets, forming clusters based on combinatorial grouping schemes, and eliminating the best partitions based on k-anonymity, l -diversity and t -closeness criteria. A combination of privacy and utility is achieved using a multi-objective optimization technique that is backed up by entropy-based and distance-based privacy metrics. The benchmark datasets are used to perform experimental evaluation and the performance is evaluated based on measures such as re-identification risk, information loss, utility score and computational efficiency. The findings presented in the paper prove that the suggested structure leads to the considerable decrease in the risk of re-identification (up to 0.10) and loss of information (around 0.28) and increases utility scores (up to 0.82) in comparison to the traditional approaches to PPDM. Moreover, the method has better computational efficiency and less time to run and is more scalable.
Keywords
Subject Classifications
References
[1] H. K. Kuba, M. A. Azzawi, S. M. Darwish, O. A. Hassen, and A. A. Abdulhussein, “An adaptive privacy preserving framework for distributed association rule mining in healthcare databases,” Comput. Mater. Continua, vol. 74, no. 2, pp. 4119–4133 (2023), doi: 10.32604/cmc.2023.033182.
[2] A. F. Baig and S. Eskeland, “Security, privacy, and usability in continuous authentication: A survey,” Sensors, vol. 21, no. 17, Art. no. 5967 (2021), doi: 10.3390/s21175967.
[3] B. Bünz, J. Bootle, D. Boneh, A. Poelstra, P. Wuille, and G. Maxwell, “Bulletproofs: Short proofs for confidential transactions and more,” in Proc. IEEE Symp. Security Privacy (SP), San Francisco, CA, USA, pp. 315–334 (2018), doi: 10.1109/SP.2018.00020.
[4] A L. Lin, L. Han, and L. Wang, “A privacy-preserving cross-chain cryptocurrency transfer scheme based on commitment scheme and zero-knowledge proof,” Comput. Electr. Eng., vol. 124, pt. A, Art. no. 110373 (2025), doi: 10.1016/j.compeleceng.2025.110373.
[5] S. Eskeland and A. F. Baig, “Cryptanalysis of a privacy-preserving behavior-oriented authentication scheme,” in Proc. 19th Int. Conf. Security Cryptography (SECRYPT), Lisbon, Portugal, pp. 299–304 (2022).
[6] M. M. Fouda, Z. M. Fadlullah, M. I. Ibrahem, and N. Kato, “Privacy-preserving data-driven learning models for emerging communication networks: A comprehensive survey,” IEEE Commun. Surveys Tuts., early access (2024).
[7] N. Jia, Z. Qu, B. Ye, Y. Wang, S. Hu, and S. Guo, “Communication-efficient federated learning in mobile edge environments,” IEEE Commun. Surveys Tuts., early access (2025).
[8] G. Kumawat, T. Kant, V. Bhardwaj, M. Kumar, A. Rashid, and M. T. Ben Othman, “Cryptographic protocols for passwordless systems with enhanced security,” J. Discrete Math. Sci. Cryptogr., vol. 28, no. 8, pp. 2933–2944 (2025), doi: 10.47974/JDMSC-2438.
[9] R. C. Poonia, T. Singh, C. K. Rajashri, D. Mondal, and S. M. Patil, “Optimizing communication system security through comprehensive testing and intelligent network configurations,” J. Inf. Optim. Sci., vol. 47, no. 5-A, pp. 1709–1717 (2026), doi: 10.47974/JIOS-2261.
[10] Q. Lou and L. Jiang, “HEMET: A homomorphic-encryption-friendly privacy-preserving mobile neural network architecture,” in Proc. 38th Int. Conf. Mach. Learn. (ICML), vol. 139, pp. 7102–7110 (2021).
[11] U. Bhardwaj, M. Renukhadevi, P. V. Meghare, G. Chavan, S. Ikhar, and A. Suneetha, “Stochastic differential equations in modeling gene regulatory networks,” J. Interdiscip. Math., vol. 28, no. 6, pp. 2171–2179 (2025), doi: 10.47974/JIM-2358.
[12] D. R. Bhoyar, “The role of deep learning in network security using explainable artificial intelligence,” Int. J. Adv. Comput. Eng. Commun. Technol., vol. 14, no. 2, pp. 1–8 (2025), doi: 10.65521/intjournaladv.comp.comm.tech.v14i2.925.
[13] Y. Zhang, S. Hu, Q. Wang, B. Qin, Q. Wu, and W. Shi, “PXCrypto: A regulated privacy-preserving cross-chain transaction scheme,” in Algorithms and Architectures for Parallel Processing, pp. 170–191 (2022).
