<!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>Fashion Outfit Generation for E-commerce</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Odysseas Zisimopoulos ASOS.com London</string-name>
          <email>ben.chamberlain@asos.com</email>
          <email>elaine.bettaney@asos.com</email>
          <email>stephen.hardwick@asos.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>UK odysseas.zisimopoulos@asos.com</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Benjamin Paul Chamberlain ASOS.com London</institution>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Elaine M. Bettaney ASOS.com London</institution>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Stephen R. Hardwick ASOS.com London</institution>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <abstract>
        <p>Combining items of clothing into an outfit is a major task in fashion retail. Recommending sets of items that are compatible with a particular seed item is useful for providing users with guidance and inspiration, but is currently a manual process that requires expert stylists and is therefore not scalable or easy to personalise. We use a multilayer neural network fed by visual and textual features to learn embeddings of items in a latent style space such that compatible items of diferent types are embedded close to one another. We train our model using the ASOS outfits dataset, which consists of a large number of outfits created by professional stylists and which we release to the research community. Our model shows strong performance in an ofline outfit compatibility prediction task. We use our model to generate outfits and for the first time in this field perform an AB test, comparing our generated outfits to those produced by a baseline model which matches appropriate product types but uses no information on style. Users approved of outfits generated by our model 21% and 34% more frequently than those generated by the baseline model for womenswear and menswear respectively.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>User needs based around outfits include answering questions such
as "What trousers will go with this shirt?", "What can I wear to a
party?" or "Which items should I add to my wardrobe for summer?".
The key to answering these questions requires an understanding
of style. Style encompasses a broad range of properties including
but not limited to, colour, shape, pattern and fabric. It may also
incorporate current fashion trends, user’s style preferences and an
awareness of the context in which the outfits will be worn. In the
growing world of fashion e-commerce it is becoming increasingly
important to be able to fulfill these needs in a way that is scalable,
automated and ultimately personalised.</p>
      <p>This paper describes a system for Generating Outfit
Recommendations from Deep Networks (GORDN) under development
at ASOS.com. ASOS is a global e-commerce company focusing on
fashion and beauty. With approximately 87,000 products on site at
any one time, it is dificult for customers to perform an exhaustive
search to find products that can be worn together. Each fashion
product added to our catalogue is photographed on a model as part
of an individually curated outfit of compatible products chosen
by our stylists to create images for its Product Description Page
(PDP). The products comprising the outfit are then displayed to the
customer in a Buy the Look (BTL) carousel (Figure 1). This ofering
however is not scalable as it requires manual input for every outfit.
We aim to learn from the information encoded in these outfits to
automatically generate an unlimited number of outfits.</p>
      <p>A common way for people to compose outfits is to rfist pick
a seed item, such as a patterned shirt, and then find other
compatible items. We focus on this task: completing an outfit based
on a seed item. This is useful in an e-commerce setting as outfit
suggestions can be seeded with a particular product page or a user’s
past purchases. Our ASOS outfits dataset comprises a set of outfits
originating from BTL carousels on PDPs. These contain a seed, or
‘hero product’, which can be bought from the PDP. All other items
in the outfit we refer to as ‘styling products’.</p>
      <p>There is an asymmetry between hero and styling products. Whilst
all items are used as hero products (in an e-commerce setting),
styling products are selected as the best matches for the hero
product and this matching is directional. For example when the hero
product is a pair of Wellington boots it may create an engaging
outfit to style them with a dress. However if the hero product is a
dress then it is unlikely a pair of Wellington boots would be the best
choice of styling product to recommend. Hence in general styling
products tend to be more conservative than hero products. Our
approach takes this diference into account by explicitly including
this information as a feature.</p>
      <p>We formulate our training task as binary classification, where
GORDN learns to tell the diference between BTL and randomly
generated negative outfits. We consider an outfit to be a set of
fashion items and train a model that projects items into a single
style space. Compatible items will appear close in style space
enabling good outfits to be constructed from nearby items. GORDN
is a neural network which combines embeddings of multi-modal
features for all items in an outfit and outputs a single score. When
generating outfits, GORDN is used as a scorer to assess the validity
of diferent combinations of items.</p>
      <p>In summary, our contributions are:
(1) A novel model that uses multi-modal data to generate outfits
that can be trained on images in the wild i.e. dressed people
rather than individual item flat shots. Outfits generated by
our model outperform a challenging baseline by 21% for
womenswear and 34% for menswear.
(2) A new research dataset consisting of 586,320 fashion outfits
(images and textual descriptions) composed by ASOS stylists.
This is the world’s largest annotated outfit dataset and is the
ifrst to contain Menswear items.
2</p>
    </sec>
    <sec id="sec-2">
      <title>RELATED WORK</title>
      <p>
        Our work follows an emerging body of related work on learning
clothing style [
        <xref ref-type="bibr" rid="ref11 ref24">11, 24</xref>
        ], clothing compatibility [
        <xref ref-type="bibr" rid="ref18 ref20 ref24">18, 20, 24</xref>
        ] and outfit
composition [
        <xref ref-type="bibr" rid="ref10 ref23 ref4 ref7">4, 7, 10, 23</xref>
        ]. Successful outfit composition
encompasses an understanding of both style and compatibility.
      </p>
      <p>
        A popular approach is to embed items in a latent style or
compatibility space often using multi-modal features [
        <xref ref-type="bibr" rid="ref10 ref20 ref21 ref24">10, 20, 21, 24</xref>
        ].
A challenge with this approach is how to use item embeddings to
measure the overall outfit compatibility. This challenge is increased
when considering outfits of multiple sizes. Song et al. [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] only
consider outfits of size 2 made of top-bottom pairs. Veit et al. [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]
use a Siamese CNN, a technique which allows only consideration
of pairwise compatibilities. Li et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] combine text and image
embeddings to create multi-modal item embeddings which are then
combined using pooling to create an overall outfit representation.
104
      </p>
      <p>As hero product
As styling product
100
101
102</p>
      <p>103
Rank
104</p>
      <p>
        Pooling allows them to consider outfits of variable size. Tangseng
et al. [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] create item embeddings solely from images. They are able
to use outfits of variable size by padding their set of item images to
a fixed length with a ‘mean image’. Our method is similar to these
as we combine multi-modal item embeddings, however we aim not
to lose information by pooling or padding.
      </p>
      <p>
        Vasileva et al. [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] extend this concept by noting that
compatibility is dependent on context - in this case the pair of clothing
types being matched. They create learned type-aware projections
from their style space to calculate compatibility between diferent
types of clothing.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>OUTFIT DATASETS</title>
      <p>The ASOS outfits dataset consists of 586,520 outfits, each containing
between 2 and 5 items (see Table 1). In total these outfits contain
591,725 unique items representing 18 diferent womenswear (WW)
product types and 22 diferent menswear (MW) product types. As
all of our outfits have been created by ASOS stylists, they are
representative of a particular fashion style.</p>
      <p>
        Most previous outfit generators have used either co-purchase
data from Amazon [
        <xref ref-type="bibr" rid="ref12 ref24">12, 24</xref>
        ] or user created outfits taken from
Polyvore [
        <xref ref-type="bibr" rid="ref10 ref14 ref20 ref21 ref23 ref4 ref5">4, 5, 10, 14, 20, 21, 23</xref>
        ], both of which represent a
diverse range of styles and tastes. Co-purchase is not a strong signal
of compatibility as co-purchased items are typically not bought
with the intention of being worn together. Instead it is more likely
to reflect a user’s style preference. Data collected from Polyvore
gives a stronger signal of compatibility and furthermore provide
complete outfits.
      </p>
      <p>
        The largest previously available outfits dataset was collected
