Evaluation of Noise Distributions for Additive and Multiplicative Smart Meter Data Obfuscation
Bibliographic record
Abstract
In this paper, we compare and analyze light-weight approaches for instantaneous smart meter (SM) data obfuscation from a group of consumers. In the literature, the common approach is to use additive Gaussian noise based SM data obfuscation. In order to investigate the effects of different approaches, we consider Gaussian, Rayleigh, generalized Gaussian and chi-square distributions to achieve either additive or multiplicative data obfuscation. For each type of obfuscation approach, we calculate the required parameters to achieve obfuscation such that 50% of the obfuscated data fall outside an interval equalling twice the mean of the instantaneous SM measurements. We also calculate the minimum number of SMs required to estimate the mean of the actual SM measurements, such that the estimate varies within only 0.5% of the actual mean with a 99.5% probability. Simulation results are used to verify the calculations, and it is shown that multiplicative Rayleigh and generalized Gaussian noise require the least number of SMs, which is 90% less than the traditional approach of additive Gaussian noise-based SM data obfuscation.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.022 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".