<!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>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Modelling⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Extended Abstract</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Politecnico di Bari</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Italy</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Matteo Attimonelli</string-name>
          <email>matteo.attimonelli@poliba.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Claudio Pomo</string-name>
          <email>claudio.pomo@poliba.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dietmar Jannach</string-name>
          <email>dietmar.jannach@aau.at</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tommaso Di Noia</string-name>
          <email>tommaso.dinoia@poliba.it</email>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Fashion Recommendation, Compatibility Modeling, Generative Models</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Klagenfurt</institution>
          ,
          <country country="AT">Austria</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The rise in online fashion retail has led to increased research in fashion compatibility modeling and item retrieval. These technologies help users find fashion items based on text descriptions or reference images, focusing on how well items go together. However, retrieving complementary items is challenging due to the need for precise compatibility models. We propose the Compatibility-to-Retrieval Model (C2RM), which aims to improve fashion image retrieval using image-to-image translation. First, a Conditional Generative Adversarial Network generates target items from query items. Next, these generated samples are fed into C2RM, enhancing compatibility modeling and retrieval accuracy exploiting the first and second step. Evaluations on two datasets show C2RM's superior performance over current baselines.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
ceur-ws.org</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        In e-commerce, particularly within the fashion industry, there is a growing emphasis on
personalized and retrieval models due to the rising demand for custom recommendations [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ],
particularly those employing a multimodal approach [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Image retrieval systems, designed
to fetch items based on user queries through textual descriptions or reference images, have
advanced significantly. Complementary item retrieval [
        <xref ref-type="bibr" rid="ref3 ref4 ref5">3, 4, 5</xref>
        ], such as top-bottom retrieval,
requires an understanding of subjective and context-dependent fashion compatibility. However
traditional methods, inspired by learning-to-rank approaches, have shown limited performance.
To address these challenges, we propose the Compatibility-to-Retrieval Model (C2RM). First,
we use Conditional Generative Adversarial Networks (cGANs) to generate target samples
(templates) from seed items, providing conditioning signals for retrieval. Second, C2RM evaluates
item-item and item-template compatibility, enhancing accuracy and reducing data requirements.
Our extensive experiments on two datasets—FashionVC [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and ExpFashion [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]—demonstrate
C2RM’s superior performance.
⋆An extended version of this work is currently under review.
      </p>
    </sec>
    <sec id="sec-3">
      <title>2. Related Work</title>
      <p>
        Recent advances in fashion recommendation systems have significantly impacted e-commerce
by enhancing user experience and pushing sales. This growth is partially driven by enhanced
fashion item retrieval and recommendation research and advancing generative models.
Fashion Item Retrieval &amp; Recommendation. Fashion recommendation systems, thanks to
the economic benefits of e-commerce, focus on suggesting individual items or complete outfits.
To ofer personalized suggestions, fashion item recommendation [
        <xref ref-type="bibr" rid="ref10 ref8 ref9">8, 9, 10</xref>
        ] algorithms consider
user preferences, behaviors, demographics, and context. Outfit recommendation extends this by
creating cohesive ensembles, requiring a deep understanding of fashion aesthetics and trends.
Complementary item retrieval [
        <xref ref-type="bibr" rid="ref3 ref4 ref5">3, 4, 5</xref>
        ], particularly top-bottom retrieval, is challenging due to
the need for accurate compatibility modeling. Traditional approaches like BPR-DAE [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and
GP-BPR [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] often fail to generate novel yet compatible item combinations.
      </p>
      <p>
        Generative Models for Top-Bottom Retrieval. Generative models have been integrated into
retrieval systems to improve compatibility assessments. Notable examples include c+GAN [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]
and CRAFT [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], focusing on generating compatible bottoms given a top. Advanced methods
like DVBPR [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], FARM [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], and MGCM [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] leverage generative models to enhance retrieval
performance, though they often overlook the quality of the generated items.
      </p>
      <p>The C2RM model proposed in this work separates the training of generative and
compatibility modules, optimizing each with distinct loss functions to achieve stable convergence and
improved performance. This method advances the field by ensuring high-quality generation
and accurate compatibility assessments.</p>
    </sec>
    <sec id="sec-4">
      <title>3. Methodology</title>
      <p>
        This section presents our proposed Compatibility Modeling strategy for fashion item retrieval,
including two distinct phases. The first step is Template Generation: here we use an adapted
Pix2Pix [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] architecture to generate templates of a compatible bottom item dress for a given
input top dress, which is trained independently to perform an image-to-image translation task.
The second step is Compatibility Assessment: using the generated template and the input top as
a query, the C2RM model computes compatibility scores between the query and every other
bottom clothes in the dataset. These scores facilitate the ranking and retrieval of potential
matches.
      </p>
      <p>
        Template Generation. This step aims to learn the hidden relations between the top and
bottom distributions by adopting an image-to-image translation architecture to accomplish the
conditioning generation task and learn a mapping between the source and target distributions.
Specifically, the generative model is based on the Pix2Pix [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] architecture, which consists
of two primary components: a U-Net generator and a PatchGAN discriminator. The U-Net
generator acts as an autoencoder with skip-connections, which help to address the vanishing
gradient problem [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] during training. On the other hand, the PatchGAN [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] discriminator
produces a patch1 of a pre-defined size rather than a single scalar output, assessing which patch
of the image is realistic or fake.
      </p>
      <sec id="sec-4-1">
        <title>1A patch is a specific portion of the image of a pre-defined size.</title>
        <p>
          Compatibility-to-Retrieval Model. Our eforts focus on enhancing the quality of the
generated samples and increasing the size of the generated template images to assess whether these
improvements would also enhance compatibility modeling and the top-bottom retrieval tasks,
as better and more realistic generated images are expected to increase retrieval performance.
We designed the C2RM inspired by the work by Liu et al. [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. C2RM leverages the bottoms
generated by the cGAN, referred to as templates, for evaluating compatibility. Our model is built
upon a pretrained ResNet [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] backbone to extract and project features from the top, bottom,
and template images. To this end, we model compatibility as a combination of item-item and
item-template similarities. The item-item score refers to the similarity between the latent
representations of the top and candidate bottoms. Instead, the item-template compatibility focuses on
the absolute distance between the latent representations of the template and candidate bottoms.
        </p>
        <p>This approach ensures that item compatibility is evaluated accurately, enhancing retrieval
performance. To maximize the compatibility between positive top-bottom pairs, we evaluate
the compatibility scores as shown in Equation (1):
  =  ⋅ sim(  ,   ) +  ⋅ ‖  −   ‖1,   =  ⋅ sim(  ,   ) +  ⋅ ‖  −   ‖1
(1)
where   ,   , and   belong to  ≔ {(, , ) ∣ (  ,   ) ∈  ,   ∈  ⧵   }, and  represents the set
of all compatible pairs in the catalog.</p>
        <p>Thus, the loss function can be designed as Equation (2) where the strength of each component
in the overall loss ℒ is regulated by the hyperparameters  and  . Therefore, we define the BPR
loss as ℒbpr and the regularization component as ℒreg with   representing the parameters of
the C2RM model.</p>
        <p>ℒ =  ⋅ ℒ bpr +  ⋅ ℒ reg,
ℒbpr = − log  (  −   ),
ℒreg = ‖  ‖2
(2)</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>4. Experiments</title>
      <sec id="sec-5-1">
        <title>We conducted a benchmarking study on the</title>
        <p>
          FashionVC [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] and ExpFashion [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] datasets2 Table 1: Performance of the diferent
modto evaluate our model against various base- els. Boldface and underlined indicate best and
lines, namely BPR-DAE [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], MGCM [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], and second-to-best values.
        </p>
        <p>
          Pix2PixCM [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. Our main objective was to Model FashionVC ExpReduced
determine if the model meets the desired out- AUC MRR AUC MRR
comes as per selected metrics.
        </p>
        <p>We employ standard metrics for this kind C2RM 0.7209 0.0259 0.6952 0.0182
of purpose, namely Area Under the Curve MGCM 0.5939 0.0098 0.4674 0.0075
(AUC) and Mean Reciprocal Rank (MRR). Pix2PixCM 0.5000 0.0080 0.5136 0.0078
With the first one, we want to assess the per- BPR-DAE 0.6590 0.0200 0.6457 0.0130
formance of our compatibility model’s step. RANDOM 0.4908 0.0081 0.4908 0.0063
We compute the AUC considering each top
  with its positive bottom   and one negative bottom   . Regarding the MRR, we adopted it to
showcase the ranking performance of our model compared to other baselines. We compute MRR</p>
      </sec>
      <sec id="sec-5-2">
        <title>2For dataset configuration and splitting we refer to Liu et al. [ 16].</title>
        <p>by considering the position of the positive bottom   in the ranked list, where all other bottoms
in the test set are treated as negatives. Table 1 displays the results from our benchmark setup,
highlighting the performance of C2RM, which outperforms all other models across all datasets.
Notably, BPR-DAE stands out as the second-best performer, showing a significant margin over
other models on the FashionVC and ExpFashion datasets. This suggests simpler models such
as BPR-DAE are highly competitive on smaller datasets like FashionVC and ExpFashion. This
eficacy is further evidenced by the poor performance of MGCM and Pix2PixCM.</p>
        <p>Figure 1 illustrates the generation process of our model
in detail. In this example, a t-shirt (top) is fed to the cGAN,
generating a corresponding pant (bottom). The generated
(a) Conditioning tops. souurtppaustsdinegmtohnestrreastuelstshpigrhodquucaelditybyanmdordeeallsissmu,cshigansificManGtClyM
and Pix2PixCM3. This high-fidelity generation confirms that
our approach efectively leverages the full information
content and superior quality of the generated items, leading to
(b) Ground-truth bottoms. notable improvements in compatibility, as measured by the
AUC, and in retrieval performance, as indicated by the MRR.</p>
        <p>The enhanced generation quality underscores the robustness
and efectiveness of our model in practical applications.
(c) Generated bottoms with the
proposed Generative Model.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>5. Conclusions</title>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>
        This work has been carried out while Matteo Attimonelli was enrolled in the Italian National
Doctorate on Artificial Intelligence run by Sapienza University of Rome in collaboration with
Politecnico Di Bari. This work was partially supported by the following projects:
CT_FINCONS_III, OVS Fashion Retail Reloaded, LUTECH DIGITALE 4.0, VAI2C, IDENTITA,
REACHXY. We acknowledge the CINECA award under the ISCRA initiative, for the availability of
high-performance computing resources and support.
3Due to space constraints, we show only our generated images. See [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] for a baseline comparison.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Deldjoo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Nazary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramisa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. J.</given-names>
            <surname>McAuley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Pellegrini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bellogín</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. Di</given-names>
            <surname>Noia</surname>
          </string-name>
          ,
          <article-title>A review of modern fashion recommender systems</article-title>
          ,
          <source>ACM Comput. Surv</source>
          .
          <volume>56</volume>
          (
          <year>2024</year>
          )
          <volume>87</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>87</lpage>
          :
          <fpage>37</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Attimonelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Danese</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Malitesta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pomo</surname>
          </string-name>
          , G. Gassi,
          <source>T. Di Noia, Ducho</source>
          <volume>2</volume>
          .
          <article-title>0: Towards a more up-to-date unified framework for the extraction of multimodal features in recommendation, in: WWW (Companion Volume)</article-title>
          , ACM,
          <year>2024</year>
          , pp.
          <fpage>1075</fpage>
          -
          <lpage>1078</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>K.</given-names>
            <surname>Bibas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. S.</given-names>
            <surname>Shalom</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jannach</surname>
          </string-name>
          ,
          <article-title>Semi-supervised adversarial learning for complementary item recommendation</article-title>
          , in: WWW, ACM,
          <year>2023</year>
          , pp.
          <fpage>1804</fpage>
          -
          <lpage>1812</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Hao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. L.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Faloutsos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          , P-companion:
          <article-title>A principled framework for diversified complementary product recommendation</article-title>
          , in: CIKM, ACM,
          <year>2020</year>
          , pp.
          <fpage>2517</fpage>
          -
          <lpage>2524</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A. S.</given-names>
            <surname>Rodríguez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. J. C.</given-names>
            <surname>Pampín</surname>
          </string-name>
          ,
          <article-title>Session-based complementary fashion recommendations</article-title>
          , CoRR abs/
          <year>1908</year>
          .08327 (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>X.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Nie</surname>
          </string-name>
          , J. Ma, Neurostylist:
          <article-title>Neural compatibility modeling for clothing matching</article-title>
          ,
          <source>in: ACM Multimedia, ACM</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>753</fpage>
          -
          <lpage>761</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ren</surname>
          </string-name>
          , J. Ma, M. de Rijke,
          <article-title>Explainable outfit recommendation with joint outfit matching and comment generation</article-title>
          ,
          <source>IEEE TKDE 32</source>
          (
          <year>2020</year>
          )
          <fpage>1502</fpage>
          -
          <lpage>1516</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>R.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. J. McAuley</surname>
          </string-name>
          ,
          <article-title>VBPR: visual bayesian personalized ranking from implicit feedback</article-title>
          , in: AAAI, AAAI Press,
          <year>2016</year>
          , pp.
          <fpage>144</fpage>
          -
          <lpage>150</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Deepstyle: Learning user preferences for visual recommendation</article-title>
          , in: SIGIR, ACM,
          <year>2017</year>
          , pp.
          <fpage>841</fpage>
          -
          <lpage>844</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Nie</surname>
          </string-name>
          , W. Liu, T. Chua,
          <article-title>Attentive collaborative filtering: Multimedia recommendation with item- and component-level attention</article-title>
          , in: SIGIR, ACM,
          <year>2017</year>
          , pp.
          <fpage>335</fpage>
          -
          <lpage>344</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>X.</given-names>
            <surname>Song</surname>
          </string-name>
          , X. Han,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Nie</surname>
          </string-name>
          ,
          <article-title>GP-BPR: personalized compatibility modeling for clothing matching</article-title>
          ,
          <source>in: ACM Multimedia, ACM</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>320</fpage>
          -
          <lpage>328</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kumar</surname>
          </string-name>
          , M. D. Gupta, c+gan:
          <article-title>Complementary fashion item recommendation</article-title>
          , CoRR abs/
          <year>1906</year>
          .05596 (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>C. P.</given-names>
            <surname>Huynh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ciptadi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tyagi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Agrawal</surname>
          </string-name>
          ,
          <article-title>CRAFT: complementary recommendations using adversarial feature transformer</article-title>
          , CoRR abs/
          <year>1804</year>
          .10871 (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>W.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. J. McAuley</surname>
          </string-name>
          ,
          <article-title>Visually-aware fashion recommendation and design with generative image models</article-title>
          ,
          <source>in: ICDM, IEEE Computer Society</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>207</fpage>
          -
          <lpage>216</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ren</surname>
          </string-name>
          , J. Ma, M. de Rijke,
          <article-title>Improving outfit recommendation with co-supervision of fashion generation</article-title>
          , in: WWW, ACM,
          <year>2019</year>
          , pp.
          <fpage>1095</fpage>
          -
          <lpage>1105</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          , J. Ma,
          <article-title>MGCM: multi-modal generative compatibility modeling for clothing matching</article-title>
          ,
          <source>Neurocomputing</source>
          <volume>414</volume>
          (
          <year>2020</year>
          )
          <fpage>215</fpage>
          -
          <lpage>224</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>P.</given-names>
            <surname>Isola</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Efros</surname>
          </string-name>
          ,
          <article-title>Image-to-image translation with conditional adversarial networks</article-title>
          ,
          <source>in: CVPR, IEEE Computer Society</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>5967</fpage>
          -
          <lpage>5976</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>R.</given-names>
            <surname>Pascanu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Mikolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <article-title>On the dificulty of training recurrent neural networks</article-title>
          , volume
          <volume>28</volume>
          <source>of JMLR Workshop and Conference Proceedings</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>1310</fpage>
          -
          <lpage>1318</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>K.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , S. Ren,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <article-title>Deep residual learning for image recognition</article-title>
          ,
          <source>in: CVPR, IEEE Computer Society</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>770</fpage>
          -
          <lpage>778</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>