from Polyvore and contained 68,306 outfits and 365,054 items
entirely from WW [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. Our dataset is the first to contain MW as
well. Our WW dataset contains an order of magnitude more outfits
than the Polyvore set, but has slightly fewer fashion items. This is
a consequence of ASOS stylists choosing styling products from a
subset of items held in our studios meaning that styling products
can appear in many outfits.
      </p>
      <p>For each item we have four images, a text title and
description, a high-level product type and a product category. We process
both the images and the text title and description to obtain
lowerdimensional embeddings, which are included in this dataset
alongside the raw images and text to allow full reproducibility of our
work. The methods used to extract these embeddings are described
in Sections 4.3 and 4.4, respectively. Although we have four images
for each item, in these experiments we only use the first image as
it consistently shows the entire item, from the front, within the
context of an outfit, whilst the other images can focus on close
ups or diferent angles, and do not follow consistent rules between
product types.
4</p>
    </sec>
    <sec id="sec-4">
      <title>METHODOLOGY</title>
      <p>
        Our approach uses a deep neural network. We acknowledge some
recent approaches that use LSTM neural networks [
        <xref ref-type="bibr" rid="ref14 ref4">4, 14</xref>
        ]. We have
not adopted this approach because fundamentally an outfit is a set of
fashion items and treating it as a sequence is an artificial construct.
LSTMs are also designed to progressively forget past items when
moving through a sequence which in this context would mean that
compatibility is not enforced between all outfit items.
      </p>
      <p>
        We consider an outfit to be a set of fashion items of arbitrary
length which match stylistically and can be worn together. In order
for the outfit to work, each item must be compatible with all other
items. Our aim is to model this by embedding each item into a
latent space such that for two items (Ii , Ij ) the dot product of their
embeddings (zi , zj ) reflects their compatibility. We aim for the
embeddings of compatible items to have large dot products and
the embeddings of items which are incompatible to have small dot
products. We map input data for each item Ii to its embedding zi via
a multi-layer neural network. As we are treating hero products and
styling products diferently, we learn two embeddings in the same
space for each item; one for when the item is the hero product,
z(h) and one for when the item is a styling product, zi(s); which
i
is reminiscent of the context specific representations in language
modelling [
        <xref ref-type="bibr" rid="ref13 ref15">13, 15</xref>
        ].
4.1
      </p>
    </sec>
    <sec id="sec-5">
      <title>Network Architecture</title>
      <p>
        For each item, the inputs to our network are a textual title and
description embedding (1024 dimensions), a visual embedding (512
dimensions), a pre-trained GloVe embedding [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] for each product
category (50 dimensions) and a binary flag indicating the hero
product. First, each of the three input feature vectors is passed
through their own fully connected ReLU layer. The outputs from
these layers, as well as the hero product flag, are then concatenated
and passed through two further fully connected ReLU layers to
produce an item embedding with 256 dimensions (Figure 3). We use
batch normalization after each fully connected layer and a dropout
rate of 0.5 during training.
      </p>
      <p>
        For an outfit S = {I1, I2, ..., IN } consisting of N items, the overall
outfit score is defined by
where σ is the sigmoid function. The normalisation factor of N (N −
1), proportional to the number of pairs of items in the outfit is
required to deal with outfits containing varying numbers of items.
The sigmoid function is used to ensure the output is in the range
[
        <xref ref-type="bibr" rid="ref1">0,1</xref>
        ].
4.3
      </p>
    </sec>
    <sec id="sec-6">
      <title>Visual Feature Extraction</title>
      <p>
        As described in Section 1 and illustrated in Figure 1, items are
photographed as part of an outfit and therefore our item images
frequently contain the other items from the BTL outfit. Feeding
the whole image to the network would result in features capturing
information for the entire input leaking information to GORDN. It
was therefore necessary to localise the target item within the image.
To extract visual features from the images in our dataset we use
VGG [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. Feeding the whole image to the network would result in
features capturing information for the entire input, that is both the
hero and the styling products. To extract features focused on the
most relevant areas of the image, we adopt an approach based on
Class Activation Mapping (CAM) [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. Weakly-supervised object
localisation is performed by calculating a heatmap (CAM) from
the feature maps of the last convolutional layer of a CNN, which
highlights the discriminative regions in the input used for image
classification. The CAM is calculated as a linear combination of the
feature maps weighted by the corresponding class weights.
      </p>
      <p>
        Before using the CAM model to extract image features, we
finetune it on our dataset. Similar to [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] our model architecture
combines VGG with a Global Average Pooling (GAP) layer and an output
classification layer. We initialize VGG with weights pre-trained on
ImageNet and fine-tune it towards product type classification (e.g.
Jeans, Dresses, etc.). After training we pass each image to the VGG
and obtain the feature maps.
      </p>
      <p>
        To produce localised image embeddings, we use the CAM to
spatially re-weight the feature maps. Similar to Jimenez et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ],
we perform the re-weighting by a simple spatial element-wise
multiplication of the feature maps with the CAM. Our pipeline is shown
in Figure 5. This re-weighting can be seen as a form of attention
mechanism on the area of interest in the image. The final image
embedding is a 512-dimensional vector. The same figure illustrates
the efect of the re-weighting mechanism on the feature maps.
4.4
      </p>
    </sec>
    <sec id="sec-7">
      <title>Title and Description Embeddings</title>
      <p>
        Product titles typically contain important information, such as the
brand and colour. Similarly, our text descriptions contain details
such as the item’s fit, design and material. We use pre-trained text
embeddings of our item’s title and description. These embeddings
are learned as part of an existing ASOS production system that
predicts product attributes [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Vector representations for each
word are passed through a simple 1D convolutional layer, followed
by a max-over-time pooling layer and finally a dense layer, resulting
in 1024 dimensional embeddings.
4.5
      </p>
    </sec>
    <sec id="sec-8">
      <title>Training</title>
      <p>
        We train GORDN in a supervised manner using a binary
crossentropy loss. Our training data consists of positive outfit samples
taken from the ASOS outfits dataset and randomly generated
negative outfit samples. We generate negative samples for our training
and test sets by randomly replacing the styling products in each
outfit with another item of the same type. For example, for an
outift with a top as the hero product and jeans and shoes as styling
products, we would create a negative sample by replacing the jeans
and shoes with randomly sampled jeans and shoes. We ensure that
styling products appear with the same frequency in the positive
and negative samples by sampling styling products from their
distribution in the positive samples. This is important as the frequency
distribution of styling products is heavily skewed (Figure 2) and
without preserving this GORDN could memorise frequently
occurring items and predict outfit compatibility based on their presence.
By matching the distribution GORDN must instead learn the
characteristics of items which lead to compatibility. Although some of the
negative outfits generated in this way may be good quality outfits,
we assume that the majority of these randomly generated outfits
will contain incompatible item combinations. Randomly selecting
negative samples in this way is common practice in metric learning
and ranking problems (e.g. [
        <xref ref-type="bibr" rid="ref16 ref6">6, 16</xref>
        ]). In both training and testing, we
generate one negative outfit sample for each positive outfit sample.
      </p>
      <p>To assess the relative importance of each set of input features,
we conduct an ablation study. We separately train five diferent
versions of GORDN using only the textual title and description
VGG</p>
      <p>CAM
...
...</p>
      <p>GAP
...
...</p>
      <p>...</p>
      <p>
        ...
embeddings as input (text), only the visual embeddings (vis), both
text and visual embeddings (text + vis), text, visual and category
embeddings (text + vis + cat), and finally the full set of inputs (text
+ vis + cat + hero). For each of these configurations we trained 20
models from scratch using Adam [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] for 30 epochs.
4.6
      </p>
    </sec>
    <sec id="sec-9">
      <title>Outfit Generation Method</title>
      <p>Once trained, GORDN can generate novel outfits of any length by
sequentially adding items and re-scoring the new outfit. Each outfit
starts with a hero product from our catalogue. We then define an
outfit template P = {T (h),T1, ...,TN −1} as a set of product types
including the hero product type T (h) and N − 1 other compatible
styling product types. Our aim is to find the set of items of the
appropriate product types that maximises the outfit score y.</p>
      <p>
        An exhaustive search over every possible combination of styling
products cannot be computed within a reasonable e-commerce
latency budget. Instead, we map the maximum inner product search
in Equation 1 to a Euclidean nearest neighbour problem that is
solved approximately and combine this with a beam search
(illustrated in Figure 6). The approximate nearest neighbours algorithm
uses a PCA-tree that has been adapted for recommendations
problems [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. We use a beam width of three because it returned the
optimal outfit 77.5% of the time. The beam search algorithm is
repeated for all (N − 1)! permutations of the styling product types in
the template as diferent outfits may be generated depending on the
order in which product types are added. The outfit returned is the
one that has the maximal score across all template permutations.
For each step of the beam search, we calculate the resultant vector
of the partial outfit and find the w approximate nearest neighbours
from the product catalogue (where w is the beam width). With each
step searching through 2000-5000 products we achieved a ten times
speed up in outfit generation whilst still maintaining a precision@5
of over 80%.
      </p>
      <p>The choice of template P depends on the use case. Templates for
each hero product type can be found from our ASOS outfits dataset.
The distribution of templates can be used to introduce variety into
the generated outfits. For the purposes of our AB test, we picked
the most frequently occurring template for each hero product type.</p>
    </sec>
    <sec id="sec-10">
      <title>5 EVALUATION</title>
      <p>We evaluate the performance of GORDN on two tasks. The first task
is binary classification of genuine and randomly generated outfits,
using a held out test set. The second task is user evaluation of outfits
generated by GORDN in comparison to randomly generated outfits
from a simple baseline model.
5.1</p>
    </sec>
    <sec id="sec-11">
      <title>Train/test split</title>
      <p>We split the ASOS outfits dataset first into WW and MW and each
of these into a training and test set ensuring that no items appeared</p>
      <sec id="sec-11-1">
        <title>Skirts WW</title>
      </sec>
      <sec id="sec-11-2">
        <title>Tops WW</title>
      </sec>
      <sec id="sec-11-3">
        <title>Shoes WW</title>
        <p>
          Bags WW
in both sets. To achieve this we first represented the ASOS outfits
dataset as a graph where the nodes are items and edge weights are
defined by the number of outfits pairs of items are found together
in. We then used the Louvain community detection method [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] to
split the graph into communities which maximise the modularity.
This resulted in many small communities which could then be
combined together to create the train and test sets. When re-combining
communities care was taken firstly to respect the desired train-test
split ratio as far as possible and secondly to ensure items from
each season are proportionally split between the train and test sets.
This resulted in 76:24 and 74:26 train-test splits in terms of outfits
for WW and MW respectively. The use of disjoint train and test
sets provides a sterner test for GORDN as it is unable to simply
memorise which items frequently co-occur in outfits in the training
set. Instead, the embeddings GORDN learns must represent product
attributes that contribute to fashion compatibility.
5.2
        </p>
      </sec>
    </sec>
    <sec id="sec-12">
      <title>Outfit Classification Results</title>
      <p>The test set contains BTL outfits and an equal number of negative
samples. We use GORDN to predict compatibility scores for the
test set outfits and then calculate the AUC of the ROC curve. We
found that training separate versions of GORDN for WW and MW
produced better results and so we report the performance of these
here.</p>
      <p>
        Table 3 shows the AUC scores achieved for diferent
combinations of features. As we add features to GORDN we increase its
performance, with the best performing model including text, visual,
category and hero item features. The majority of the performance
benefit came from the text embeddings with visual embeddings
adding a small improvement. We expected our visual embeddings
to be of poorer quality than those for Polyvore datasets as our
images show whole outfits on people as opposed to a photograph
of the fashion item in isolation. In contrast the success of our text
embeddings could be due to the attribution task on which they
were trained [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. A total of 34 attributes were predicted, including
many attributes that are directly applicable for outfit composition
e.g. ‘pattern’, ‘neckline’, ‘dress type’ and ‘shirt style’.
      </p>
      <p>For all feature combinations the WW model greatly outperforms
the MW one. This could be due to fashion items being more
interchangeable in MW than in WW hence having more similar
embeddings making the training task harder. For example the mean
correlations between the text embeddings for the most prevalent
product type in the WW and MW training sets are 0.041 (dresses)
and 0.077 (T-shirts) respectively. More simply, there are many
combinations of MW T-shirts and jeans that make equally acceptable
outfits whereas there are far fewer for WW dresses and shoes.</p>
      <p>
        Using GORDN to predict compatibility scores for our test set
is equivalent to the outfit compatibility task used by [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ].
As noted by Vasileva et al., Han’s negative samples contain outfits
that are incompatible due to multiple occurrences of product types
e.g. multiple pairs of shoes in the same outfit. Since our negative
      </p>
      <sec id="sec-12-1">
        <title>ASOS Outfit Generator Feedback</title>
      </sec>
      <sec id="sec-12-2">
        <title>Tops</title>
      </sec>
      <sec id="sec-12-3">
        <title>Jeans</title>
      </sec>
      <sec id="sec-12-4">
        <title>Shoes</title>
        <p>
          samples were generated using templates respecting product type
our data does not have this characteristic and hence we compare
only to results in [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. Our WW model achieves an AUC score
just slightly less than Vasileva et al.’s compatibility AUC on their
disjoint Polyvore outfits dataset.
        </p>
      </sec>
    </sec>
    <sec id="sec-13">
      <title>5.3 Generated Outfit Evaluation</title>
      <p>We perform an AB test to evaluate the quality of outfits generated
by GORDN. We select six popular outfit templates to test, three
each for WW and MW (shown in Table 4), and generate 100 WW
and 100 MW outfits split evenly across the templates. We use a
large pool of in stock products from which we randomly select hero
products of the required product types. The remaining items in the
outfits were generated using the beam search method described
in Section 4.6 and illustrated in Figure 6. These outfits constitute
our test group. For a control group we take the same hero products
and templates and generate outfits by randomly selecting items of
the correct type from the same pool of products. By using outfit
templates we ensure that none of the outfits contain incompatible
product type combinations, such as by pairing a dress and a skirt,
or by placing two pairs of shoes in one outfit. Instead, the quality
of the outfits depends solely on style compatibility between items.</p>
      <p>To run the AB test we developed an internal app which we
exposed to ASOS employees. A screenshot of the app is shown
in Figure 7. The app displayed an outfit to the user asking them
to decide if the items in the outfit work stylistically. The outfits
were shown one at a time to each user with the order of outfits
randomised for each user. WW and MW outfits were only shown
to female and male users respectively and each user rated all 200
outfits from their corresponding gender.</p>
      <p>
        The data collected from the app comprised a binary score for
each user-outfit pair. The data exhibit two way correlation — all
scores from the same user are correlated due to the inherent user
preferences and all scores on the same outfit are also correlated. We
therefore used a two-way random efects model as described in [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]
to calculate the variance of the sample mean. We could then use a
t-test for the diference between means to calculate if the diference
between the test and control groups was significant.
      </p>
      <p>GORDN
 Randomly Generated
Rol a's Logo</p>
      <p>T-Shirt</p>
      <p>Lee Scarlett
Skinny Jeans</p>
      <p>Vans Authentic
Classic Black
Mono Lace Up</p>
      <p>Trainers</p>
      <p>Rol a's Logo</p>
      <p>T-Shirt</p>
      <p>Faith Fringe</p>
      <p>Chain Loafer
ASOS DESIGN
Rivington high
waisted jeggings
in smokey grey
wash
Mads Norgaard
Gingham Skater</p>
      <p>Skirt</p>
      <p>Esprit Bardot
Stripe Tie
Sleeve Top</p>
      <p>ALDO T Bar
Sandal with
Diamante Gems</p>
      <p>GMinagdhsSaNmkoirrtSgkaaatredr ASfbrOilloSusshDeoEuwSlditIheGrN TruSfHflpeeikeCel oBSloteuocdttion
AX Paris ruched
velvet mini dress</p>
      <p>Public Desire Winona
Embel ished Block
Heeled Sandals</p>
      <p>AX Paris ruched
velvet mini dress</p>
      <p>Nike Running Epic
React Trainers In Black
fictwAosethStdoiOrdntSiinninDgsoEurfefSpgweIuGrh laNfiitrnee MSTkorisnoCsnuhyLseoeScnrkmdInoanrt WInAithSBOMlaSecktLaSolSaufenedaresffle
fictwAosethStdoiOrdntSiinninDgsoEurfefpSgweIuGrh laNfiitrnee sCtkrasoOitudeLserLefiUsrtstSrciwIphOeeitNhck</p>
      <p>PS Paul Smith
Kirk dino print
canvas hi-tops
in white
Rti-nsefsahcpiclriaerteimwidlieutohdsv treVraariinstniiotbzanoegwde SCmanraihtvhayrjetrtiagWnidIiPn</p>
      <p>Vans x Mickey
Mouse SK8-Hi
trainers in navy</p>
      <p>Reclaimed Vintage Bershka Skinny ASOS DESIGN
ti-nsfsahpicriertewidliutohsv treraaristniiobznoewd JeansB InlaWckashed ntraavinyebrlso cink
ACSSaOhmoSrotSWPkriinitnhnty GTyW-mSitShhKilreiCntegIonvneMNtsruaassvctyle TraPinQuemuriasckITnrMiGmUrmeen
ACSSaOhmoSrotSWPkriinitnhnty mAwSusitOslhocSgdleaiDcnfitEitpoStrn-isInaGhtriyNrt LRoeadfeLTreasapItenheTBrarsoswenl
random examples appear to be reasonable outfits. Although the
random model is simple, the use of outfit templates, combined with
selecting only products that were in stock in the ASOS catalogue
on the same day makes this a challenging baseline.
5.4</p>
    </sec>
    <sec id="sec-14">
      <title>Style space</title>
      <p>
        We visualise our style space using a t-Distributed Stochastic
Neighbour Embedding (t-SNE) [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] plot in two dimensions (Figure 9a).
While similar items have similar embeddings, we can also see that
compatible items of diferent product types have similar
embeddings. Rather than dresses and shoes being completely separate
in style space, these product types overlap, with casual dresses
having similar embeddings to casual shoes and occasion dresses
having similar embeddings to occasion shoes. We built an app for
internal use that uses t-SNE to visualise our style space and allows
us to easily explore compatible item combinations, as predicted by
GORDN (Figure 9b).
6
      </p>
    </sec>
    <sec id="sec-15">
      <title>CONCLUSION</title>
      <p>We have described GORDN, a multi-modal neural network for
generating outfits of fashion items, currently under development at
ASOS. GORDN learns to represent items in a latent style space, such
that compatible items of diferent types have similar embeddings.
GORDN is trained on the ASOS outfits dataset, a new resource
for the research community which contains over 500,000 outfits
curated by professional stylists. The results of an AB test show that
users approve of outfits generated by GORDN 21% and 34% more
frequently than those generated by a simple baseline model for
womenswear and menswear, respectively.
ASOS Style Space Explorer
Select product types to include:</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Yoram</given-names>
            <surname>Bachrach</surname>
          </string-name>
          , Yehuda Finkelstein, Ran Gilad-Bachrach, Liran Katzir, Noam Koenigstein, Nir Nice, and
          <string-name>
            <given-names>Ulrich</given-names>
            <surname>Paquet</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Speeding up the xbox recommender system using a euclidean transformation for inner-product spaces</article-title>
          .
          <source>In Proceedings of the 8th ACM Conference on Recommender systems. ACM</source>
          ,
          <volume>257</volume>
          -
          <fpage>264</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Vincent</surname>
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Blondel</surname>
          </string-name>
          ,
          <string-name>
            <surname>Jean-Loup</surname>
            <given-names>Guillaume</given-names>
          </string-name>
          , Renaud Lambiotte, and
          <string-name>
            <given-names>Etienne</given-names>
            <surname>Lefebvre</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Fast unfolding of communities in large networks</article-title>
          .
          <source>J. Stat. Mech</source>
          (
          <year>2008</year>
          ),
          <fpage>1</fpage>
          -
          <lpage>12</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Ângelo</given-names>
            <surname>Cardoso</surname>
          </string-name>
          , Fabio Daolio, and
          <string-name>
            <given-names>Saúl</given-names>
            <surname>Vargas</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Product Characterisation towards Personalisation</article-title>
          .
          <source>In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining - KDD '18</source>
          .
          <fpage>80</fpage>
          -
          <lpage>89</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Xintong</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <surname>Zuxuan Wu</surname>
          </string-name>
          ,
          <string-name>
            <surname>Yu-Gang Jiang</surname>
          </string-name>
          , and
          <string-name>
            <surname>Larry</surname>
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Davis</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Learning Fashion Compatibility with Bidirectional LSTMs</article-title>
          .
          <source>Proceedings of the 2017 ACM on Multimedia Conference - MM '17</source>
          <volume>1</volume>
          (
          <issue>2017</issue>
          ),
          <fpage>1078</fpage>
          -
          <lpage>1086</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Tong</given-names>
            <surname>He</surname>
          </string-name>
          and
          <string-name>
            <given-names>Yang</given-names>
            <surname>Hu</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>FashionNet: Personalized Outfit Recommendation with Deep Neural Network</article-title>
          . (
          <year>2018</year>
          ),
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Elad</given-names>
            <surname>Hofer</surname>
          </string-name>
          and
          <string-name>
            <given-names>Nir</given-names>
            <surname>Ailon</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Deep metric learning using triplet network</article-title>
          .
          <source>In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).</source>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Yang</surname>
            <given-names>Hu</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xi Yi</surname>
          </string-name>
          , and
          <string-name>
            <surname>Larry</surname>
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Davis</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Collaborative Fashion Recommendation: A Functional Tensor Factorization Approach</article-title>
          .
          <source>In Proceedings of the 23rd ACM international conference on Multimedia. Brisbane, Australia</source>
          ,
          <fpage>129</fpage>
          -
          <lpage>138</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Albert</surname>
            <given-names>Jimenez</given-names>
          </string-name>
          , Jose M. Alvarez, and
          <string-name>
            <surname>Xavier</surname>
          </string-name>
          Giro-i
          <string-name>
            <surname>Nieto</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Class-Weighted Convolutional Features for Visual Instance Search</article-title>
          .
          <source>In 28th British Machine Vision Conference (BMVC).</source>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Diederik</surname>
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Kingma</surname>
            and
            <given-names>Jimmy</given-names>
          </string-name>
          <string-name>
            <surname>Ba</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Adam: A Method for Stochastic Optimization</article-title>
          .
          <article-title>In Internationl Aconference for Learning Representations</article-title>
          . San Diego.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Yuncheng</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Liangliang</given-names>
            <surname>Cao</surname>
          </string-name>
          , Jiang Zhu, and
          <string-name>
            <given-names>Jiebo</given-names>
            <surname>Luo</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Mining fashion outfit composition using an end-to-end deep learning approach on set data</article-title>
          .
          <source>IEEE Transactions on Multimedia 19</source>
          ,
          <issue>8</issue>
          (
          <year>2017</year>
          ),
          <fpage>1946</fpage>
          -
          <lpage>1955</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Yihui</surname>
            <given-names>Ma</given-names>
          </string-name>
          , Jia Jia, Suping Zhou, Jingtian Fu, Yejun Liu, and
          <string-name>
            <given-names>Zijian</given-names>
            <surname>Tong</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Towards better understanding the clothing fashion styles: A multimodal deep learning approach</article-title>
          .
          <source>AAAI Conference on Artificial Intelligence</source>
          (
          <year>2017</year>
          ),
          <fpage>38</fpage>
          -
          <lpage>44</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Julian</surname>
            <given-names>McAuley</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Christopher</given-names>
            <surname>Targett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Qinfeng</given-names>
            <surname>Shi</surname>
          </string-name>
          , and Anton van den Hengel.
          <year>2015</year>
          .
          <article-title>Image-based Recommendations on Styles and Substitutes</article-title>
          .
          <source>In SIGIR Converence on Research and Development in Information Retrieval</source>
          .
          <fpage>43</fpage>
          -
          <lpage>52</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Tomas</surname>
            <given-names>Mikolov</given-names>
          </string-name>
          , Kai Chen, Greg Corrado, and
          <string-name>
            <given-names>Jefrey</given-names>
            <surname>Dean</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Distributed Representations of Words and Phrases and their Compositionality</article-title>
          .
          <source>In Neural Information Processing Systems</source>
          .
          <volume>3111</volume>
          -
          <fpage>3119</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Takuma</given-names>
            <surname>Nakamura</surname>
          </string-name>
          and
          <string-name>
            <given-names>Ryosuke</given-names>
            <surname>Goto</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Outfit Generation and Style Extraction via Bidirectional LSTM and Autoencoder</article-title>
          .
          <source>In The third international workshop on fashion and KDD.</source>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Jefrey</surname>
            <given-names>Pennington</given-names>
          </string-name>
          , Richard Socher, and
          <string-name>
            <given-names>Christopher</given-names>
            <surname>Manning</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Glove: Global Vectors for Word Representation</article-title>
          .
          <source>In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP).</source>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Stefen</surname>
            <given-names>Rendle</given-names>
          </string-name>
          , Christoph Freudenthaler, Zeno Gantner, and
          <string-name>
            <surname>Lars</surname>
          </string-name>
          Schmidt-Thieme.
          <year>2009</year>
          .
          <article-title>BPR: Bayesian Personalized Ranking from Implicit Feedback</article-title>
          .
          <source>In Conference on Uncertainty in Artificial Intelligence</source>
          , Vol.
          <volume>1120</volume>
          .
          <fpage>452</fpage>
          -
          <lpage>461</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Flâvio</surname>
            <given-names>Ribeiro</given-names>
          </string-name>
          , Dinei Florêncio, Cha Zhang, and
          <string-name>
            <given-names>Michael</given-names>
            <surname>Seltzer</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>CROWDMOS: An approach for crowdsourcing mean opinion score studies</article-title>
          .
          <source>In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. 2416-2419.</source>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Yong-Siang</surname>
            <given-names>Shih</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kai-Yueh</surname>
            <given-names>Chang</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hsuan-Tien Lin</surname>
            , and
            <given-names>Min</given-names>
          </string-name>
          <string-name>
            <surname>Sun</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Compatibility Family Learning for Item Recommendation and Generation</article-title>
          .
          <source>In AAAI Conference on Artificial Intelligence</source>
          .
          <fpage>2403</fpage>
          -
          <lpage>2410</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>K.</given-names>
            <surname>Simonyan</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Zisserman</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Very Deep Convolutional Networks for Large-Scale Image Recognition</article-title>
          .
          <source>CoRR abs/1409</source>
          .1556 (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Xuemeng</surname>
            <given-names>Song</given-names>
          </string-name>
          , Fuli Feng, Xianjing Han,
          <string-name>
            <given-names>Xin</given-names>
            <surname>Yang</surname>
          </string-name>
          , Wei Liu, and
          <string-name>
            <given-names>Liqiang</given-names>
            <surname>Nie</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Neural Compatibility Modeling with Attentive Knowledge Distillation</article-title>
          .
          <source>In SIGIR Conference on Research &amp; Development in Information Retrieval</source>
          .
          <fpage>5</fpage>
          -
          <lpage>14</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Pongsate</surname>
            <given-names>Tangseng</given-names>
          </string-name>
          , Kota Yamaguchi, and
          <string-name>
            <given-names>Takayuki</given-names>
            <surname>Okatani</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Recommending Outfits from Personal Closet</article-title>
          .
          <source>In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</source>
          .
          <fpage>269</fpage>
          -
          <lpage>277</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Laurens</surname>
            <given-names>van der Maaten and Geofrey</given-names>
          </string-name>
          <string-name>
            <surname>Hinton</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Visualizing Data using t-SNE</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          <volume>9</volume>
          (
          <year>2008</year>
          ),
          <fpage>2579</fpage>
          -
          <lpage>2605</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Mariya</surname>
            <given-names>I. Vasileva</given-names>
          </string-name>
          , Bryan A.
          <string-name>
            <surname>Plummer</surname>
            , Krishna Dusad, Shreya Rajpal, Ranjitha Kumar, and
            <given-names>David</given-names>
          </string-name>
          <string-name>
            <surname>Forsyth</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Learning Type-Aware Embeddings for Fashion Compatibility</article-title>
          .
          <source>In European Conference on Cumputer Vision</source>
          .
          <fpage>405</fpage>
          -
          <lpage>421</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Andreas</surname>
            <given-names>Veit</given-names>
          </string-name>
          , Balazs Kovacs, Sean Bell,
          <string-name>
            <given-names>Julian</given-names>
            <surname>Mcauley</surname>
          </string-name>
          , Kavita Bala, and
          <string-name>
            <given-names>Serge</given-names>
            <surname>Belongie</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Learning Visual Clothing Style with Heterogeneous Dyadic Co-occurrences</article-title>
          .
          <source>In IEEE International Conference on Computer Vision</source>
          . 4642-
          <fpage>4650</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Bolei</surname>
            <given-names>Zhou</given-names>
          </string-name>
          , Aditya Khosla, Agata Lapedriza, Aude Oliva, and Antonio Torralba.
          <year>2016</year>
          .
          <article-title>Learning Deep Features for Discriminative Localization</article-title>
          . In Computer Vision and Pattern Recognition.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>