Machine learning–driven data perturbation techniques for privacy-preserving data mining
Nadella Sunil, G Narsimha · 2026
Read Machine learning–driven data perturbation techniques for privacy-preserving data mining by Nadella Sunil, G Narsimha (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-13482305.txt.
Description
Sunil and Narsimha build a privacy shield for data mining in 2026 that scrambles records before analysis instead of locking them away or stripping out names. Their framework clusters similar records first, then applies a flip-and-rotation perturbation, a controlled shuffle of values, chosen feature by feature with a structured decision method. Older anonymization tends to gut a dataset's usefulness, while encryption is heavy to compute, so perturbation aims at the middle ground.
Tested against a conventional Naive Bayes approach and fuzzy-based privacy methods, the new framework scored better on all four yardsticks the authors used for judging mining quality. Those yardsticks, accuracy, precision, recall, and the combined F-measure, each favored the perturbation design on the structured datasets used in the experiments. The authors conclude the balance is practical, keeping personal details protected while leaving the patterns analysts mine for still readable in the data.
Catalog record
| CREATOR | Nadella Sunil, G Narsimha |
|---|---|
| YEAR | 2026 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 47 KB |
| VERSION | 1.0 |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |