<!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>Synthesising Tabular Data using Wasserstein Conditional GANs with Gradient Penalty (WCGAN-GP) ?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Manhar Walia</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Brendan Tierney</string-name>
          <email>brendan.tierney@tudublin.ie</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Susan McKeever</string-name>
          <email>susan.mckeever@TUDublin.ie</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>TU Dublin</institution>
          ,
          <addr-line>Dublin</addr-line>
          ,
          <country country="IE">Ireland</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Deep learning based methods based on Generative Adversarial Networks (GANs) have seen remarkable success in data synthesis of images and text. This study investigates the use of GANs for the generation of tabular mixed dataset. We apply Wasserstein Conditional Generative Adversarial Network (WCGAN-GP) to the task of generating tabular synthetic data that is indistinguishable from the real data, without incurring information leakage. The performance of WCGAN-GP is compared against both the ground truth datasets and SMOTE using three labelled real-world datasets from di erent domains. Our results for WCGAN-GP show that the synthetic data preserves distributions and relationships of the real data, outperforming the SMOTE approach on both class preservation and data protection metrics. Our work is a contribution towards the automated synthesis of tabular mixed data.</p>
      </abstract>
      <kwd-group>
        <kwd>Synthetic Data</kwd>
        <kwd>Generative Adversarial Network</kwd>
        <kwd>GAN</kwd>
        <kwd>WCGAN-GP</kwd>
        <kwd>Tabular Data Generation</kwd>
        <kwd>Euclidean Distance</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Real-world data is commonly used in the demonstration and evaluation of novel
