<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>STL-DP: Diferentially Private Time Series Exploring Decomposition and Compression Methods</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Kyunghee Kim</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Minha Kim</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Simon Woo</string-name>
          <email>swoo@g.skku.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Diferential Privacy, Time Series, Fourier Perturbation Algorithm, STL Decomposition</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Applied Data Science, Sungkyunkwan University</institution>
          ,
          <addr-line>Suwon</addr-line>
          ,
          <country country="KR">Korea</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Artifical Intelligence, Sungkyunkwan University</institution>
          ,
          <addr-line>Suwon</addr-line>
          ,
          <country country="KR">Korea</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Department of Statistics, Sungkyunkwan University</institution>
          ,
          <addr-line>Seoul</addr-line>
          ,
          <country country="KR">Korea</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>in Systems @ CIKM'22</institution>
          ,
          <addr-line>Oct. 17-22, 2022, Atlanta, Georgia</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>As time series data is collected and used in a variety of fields, the importance of preserving privacy on time series is also on the increase. This paper is a preliminary study of the Diferential Privacy (DP) algorithm specially designed to provide privacy to time series data by integrating the time series decomposition technique. In particular, this study extends the Fourier Perturbation Algorithm (FPA) with Seasonal and Trend decomposition using LOESS (STL). In this work, we propose STL-DP, which first performs STL decomposition to the original data. Then we apply the FPA only to the core part of the time series, particularly trend or seasonal components, to provide privacy. In this preliminary study, we show that our approach consistently outperforms other baselines in terms of utility according to the experimental results. Our code is available at</p>
      </abstract>
      <kwd-group>
        <kwd>Methods</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>https://github.com/Privacy-DASH/STL-DP.</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        Recently the need for providing data privacy has
significantly increased, as the quantity of data is growing at an
unprecedented speed, and a trend to make such large data
accessible to the public is also growing. To share data
and use them for multiple tasks, ensuring data privacy is
crucial. Therefore, many privacy protection techniques
have been proposed and researched, such as Diferential
Privacy (DP) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], Homomorphic Encryption [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], and
Generative Adversarial Network (GAN) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>However, despite the vulnerability of time series data
due to their widespread application in various fields,
privacy-preserving mechanisms on time series data have
not been extensively investigated yet [4]. In this paper,
we consider and propose a DP mechanism specially
designed to protect the privacy on time series data. One
of the unique characteristics of time series is that it
exhibits a strong correlation among successive values.
Accordingly, if the adversary knows the approximate
time information, information leakage can occur through
contextual understanding, as shown by other research
works [5, 6]. However, existing perturbation methods
such as Gaussian Perturbation Algorithm (GPA) [7], and
Laplace Perturbation Algorithm (LPA) [8] do not consider
nEvelop-O
characteristics of time series to provide the most
suitable privacy protection method for time
series.
• We show that STL-DP efectively protects the
core parts of the time series data under the same
privacy budget, thereby significantly improving
utility over the existing methods.
lowing Eq. (1):</p>
      <p>[ () ∈ ] ≤ 
each , 
comes [12].</p>
      <p>×  [ (
′
) ∈ ], ∀ ∈ ( )
(1)</p>
      <sec id="sec-2-1">
        <title>2.3. Seasonal and Trend decomposition</title>
        <p>DP mechanism aims to keep the query response for</p>
        <p>′ the same, despite having one or fewer non- There are various time series decomposition methods
overlapping individuals. Specifically, the smaller the
such as classical decomposition [14], X11 [15], and
 is, the higher the privacy protection of the data be- STL [9]. The classical method is simple to implement
using LOESS (STL)</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>2. Preliminaries</title>
      <p>
        2.1.  - Diferential Privacy
Diferential Privacy [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] ensures no significant change in
the query response, whether a particular individual is in
a database or not [11].
      </p>
      <p>′
Definition. There are two databases , 
isfy || − 
vidual users, i.e.,  = ∪ =1   , and the data of any single
||1 ≤ 1. D denotes composed data of 
indiuser can be put as  
. Let us denote 
and  as some
randomized function and a privacy budget, respectively.
 guarantees  -privacy if and only if it satisfies the
fol′
which
sat</p>
      <sec id="sec-3-1">
        <title>2.2. DP Algorithms for Time Series</title>
        <sec id="sec-3-1-1">
          <title>Laplace Perturbation Algorithm (LPA).</title>
          <p>
            LPA [8]
adds independent noise generated from the Laplace
distribution [
            <xref ref-type="bibr" rid="ref1">1</xref>
            ]. LPA is renowned for its simplicity but it
is unsuitable for protecting time series because of its
independent noise injection.
          </p>
        </sec>
        <sec id="sec-3-1-2">
          <title>Fourier Perturbation Algorithm (FPA). FPA is a</title>
          <p>compression-based method that first applies the
