How shuffling works for effective time series data protection

DOI10.1007/S10479-025-06949-2MaRDI QIDQ7317448zbMATH OpenFDO

Authors Matthew J. Schneider, Jinwook Lee, Lanqing Du

Publication date 24 August 2026

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-025-06949-2

Mathematics Subject Classification ID

Inference from stochastic processes (62Mxx) Mathematical programming (90Cxx) Communication, information (94Axx)

Cites work

• A Brief Survey of Bandwidth Selection for Density Estimation
• Extreme value estimation for a function of a random sample using binomial moments scheme and Boolean functions of events
• Forecasting and planning during a pandemic: COVID-19 growth rates, supply chain disruptions, and governmental decisions
• Geometric series representation for robust bounds of exponential smoothing difference between protected and confidential data
• Least squares quantization in PCM
• Minimizing information loss and preserving privacy
• The Planar k-Means Problem is NP-Hard

This page was built for publication: How shuffling works for effective time series data protection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7317448)