technologies in areas such as software development or data analytics. Machine
learning algorithms require sample data to learn from, but data accessibility,
insu cient data and privacy constraints have set barriers to the development of
certain models. Traditionally, real-world data was anonymized using approaches
like k-anonymity, l-diversity, or t-closeness to minimize any disclosure risks. But
these privacy perturbation approaches have still been linked to poor privacy
protection and semantic suitability [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. These approaches also result in the loss
of usability of the modi ed data. As a result, the generation of realistic, usable
synthetic data o ers a solution to overcoming the hurdles of data dissemination.
      </p>
      <p>
        Data Synthesis has traditionally been done via user speci cation of the
dataset feature characteristics and statistical distributions using a variety of
commercial tools such as Mockaroo4. More recently, deep learning networks (GANs)
? Supported by TU Dublin.
4 https://www.mockaroo.com/
[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] have been applied to automatically generating a dataset based on a seeding
(real) dataset. GANs are built using an architecture of two neural networks that
compete against each other in an adversarial manner with an attempt to
generate new samples. Since their inception in 2014, GANs have seen tremendous
success in synthesizing realistic images and text [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>
        Early GANs su er from training problems like vanishing gradients and
modecollapse [
        <xref ref-type="bibr" rid="ref21 ref23">21, 23</xref>
        ], resulting in poor training performance and limited diversity in
new samples. A modi ed GAN variant that addresses these issues,
WCGANGP (Wasserstein Conditional GANs with Gradient Penalty) [
        <xref ref-type="bibr" rid="ref14 ref3">14, 3</xref>
        ] is studied for
tabular data generation in this paper and its ability to generate a high quality
data is examined.
      </p>
      <p>
        Using three real-world datasets, the quality of data generated by
WCGANGP is tested on data utility and privacy metrics, and compared to the both the
ground truth datasets and Synthetic Minority Oversampling Technique (SMOTE)
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. We demonstrate that WCGAN-GP outperforms SMOTE in generating data
that preserves data patterns along with higher privacy protection.
      </p>
      <p>The contributions of the paper are summarised as follows: (1) A
comprehensive proof-of-concept to showcase the success of WCGAN-GP in the generation
of synthetic tabular data. (2) A comparison of WCGAN-GP to SMOTE on data
utility and privacy metrics across di erent mixed-type datasets. (3) Contrary
to the belief that GANs su er from training problems, we demonstrate that
WCGAN-GP provides a strong modelling performance and stable training on
structured data.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Works</title>
      <p>Synthetic data can be generated in two ways. Firstly, by statistical modelling to
learn from user-speci ed distributions or directly from real data. Secondly, by
using deep learning to learn from the real data with minimal user inputs.
2.1</p>
      <sec id="sec-2-1">
        <title>Statistical Modelling Approaches</title>
        <p>
          The statistical modelling methods can be classi ed into process-driven and
datadriven [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. The process-driven methods generate data using handcrafted
distributions and do not use real data. These methods require human intervention
and are prone to human bias [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]. The data-driven approaches generate
synthetic data via the automated learning of the intrinsic patterns from real data.
[
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] implemented data synthesizers based on machine learning algorithms, but
the approaches pose disclosure risks if the classi cation accuracy is high.
        </p>
        <p>
          SMOTE is originally developed for oversampling and address the imbalance
problem [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. But it is also used in generating synthetic data to replace the real
data [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. SMOTE is faster to run and can generate a good quality of synthetic
data without the need for any hyperparameter optimisation.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Deep Generative Modelling Approaches</title>
        <p>
          The success of deep generative models in the eld of natural language processing
has motivated the use of neural networks for data generation. GANs have shown
remarkable performance in generating synthetic images and time-series data [
          <xref ref-type="bibr" rid="ref10 ref8">8,
10</xref>
          ]. However, GANs have had limited testing on structured data [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ] use
GANs to create synthetic database and tested it on numerical data. [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] use
GANs for data generation - but three out of the four datasets are synthetically
created. Further, researchers have noted limitations with GANs when generating
labelled data [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] and proposed Conditional GANs (CGANs), where class labels
are taken into account [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ] apply CGANs on a numerical data to generate
synthetic data, but the scatterplots of the synthetic data indicated signs of mode
collapse.
        </p>
        <p>
          MedGAN [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] uses auto-encoders but is tested for binary and numeric data.
Its design does not support di erent data types in the same model and requires
separate models for each data type [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. TableGAN and VEEGAN work well with
numerical data but su er from mode collapse with categorical data [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ].
        </p>
        <p>
          Even though GANs have shown success in image generation, their training is
not easy and unstable [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ]. Arjovsky et al. [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] have cited problems of vanishing
gradients. There are variants like WGAN and WGAN-GP that provide a more
stable training framework [
          <xref ref-type="bibr" rid="ref14 ref6">14, 6</xref>
          ]. [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] have noted that WGANs can still su er from
unstable training and vanishing gradients. WGAN-GP enforces a regularization
term in the form of gradient penalty. WGAN-GP has been implemented on
largescale image and language datasets and shown to provide superior performance
over WGANs [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. WGAN-GP is easily extended to WCGAN-GP by inputting
the condition vector, that is target labels. This enables the GAN to learn the
distributions speci c to each class label and produce higher quality samples for
both labels. The ability of WCGAN-GP to draw samples from images has been
explored but has not been tested on tabular datasets. The resultant paucity in
the current literature is something this research seeks to address.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>WCGAN-GP</title>
    </sec>
    <sec id="sec-4">
      <title>Model</title>
      <p>
        For the purposes of presenting our work, we present a brief overview of
WCGANGP here, but further details can be found in the original work of WGAN-GP
[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. WCGAN-GP uses Wasserstein distance and Gradient Penalty to reduce the
occurrence of failure modes associated with GANs. WCGAN-GP is similar to
WGAN-GP and the only change is where critic (discriminator) and generator
are both conditioned on an extra information of class labels. In WCGAN-GP,
the discriminator is called as a critic. Rather than classifying samples as real or
fake, the critic predicts values that are large for real and small for fake samples.
The structure of WCGAN-GP is shown in Fig. 1.
      </p>
      <p>
        WCGAN-GP uses gradient penalty to force the norm of gradients to be 1 and
comply with 1-Lipschitz constraint. This helps in overcoming the training
instability of GANs that occurs when the critic outputs explosive gradients. Thus,
the weights are clipped using the 1-Lipschitz function and the rate of change
is bounded. This metric results in faster convergence as the training provides
reasonable gradients and the critic becomes more stable and less explosive.
In this section, we used three labelled real-world datasets to evaluate
WCGANGP against a second synthesis technique, SMOTE. The quality of synthetic data
was then assessed using a variety of data utility and privacy metrics.
To test our synthesis approach, we selected three real-world datasets from three
di erent domains - Default of Credit Card5, Cardiovascular Disease6 and Adult
Census7. These datasets contain mixed data-types and were chosen for their
di erences in data type distributions, allowing us to detect whether the methods
perform better or worse for speci c types of data. Further, the datasets can be
potentially categorized as medium-sized datasets and are labelled allowing us
to test that the synthesis approach preserves class data patterns. Two of the
datasets have imbalanced classes, which is a common occurrence in real-world
domains. The properties of the datasets are summarized in Table 1.
5 https://www.kaggle.com/uciml/default-of-credit-card-clients-dataset
6 https://www.kaggle.com/sulianova/cardiovascular-disease-dataset
7 https://www.kaggle.com/uciml/adult-census-income
data to the GANs needs to be in an appropriate representation. Each categorical
variables is label-encoded to convert to numerical format for both SMOTE and
WCGAN-GP. The continuous variables (including the label-encoded
categorical variables) were then standardized to bring all the variables into the same
range [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. This results in faster convergence, better processing and ease of
reproducibility. It also ensures that each feature gets an equal importance and
avoid any biases due to the scale of any speci c attribute. Standardization was a
crucial pre-processing step with GANs, but with SMOTE, it was not a necessity
to standardize or transform the numerical data as the results were not impacted
with this transformation.
4.3
      </p>
      <sec id="sec-4-1">
        <title>Experiment Design</title>
        <p>
          WCGAN-GP: To design the WCGAN-GP model, we used hyperparameter
tuning guidelines from GAN [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], WGAN [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] and WGAN-GP [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] sources, all of
whom have provided recommendations and guidance on parameter settings that
have been proved to be successful in many tasks. The implementation of
experiments was carried out using Python 3.7 and speci cally, Keras and TensorFlow.
For all datasets, the same WCGAN-GP architecture was implemented.
Network Architecture: The depth of generator and critic was set to 3. For
generator, the size of nodes in hidden layer were ordered in an ascending size, that is
d, d*2, d*4 (where d is 128). The critic had the same hidden nodes but ordered
in a descending size [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ]. As the input was not an image, the two neural networks
did not require convolution layers and thus, were built using dense layers. Leaky
ReLU was used as the activation function for each layer except the output layer
which used linear activation [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ]. The use of dropout in generator was done to
minimize the over- tting. The batch size was 64, learning rate was 0.0001 and
Adam Optimizer was used to minimize the loss function. The momentum term
1 and 2 were set as 0.5 and 0.9 respectively [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. The model was trained for
5000 epochs as over-training had started to deteriorate the quality of synthetic
data. The random noise vector had a length of 32. Once the training was
completed, the synthetic data was generated with an exact size as of real data. The
list of settings for WCGAN-GP model is outlined in Table 2.
        </p>
        <p>Data Generation: Once the model had been trained, the trained generator was
used to produce synthetic data samples.</p>
        <p>Reverse Transformation: As the synthetic data generated using WCGAN-GP
was in a standardized range because of the initial transformations applied on the
critic C generator G
Input - Dimension of real data Input - Random Noise: 32
512, Leaky RELU (alpha: 0.2) 128, Leaky RELU (alpha: 0.2) , Dropout (0.3)
256, Leaky RELU (alpha: 0.2) 256, Leaky RELU (alpha: 0.2) , Dropout (0.3)
128, Leaky RELU (alpha: 0.2) 512, Leaky RELU (alpha: 0.2) , Dropout (0.3)
Output - 1, Linear activation Output - Dimension of real data, Linear activation
Other Parameters: Learning rate: 0.0001; Adam Optimizer; Batch size: 64; Epochs: 5000
input data, the synthetic data needed to be reverse transformed (with respect to
the initial transformations) to ensure that the synthetic data looked like the real
data. The inverse transformations were speci c to the initial transformations
performed for each variable and were done after the data was generated.
SMOTE: SMOTE was chosen as the comparative approach due to its
popularity and common usage. SMOTE does not require any parameter optimizations.
As there is no need to build or train any model, the synthetic data can be
generated instantly.</p>
        <p>SMOTE was used to generate data using the following method. After
preprocessing, the original data (with n instances) was replicated to create copies
of the dataset and made imbalanced in a ratio of 2 to 1. A new target label
was assigned with label as 1 for majority class (2*n instances) and 0 for
minority (n instances). SMOTE was run to generate synthetic data samples using
the imbalanced-learn library. This generated new synthetic samples with n new
instances. As a nal step, the new samples were extracted to form a synthetic
dataset with the exact size of real data.
4.4</p>
      </sec>
      <sec id="sec-4-2">
        <title>Evaluation Metrics</title>
        <p>The metrics we used to determine the similarity of the synthetic datasets to the
original datasets, and their preservation of privacy are as follows:
Visual Evaluation (Utility Metric): Univariate analysis was performed to
observe the Box and Whisker plots for the numerical and histogram distributions
for categorical variables. Further, bi-variate analysis was done to compare the
scatterplots between variables in synthetic against variables in real data. These
visualisations helped to a rm whether the relationships were preserved in the
synthetic data and indicated any existence of mode collapse. Finally, the
correlations between the columns of each dataset were also assessed using heatmaps.</p>
      </sec>
      <sec id="sec-4-3">
        <title>Classi cation Performance (Utility Metric): The synthetic data is a good</title>
        <p>
          representation of the real labelled dataset if it performs in the same way as
the real data does when used to create and test a machine learning model [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ].
This approach involves comparing the performance of a machine learning model
trained and tested on real (TRTR) and synthetic data (TSTS) [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ].
        </p>
        <p>
          Decision Tree, Random Forest, Support Vector Machine, and Adaboost were
selected as the classi ers because of their common usage and not for any speci c
performance on the datasets. XGBoost was chosen as it has gained popularity
in many machine learning competitions for its speed &amp; performance [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ].
        </p>
        <p>
          The real and synthetic data were split in a 5-fold cross validation. There
were three di erent training-testing settings performed. Setting A REAL: train
the predictive models on real training data, test the performance of trained
model on real test set. Setting B SMOTE: For the synthetic data generated by
SMOTE, train on the generated synthetic train data and test on synthetic test
data. Setting C WCGAN-GP: For the synthetic data generated by
WCGANGP, train on the generated synthetic train data and test on synthetic test data.
For the evaluation metric, F1 score (harmonic mean of precision and recall) was
recorded as it is one of the widely used metrics to evaluate classi cation models.
Euclidean Distance to The Nearest Record (Privacy Metric): Euclidean
distance was used to evaluate the disclosure risk as it can o er perspective on
the similarity of the records between datasets [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ]. Euclidean distance to nearest
record (d) is the mean distance between synthetic sample and its closest record
in original data. A record with zero distance would imply leakage of information
and low privacy. The desired outcome is a high mean and low standard
deviation. Although Euclidean distance was a metric used for privacy, it was only an
indicator of the level of privacy and didn't provide any guarantees at individual
row level.
        </p>
      </sec>
      <sec id="sec-4-4">
        <title>Duplicate records between Real and Synthetic (Privacy Metric): It</title>
        <p>checked if there were any duplicates between samples in synthetic and real data.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Experimental Results</title>
      <p>In this section, the results are presented and it is shown that WCGAN-GP
showed a better balance between privacy and data utility. Across all datasets,
WCGAN-GP performed on par or better than SMOTE on utility and privacy
metrics. Note that only relevant visuals and results are presented in this section.
5.1</p>
      <sec id="sec-5-1">
        <title>Utility Metric: Visual Evaluation</title>
        <p>Box-Plots: Across all datasets, the numerical samples synthesized from SMOTE
and WCGAN-GP had a similar distribution as compared with the real data.
Both the approaches were able to capture the basic properties and had a
similar range, median, IQR and so on. However, WCGAN-GP model generated few
additional out-of-range values (or outliers) in the synthetic data. For instance,
the results for credit card dataset are shown in Fig. 2. `Age' has more outliers
towards both the extremes and also contains negative values. This suggests the
need for synthetic data treatment after the data is generated using WCGAN-GP
to ensure that the data makes sense from logical and business perspective.
Histograms: Both SMOTE and WCGAN-GP were able to approximately
capture the frequency distributions of categorical variables, but with exceptions.
The class imbalance problem was reproduced and remained intact in synthetic
datasets. For both approaches, the distributions were nearly similar in most cases
when compared with the real data. However, the frequency distributions were
not a perfect replica and did not exactly match for either approach. For instance,
Fig. 3 shows that the frequencies for `Workclass', `Gender', and 'Marital status'
in Adult Census data do di er by a certain magnitude, when compared against
the real data. It is observed that WCGAN-GP had a hard time capturing the
distributions as compared to SMOTE for categories with multi-levels. Similar
trend was reproduced in all the three datasets.
Scatterplots: It can be seen from Fig. 4 that the generated data using SMOTE
and WCGAN-GP seemed to establish and maintain the relationships between
the variables. This pattern was repeated in all the three datasets. It is also
inferred that WCGAN-GP had not su ered from mode collapse, which is a
common training problem. The samples produced were diverse enough and the model
was able to learn and reproduce the distributions of the real-world data.
Correlation Matrix: The results of correlation matrix between the columns of
each dataset are presented in Fig. 5. It is observed that the column correlations
in synthetic datasets were nearly similar to the original data correlations.
As shown in Table 3, WCGAN-GP performed at par or better than SMOTE
in machine learning tasks. Across datasets, F1 scores of the predictive model
built on WCGAN-GP's synthetic data was comparable to the model built on
real data. On the contrary, F1 scores of model on SMOTE's synthetic data were
far-o from the model on real data, with the exception of cardiovascular dataset.</p>
        <p>The quality of synthetic data by WCGAN-GP for data usability was
impacted by the presence of data-types in a data. Synthetic data for Credit Card
(had more numerical than categorical variables) provided comparable machine
learning performance with real data. On the contrary, the F1 scores of models on
synthetic data for Cardiovascular or Adult Census data (having more categorical
than numerical variables) were signi cantly di erent with the F1 scores of
models on real data. The sub-optimal performance in these datasets could be due to
presence of more categorical variables and the gaps noted between the frequency
distributions of categorical columns of synthetic data (from WCGAN-GP) and
real data. Overall, WCGAN-GP fared better than SMOTE in classi cation tasks
as the results for WCGAN-GP data were closer to the results of real data.
There were no duplicate records between real and synthetic datasets generated
using WCGAN-GP. Whilst this is a somewhat blunt metric, it does strike out the
possibility of copied records in synthetic data. There were less than 0.1 percent
of identical matches found with SMOTE.
6</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>The main objective was to investigate the e cacy of WCGAN-GP for
generation of tabular datasets with mixed data types, whilst preserving the patterns
and privacy of the seeding datasets. The results showed that WCGAN-GP
offer a promising framework to generate continuous and categorical data as the
synthetic data showed preservation of patterns, distributions and relationships
of the real dataset. The synthetic data from WCGAN-GP showed comparable
performance with real data in the classi cation tasks, substantially better than
SMOTE. The synthetic data from WCGAN-GP also o ered a better privacy
protection than SMOTE.</p>
      <p>A potential direction for future research is to combine WCGAN-GP with
privacy preserving mechanisms like di erential privacy to provide formal and
stronger privacy guarantees. Further, more nuanced metrics can be produced
and applied in future work to ensure compliance with data protection
regulations. Another interesting avenue for future work would be the use softmax or
Gumbel softmax to improve the quality of datasets with categorical data types.
Finally, evaluation could be expanded to including unsupervised learning tasks
like clustering and segmentation to showcase the generalizability and bene ts of
WCGAN-GP for synthetic data generation.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Arjovsky</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bottou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Towards principled methods for training generative adversarial networks</article-title>
          .
          <source>arXiv preprint arXiv:1701.04862</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Arjovsky</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chintala</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bottou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Wasserstein gan</article-title>
          .
          <source>arXiv preprint arXiv:1701.07875</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Ba</surname>
          </string-name>
          , H.:
          <article-title>Improving detection of credit card fraudulent transactions using generative adversarial networks</article-title>
          .
          <source>arXiv preprint arXiv:1907</source>
          .
          <volume>03355</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Bellovin</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dutta</surname>
            ,
            <given-names>P.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reitinger</surname>
          </string-name>
          , N.:
          <article-title>Privacy and synthetic datasets</article-title>
          .
          <source>Stan. Tech. L. Rev. 22</source>
          ,
          <issue>1</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Brenninkmeijer</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>de Vries</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marchiori</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hille</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>On the generation and evaluation of tabular data using gans (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Cao</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Long</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          : Hashgan:
          <article-title>Deep learning to hash with pair conditional wasserstein gan</article-title>
          .
          <source>In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</source>
          . pp.
          <volume>1287</volume>
          {
          <issue>1296</issue>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Chawla</surname>
            ,
            <given-names>N.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bowyer</surname>
            ,
            <given-names>K.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hall</surname>
            ,
            <given-names>L.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kegelmeyer</surname>
            ,
            <given-names>W.P.</given-names>
          </string-name>
          :
          <article-title>Smote: synthetic minority over-sampling technique</article-title>
          .
          <source>Journal of arti cial intelligence research 16</source>
          ,
          <volume>321</volume>
          {
          <fpage>357</fpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Choi</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Biswal</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malin</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Duke</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stewart</surname>
            ,
            <given-names>W.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
          </string-name>
          , J.:
          <article-title>Generating multilabel discrete patient records using generative adversarial networks</article-title>
          .
          <source>arXiv preprint arXiv:1703.06490</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Drechsler</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reiter</surname>
            ,
            <given-names>J.P.:</given-names>
          </string-name>
          <article-title>An empirical evaluation of easily implemented, nonparametric methods for generating synthetic datasets</article-title>
          .
          <source>Computational Statistics &amp; Data Analysis</source>
          <volume>55</volume>
          (
          <issue>12</issue>
          ),
          <volume>3232</volume>
          {
          <fpage>3243</fpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Esteban</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hyland</surname>
            ,
            <given-names>S.L.</given-names>
          </string-name>
          , Ratsch, G.:
          <article-title>Real-valued (medical) time series generation with recurrent conditional gans</article-title>
          .
          <source>arXiv preprint arXiv:1706.02633</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>Garcia</given-names>
            <surname>Torres</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          :
          <article-title>Generation of synthetic data with generative adversarial networks (</article-title>
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Goncalves</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ray</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Soper</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stevens</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Coyle</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sales</surname>
            ,
            <given-names>A.P.</given-names>
          </string-name>
          :
          <article-title>Generation and evaluation of synthetic patient data</article-title>
          .
          <source>BMC Medical Research Methodology</source>
          <volume>20</volume>
          ,
          <issue>1</issue>
          {
          <fpage>40</fpage>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Goodfellow</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pouget-Abadie</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mirza</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Warde-Farley</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ozair</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Courville</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Generative adversarial nets</article-title>
          .
          <source>In: Advances in neural information processing systems</source>
          . pp.
          <volume>2672</volume>
          {
          <issue>2680</issue>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Gulrajani</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ahmed</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Arjovsky</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumoulin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Courville</surname>
            ,
            <given-names>A.C.</given-names>
          </string-name>
          :
          <article-title>Improved training of wasserstein gans</article-title>
          .
          <source>In: Advances in neural information processing systems</source>
          . pp.
          <volume>5767</volume>
          {
          <issue>5777</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Heyburn</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bond</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Black</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mulvenna</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wallace</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rankin</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cleland</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Machine learning using synthetic and real data: Similarity of evaluation metrics for di erent healthcare datasets and for di erent algorithms</article-title>
          .
          <source>In: Proc. 13th Int. FLINS Conf.(FLINS2018)</source>
          . World Scienti c (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Jordon</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yoon</surname>
          </string-name>
          , J., van der Schaar, M.:
          <article-title>Measuring the quality of synthetic data for use in competitions</article-title>
          . arXiv preprint arXiv:
          <year>1806</year>
          .
          <volume>11345</volume>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Kaloskampis</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pugh</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joshi</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nolan</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Synthetic data for public good | data science campus</article-title>
          . https://datasciencecampus.ons.gov.uk/projects/syntheticdata-for
          <string-name>
            <surname>-</surname>
          </string-name>
          public-good/ (
          <year>2020</year>
          ), (Accessed on 10/11/2020)
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>P.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>P.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>C.M.</given-names>
          </string-name>
          :
          <article-title>Empirical evaluation on synthetic data generation with generative adversarial network</article-title>
          .
          <source>In: Proceedings of the 9th International Conference on Web Intelligence, Mining and Semantics</source>
          . pp.
          <volume>1</volume>
          {
          <issue>6</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Mirza</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Osindero</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Conditional generative adversarial nets</article-title>
          .
          <source>arxiv 2014. arXiv preprint arXiv:1411.1784</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Park</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mohammadi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gorde</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jajodia</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Park</surname>
          </string-name>
          , H.,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Data synthesis based on generative adversarial networks</article-title>
          .
          <source>arXiv preprint arXiv:1806</source>
          .
          <volume>03384</volume>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Radford</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Metz</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chintala</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Unsupervised representation learning with deep convolutional generative adversarial networks</article-title>
          .
          <source>arXiv preprint arXiv:1511.06434</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Sagong</surname>
            ,
            <given-names>M.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shin</surname>
            ,
            <given-names>Y.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yeo</surname>
            ,
            <given-names>Y.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Park</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ko</surname>
            ,
            <given-names>S.J.</given-names>
          </string-name>
          <article-title>: cgans with conditional convolution layer</article-title>
          . arXiv preprint arXiv:
          <year>1906</year>
          .
          <volume>00709</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Salimans</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goodfellow</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zaremba</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cheung</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Radford</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Improved techniques for training gans</article-title>
          .
          <source>In: Advances in neural information processing systems</source>
          . pp.
          <volume>2234</volume>
          {
          <issue>2242</issue>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Sandulescu</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chiru</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Predicting the future relevance of research institutionsthe winning solution of the kdd cup 2016</article-title>
          . arXiv preprint arXiv:
          <volume>1609</volume>
          .02728 (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Surendra</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mohan</surname>
          </string-name>
          , H.:
          <article-title>A review of synthetic data generation methods for privacy preserving data publishing</article-title>
          .
          <source>Int J Sci Technol Res</source>
          <volume>6</volume>
          (
          <issue>3</issue>
          ),
          <volume>95</volume>
          {
          <fpage>101</fpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Tanaka</surname>
            ,
            <given-names>F.H.K.d.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aranha</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Data augmentation using gans</article-title>
          . arXiv preprint arXiv:
          <year>1904</year>
          .
          <volume>09135</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Vega-Marquez</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rubio-Escudero</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Riquelme</surname>
            ,
            <given-names>J.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nepomuceno-Chamorro</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Creation of synthetic data with conditional generative adversarial networks</article-title>
          .
          <source>In: International Workshop on Soft Computing Models in Industrial and Environmental Applications</source>
          . pp.
          <volume>231</volume>
          {
          <fpage>240</fpage>
          . Springer (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Empirical evaluation of recti ed activations in convolutional network</article-title>
          .
          <source>arXiv preprint arXiv:1505.00853</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skoularidou</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cuesta-Infante</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Veeramachaneni</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Modeling tabular data using conditional gan</article-title>
          .
          <source>In: Advances in Neural Information Processing Systems</source>
          . pp.
          <volume>7335</volume>
          {
          <issue>7345</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Yoon</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Drumright</surname>
            ,
            <given-names>L.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Van Der Schaar</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Anonymization through data synthesis using generative adversarial networks (ads-gan)</article-title>
          .
          <source>IEEE Journal of Biomedical and Health Informatics</source>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>