Discrete Fourier Transform (DFT) to the true query
answers, then performs LPA to Fourier coeficients [ 8].
The perturbed coeficients undergo the inverse DFT
(IDFT) to obtain the resulting perturbed sequence. The
entire process can be expressed as perturbed f(D) =
   ( (  ( ()))
, where  is a function that maps
each individual  1,  2, … ,   to numbers. The DFT and
IDFT for the  ℎ element of the series is defined as ( 2):
  ( ())
   ( ())
 =</p>
          <p>= ∑ 
=1

∑ 
1
 =1
2 √−1</p>
          <p>− 2 √−1 

 () 
As compression methods convert the series from time
to frequency domain, noises injected in the frequency
domain are no longer independent but are correlated.
For this reason, FPA is better suited for perturbing time
series [13], and we extend the FPA-based method in our
work.
but is inapplicable since some data from both ends of the
sequence are lost. X11 successfully tackled the problem
of data loss but is still limited in use as it can only handle
monthly or quarterly data. On the other hand, STL
effectively handles the problems mentioned above. STL is
a flexible and robust time series decomposition method
that leverages local regression (LOESS).</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>3. Our Approach</title>
      <p>We propose STL-DP to protect core information of the
time series while improving utility within a predefined
privacy budget. Refer to Figure 1 for a glance at our
proposed STL-DP.</p>
      <p>The main diference of STL-DP with the existing
methods is the integration of STL decomposition. First, by
incorporating the decomposition phase, we can identify
the core components, such as the trend and seasonality of
time series data, which may contain critical information
and are prone to attacks. One of the STL-DP
mechanisms is referred to as sFPA, which is a method that injects
noises only to the seasonal part of the decomposed series.
Similarly, the approach of performing perturbations only
on the trend is named tFPA. Lastly, the perturbed
components from the seasonal or trend parts are combined with
the rest of the unperturbed components to reconstruct
the form of the sequence.</p>
    </sec>
    <sec id="sec-5">
      <title>4. Experimental Results</title>
      <p>Methods. We demonstrate the efectiveness of the
proposed STL-DP by comparing the utility of our sFPA and
tFPA with two baselines, LPA and FPA. Herein, we
introduce two diferent metrics to quantify utility. The first
metric is the Euclidean distance between the original
and the perturbed series. Nextly, the original and the
perturbed data are each fed into the forecasting model to
evaluate the respective Mean Absolute Percentage Error
(MAPE), and the diference between the two MAPEs is
used as the second metric.</p>
      <p>Dataset. We used the power consumption data from
2017-01-01 to 2017-12-31 of three zones of Tetouan city
located in northern Morocco [16]. The properties of the
dataset are summarized as follows:
• Prediction variables : Power consumption of zone
1, 2, and 3 of Tetouan city with additional
information, including temperature, humidity, wind
speed, general difuse flows, and difuse flows.
• Data information : Aggregated from 550,374
inhabitants according to Morocco Census [16].</p>
      <p>Throughout the experiment, we set the privacy budget
1 − 4 as 0.48, 2.4, 4.8, and 24, respectively, and the
sensitivity as 48, which are experimental settings taken
from Günther, et al. [17].</p>
      <p>Euclidean distance results. The degree of closeness
between the original and the perturbed series under the
same privacy budget can be interpreted as the level of
utility. As shown in Table 1, LPA yields a greater distance
than other methods, confirming that FPA-based methods
are better than LPA. Furthermore, our tFPA and sFPA
are consistently ranked as the best algorithm in terms of
Euclidean distance. These results indicate the superiority
of STL-DP over the baselines.</p>
      <sec id="sec-5-1">
        <title>Comparison on forecasting performances. Recall</title>
        <p>that our objective is to generate noise-injected series that
minimize the performance drop of the forecasting model.</p>
        <p>As shown in Table 2, we used four models, from a simple
feed-forward neural network to advanced models such
as LSTM and Transformer as our forecasting model. The
models were trained to predict the upcoming 20 timesteps
given the past 60 timesteps. In most cases, as  grew, the
forecasting error diference ( △MAPE) decreased. Not
surprisingly, both sFPA and tFPA outperformed other DP Generative adversarial nets, Advances in neural
mechanisms for a majority of models in terms of △MAPE. information processing systems 27 (2014).
[4] S. Papadimitriou, F. Li, G. Kollios, P. S. Yu, Time
series compressibility and privacy, in: Proceedings
5. Conclusion and Future Work of the 33rd international conference on Very large
data bases, Citeseer, 2007, pp. 459–470.</p>
        <p>As preliminary research, we introduce an efective DP [5] Y. Zhu, Y. Fu, H. Fu, On privacy in time series
mechanism, STL-DP, specially designed for generating data mining, in: Pacific-Asia Conference on
Knowlprivacy-protected time series data. As the experiment edge Discovery and Data Mining, Springer, 2008,
results suggested, the distance between the original se- pp. 479–493.
ries and the perturbed series from sFPA and tFPA was [6] Y. Zhu, Y. Fu, H. Fu, A new class of attacks on time
much closer than the other baselines. Also, the diference series data mining, Intelligent Data Analysis 14
between the MAPE of the original and the perturbed se- (2010) 405–418.
ries was significantly lower for our proposed sFPA and [7] N. U. Sheikh, H. J. Asghar, F. Farokhi, M. A. Kaafar,
tFPA than for other perturbation algorithms. Therefore, Do auto-regressive models protect privacy inferring
we showed that considering the unique property of time ifne-grained energy consumption from aggregated
series data improves the utility under the same privacy model parameters, IEEE Transactions on Services
budget. For future works, we plan to extend our research Computing (2021).
by designing a more advanced mechanism     , that [8] V. Rastogi, S. Nath, Diferentially private
aggregauses only the  (&lt; ) Fourier coeficients as targets of the tion of distributed time-series with transformation
perturbation. and encryption, in: Proceedings of the 2010 ACM
SIGMOD International Conference on Management
Acknowledgments of data, 2010, pp. 735–746.
[9] R. B. Cleveland, W. S. Cleveland, J. E. McRae, I.
TerThe work was supported by the afiliated institute of penning, Stl: A seasonal-trend decomposition, J.
ETRI [2022-075]. Also, this work was partially supported Of. Stat 6 (1990) 3–73.
by the Basic Science Research Program through National [10] W. G. Jacoby, Loess:: a nonparametric, graphical
Research Foundation of Korea (NRF) grant funded by tool for depicting relationships between variables,
the Korean Ministry of Science and ICT (MSIT) under Electoral studies 19 (2000) 577–613.
No. 2020R1C1C1006004 and Institute for Information [11] W. Huang, S. Zhou, T. Zhu, Y. Liao, Improving
&amp; communication Technology Planning &amp; evaluation utility of diferentially private mechanisms through
(IITP) grants funded by the Korean MSIT: (No. 2022- cryptography-based technologies: a survey, arXiv
0-01199, Graduate School of Convergence Security at preprint arXiv:2011.00976 (2020).
Sungkyunkwan University), (No. 2022-0-01045, Self- [12] J. Wang, S. Liu, Y. Li, A review of diferential privacy
directed Multi-Modal Intelligence for solving unknown, in individual data release, International Journal of
open domain problems), (No. 2022-0-00688, AI Platform Distributed Sensor Networks 11 (2015) 259682.
to Fully Adapt and Reflect Privacy-Policy Changes), (No. [13] H. Wang, Z. Xu, Cts-dp: publishing correlated
2021-0-02068, Artificial Intelligence Innovation Hub), (No. time-series data via diferential privacy,
Knowledge2019-0-00421, AI Graduate School Support Program at Based Systems 122 (2017) 167–179.
Sungkyunkwan University), and (No. 2021-0-02309, Ob- [14] J. Cohen, W. Gorr, C. Durso, Estimation of crime
seaject Detection Research under Low Quality Video Condi- sonality: a cross-sectional extension to time series
tion). classical decomposition, H. John Heinz III Working
Paper (2003).
[15] A. Sutclife, X11 time series decomposition and
samReferences pling errors, Australian Bureau of Statistics, 1993.
[16] A. Salam, A. El Hibaoui, Comparison of machine
learning algorithms for the power consumption
prediction:-case study of tetouan city–, in: 2018 6th
International Renewable and Sustainable Energy</p>
        <p>Conference (IRSEC), IEEE, 2018, pp. 1–5.
[17] G. Eibl, K. Bao, P.-W. Grassal, D. Bernau,</p>
        <p>H. Schmeck, The influence of diferential privacy
on short term electric load forecasting, Energy
Informatics 1 (2018) 93–113.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>C.</given-names>
            <surname>Dwork</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>McSherry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Nissim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Smith</surname>
          </string-name>
          ,
          <article-title>Calibrating noise to sensitivity in private data analysis</article-title>
          ,
          <source>in: Theory of cryptography conference</source>
          , Springer,
          <year>2006</year>
          , pp.
          <fpage>265</fpage>
          -
          <lpage>284</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Rivest</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Adleman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. L.</given-names>
            <surname>Dertouzos</surname>
          </string-name>
          , et al.,
          <article-title>On data banks and privacy homomorphisms</article-title>
          ,
          <source>Foundations of secure computation 4</source>
          (
          <year>1978</year>
          )
          <fpage>169</fpage>
          -
          <lpage>180</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>I.</given-names>
            <surname>Goodfellow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pouget-Abadie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mirza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Warde-Farley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ozair</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Courville</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>