<!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>Pricing the Nearly Known - When Semantic Similarity is Just not Enough</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Gilad Fuchs</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pavel Petrov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ido Ben-Shaul</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Matan Mandelbrod</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oded Zinman</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dmitry Basin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vadim Arshavsky</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>eBay Research</institution>
          ,
          <country country="IL">Israel</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Helping sellers price their listings is an important and challenging task at E-commerce marketplaces, as the information provided by sellers is often partially structured and lacking. To help the seller gain trust in the recommended price, a collection of supporting similar listings are retrieved and provided along with their prices. We address the problem of retrieval-based price recommendation using a novel approach, which enables a trade-of adjustment between semantic similarity and price accuracy. Balancing the two required since, based on our study, retrieval of semantically similar listings does not guarantee pricing accuracy. In contrast, a price-accuracy driven approach may produce less semantically supporting listings. We also suggest a third method - training a Multi-Task network which learns in parallel both semantic similarity and a pricing-based objective. Framing the solution as a Multi-Task network unfolds the ability to control the balance between explainability and accuracy, thus providing a powerful tool to precisely tailor the correct pricing solution to diferent real world business use cases.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Transformers</kwd>
        <kwd>Sentence Similarity</kwd>
        <kwd>E-commerce</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Price recommendation commonly exists in various E-commerce marketplaces listing creation
forms and is aimed to help sellers price their listings correctly, reduce the time needed to perform
market research and increase the chances of conversion. Retrieval-based price recommendation
is based on aggregating (e.g. averaging) the prices of a set of similar listings. As introduced in
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], the main challenge in retrieval-based price recommendation stems from the fact that many
listed items do not have internationally recognized product identifiers (such as GTIN) associated
with them. This means the listed items are often defined using the information provided by the
seller during the listing creation. Such information is semi-structured, and not standardized - a
given listing may be titled diferently by diferent sellers, and the set of associated attributes
may be partially provided. Thus, the basic challenge a retrieval-based pricing method faces is
the identification of a set of similar listings for a given target listing to be priced. As the listing
title often contains the most concise and relevant information, our work is based solely on titles
rather than additional elements associated with the listing.
      </p>
      <p>
        The intent-driven similarity approach in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] is based on the realization that users’ queries can
be used to assign weights to each of the title’s token embeddings. The drawback of the
querybased weighing is the fact that some titles may include tokens which are highly significant for
pricing, yet are rarely used in buyer queries. Examples of such tokens are the memory size when
searching for a laptop (e.g. ‘128 GB’), or the quantity in multi-quantity listings (e.g. ‘Pack of 4
cards’). We present two approaches to improve the price recommendation, and then a combined
method which enables tuning the trade-ofs between the two. The first approach follows the
attitude in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] in the sense that it adheres to semantic textual similarity between the embedding
vectors of listing titles. However, rather than using the set of user queries to assign weights to
each title token, it uses a Siamese dual encoder to compute titles embeddings. In this scheme,
similar listings are ones who were co-clicked by a user in the same search session. The second
approach (dubbed Title2Price) relinquishes the explicit establishment of semantic similarity, and
instead computes the direct function assigning prices to titles. It uses embeddings from a BERT
model [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], fine-tuned to compute prices directly. This approach achieves better performance
than the first one in terms of price accuracy metrics. However, the resulting title embeddings,
having been constructed in a price-oriented manner, may turn out to have lower semantic
similarity to a given seed listing than the ones computed by the Siamese-based approach. In
some use cases, this may incur lower trust of the recommended price by the sellers.
      </p>
      <p>Thus we have two pricing models - the first achieves high semantic similarity on account of
lower pricing accuracy, and the second improves pricing accuracy on account of the semantic
similarity. To reconcile the trade-of between the objectives, we’ve established a third, combined
model, which enables tuning this trade-of to achieve target business goals. The combination of
the two models is implemented as a multi-task network, which optimizes semantic similarity
and price accuracy in parallel.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Automatic listing pricing problems arise in contexts such as E-commerce, accommodation,
assets value estimation and more. The task of listing pricing has been previously studied by
several related works. In the Kaggle Mercary challenge [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] the approach taken is based on
feature engineering followed by a regression model. A similar method has been applied in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
In our settings, explicit feature extraction is replaced by feeding the listing titles through a
BERT encoder [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and using pooling to generate title embeddings. Due to the variability and
loose structure of titles provided by sellers, such approach has proved more robust and of higher
performance than explicit feature engineering.
      </p>
      <p>
        More advanced approaches to E-commerce pricing consist of converting textual, visual and
structured inputs associated with the query listing to a vector representation. This is followed
by a linear regression, Neural Network or other relevant scheme using the embeddings as input
features. Such an approach is presented in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] whereby a price suggestion system for online
second-hand listings is based on their uploaded images and text descriptions. In [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] the model
consist a combination of LSTM and CNN, for processing textual features and visual features.
While combination of textual and image data is a valid comprehensive approach, our experience
      </p>
      <sec id="sec-2-1">
        <title>Co-clicked titles pairs</title>
        <p>minibatch of size n
a1 a2 … an
b1 b2 bn</p>
        <sec id="sec-2-1-1">
          <title>Alternate</title>
        </sec>
        <sec id="sec-2-1-2">
          <title>Learning</title>
          <p>t1 t2 … tm
p1 p2 pm</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Title and price pairs minibatch of size m</title>
        <p>Title2Price</p>
        <p>B
E
R
T
B
E
R
T
B
E
R
T
shared weights
shared weights</p>
        <p>P
o
o
l
e
r
P
o
o
l
e
r
P
o
o
l
e
r</p>
        <p>R
e
g
r
e
s
s
i
o
n
u1
.
.
.
un
v1
…</p>
        <p>vn
si, j
Cross-Entropy</p>
        <p>
          scaling
MSE Loss
indicates that information which is relevant for pricing is typically mostly specified in the
listings titles. A similar realization is concluded in [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], where images and their associated text
are used to train pricing models. Based on these results we’ve limited our inputs to titles.
        </p>
        <p>The prominent added value of our work stems from applying multi-task learning so as to
balance semantic similarity and price accuracy in dense retrieval settings. To the best of our
knowledge, no previous works have identified and tried to tune the trade-of between the two.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. METHODS</title>
      <p>
        Siamese model In this work we follow [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and train Siamese dual encoder [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] based on
BERT encoder. The training data is based on a eBay’s search engine logs. For each query, we
consider the search results (listings) that were clicked by the user. For a given query, if there
are  "co-clicked" listings in the search results, they are all labeled as similar and aggregated
into a pool of similar listings. To encourage the co-clicked listings to be similar, we filter
search queries that are short and nonspecific by removing queries with less than 6 tokens. The
number of tokens chosen is based on business prior knowledge of average meaningful tokens
per title. Using the listings pool, we further sample pairs of similar listings for each query:
√
either undersampling ⌊2 ⌋ pairs for the training set or two pairs for test/validation sets. We
apply the main BERT encoderr and the subsequent pooling layer to each title, thus producing
pairs of embeddings. Since we only have positive examples, we use the "Multiple Negatives"
loss function, as described in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Using this method, negative samples are obtained from the
non-positive samples found in the same batch.
      </p>
      <p>Title2Price model The Title2Price model is a BERT model with a regression layer, which is
ifne-tuned using sold listings with an MSE loss function. The listing title serves as the input,
whereas the response variable is the sold price of the listing transaction. The prices were
transformed using log(1 + ) to achieve two goals. First, the mapping results in modeling the
ratio between the predicted and real prices, which is more suitable than the absolute diference
and provides better performance (data not shown). Second, it solves the issue of potentially
predicting non-positive prices. Once the model has been fine-tuned, we present two ways of
making predictions: 1. The output of the final regression head. 2. Using the model to produce
title embedding and make a prediction based on its nearest neighbors’ prices. The advantage of
the second approach is explainability - as opposed to the “black box predictions” of the first
approach.</p>
      <p>Multi-task model The Multi-Task architecture combines both Title2Price and Siamese dual
encoder. In this case, both models share the BERT and the Pooling layers. We take an approach
similar to the one taken in [11], where at each step, a task is chosen stochastically based on
varying weights. The training process for  diferent tasks is as follows. The task sampling
depends on the task weights 1, . . . ,  and mini-batch sizes for each task 1, . . . , . At each
iteration, the -th task is selected with probability proportional to ⌈ / ⌉.</p>
      <p>In our specific setting we have two tasks: Title2Price, Siamese with weights 1 = 1.0, 2 =
0.5 accordingly, to balance the diference in data size of both tasks. The cost of the Siamese
model is multiplied by a normalizing factor  ∈ R+ such that ℒMT is composed of ℒTitle2Price
and  × ℒ Siamese, depending on the task chosen at this iteration. When  = 0, the model is
identical to the Title2Price model (essentially skipping the Siamese iterations). However, when
 is large, the efect of the Siamese iterations are dominant, and the model is optimized similar
to the plain Siamese model. An overview of the Multi-Task model architecture is shown in
ifgure 1.</p>
      <p>
        Title Embeddings The embedding process is the same for all models: we apply a pooling
function to the hidden states from the final layer of BERT. Following [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], we compare two
pooling functions:
1. CLS pooler: returns the hidden state for the CLS token.
2. MEAN pooler: returns the average of hidden states for all tokens.
      </p>
      <p>The pooler used for the embeddings generation was always the same as used for the model
training.</p>
      <p>KEN: , -neighbors We used a modified version of k-nearest neighbors called , -neighbors
(KEN). The modified version allows soft thresholding and a larger recall set per query. For a
given vector  and a distance metric (· , · ), a set ,() of , -neighbors for  is defined as
follows. Let () be a set of k-nearest neighbors for . Then:
,() =
︂{
 : (, ) ≤ ′∈()
max ︀[ (, ′)]︀ + 
︂}
In this work we used cosine distance. The nearest neighbors were found by using the Faiss
packages [12].</p>
    </sec>
    <sec id="sec-4">
      <title>4. TRAINING AND EVALUATION</title>
      <p>Datasets There are three types of datasets:
1. Seed dataset: title and price for each listing. It includes ~440K listings sold on eBay during
a two-week period. This dataset is further split into training (~400K), validation (20K),
and test (20K) subsets.
180 days that precede the “seed listings” period.</p>
      <p>consists of ~4M co-clicked listing pairs.
2. Pool dataset: title and price for each listing. It includes ~15M listings sold on eBay in the
3. Co-clicked dataset: titles of listing pairs that were clicked in the same search session. It
For the Pool and Seed datasets, we use the selling price as the response variable. We use
the Pool dataset to fine-tune the Title2Price Model and the Co-clicked dataset to fine-tune
the Siamese Model. Both these datasets are used to fine-tune the Multi-task Model. The Seed
dataset’s train and validation sets are used for optimizing the KEN parameters, and the test
subset is used to report final metrics.</p>
      <p>Metrics</p>
      <p>The primary metric for price prediction is Mean Absolute Error (MAE). We assess
the explainability of the models by looking at the semantic similarity of a given query to its
corresponding nearest neighbors listings. This is done by incorporating attributes assigned to
listings, such as Brand, Model, Color, etc. We’ve introduced a “semantic” metric called Attribute
Mismatch Percentage (AMP), which is defined as follows. For each attribute , and a set of seed
listings  that contain a value for this attribute, we take the  nearest neighbors NNk() for
each listing  ∈ . AMP is then defined as:</p>
      <p>AMP(, ) = 100 ·
∑︀</p>
      <p>∑︀
∈ ∈NNk()</p>
      <p>1{() ̸= (), () ̸= ∅}
∑︀</p>
      <p>∑︀
∈ ∈NNk()
1{() ̸= ∅}</p>
      <p>We set  = 10 in our experiments under the assumption that users usually do not examine
more than 10 top similar listings. As listing attribute information is prevalent across many
verticals in E-commerce marketplaces, the metric is transferable to a wide array of categories.
Training</p>
      <p>All three model types were trained with both CLS and MEAN pooling. For the
Multi-task Model we trained an array of models with gradually increasing values of  . Each
model was trained on 8 GPUs, for at most 20 epochs. Adam optimizer with weight decay of</p>
      <p>Title2Price</p>
      <p>Siamese
0.01 and a linear scheduler with warm-up (for 500 steps) were used, with an initial rate of
2 · 10− 5. We used a Batch size (per GPU) of 32 for Title2Price and 128 for Siamese (same for the
Title2Price and Siamese batches in the Multi-task training).</p>
      <p>After each training epoch the following procedure (the same for all models) is performed:
(1) Embeddings are produced for both the Seed and Pool datasets. (2) Hyperparameters  and
 for , -neighbors are tuned on the Seed training dataset (see below). (3) Price metrics are
calculated for the Seed validation set via the , -neighbors method.</p>
      <p>For each listing in the Seed dataset we look for , -neighbors in the Pool dataset. The
prediction of the price ˆ() per seed listing  is given by the median of the neighbors. The
tuning of  and  is done by a grid search, while minimizing the MAE on the validation subset of
the Seed dataset. Each model’s best checkpoint is selected by the k-nearest neighbors validation
MAE results. Finally, the selected checkpoint is used to calculate the metrics on the Seed test
dataset.</p>
    </sec>
    <sec id="sec-5">
      <title>5. EXPERIMENTS AND RESULTS</title>
      <p>In this work, we focused on one popular category on the eBay marketplace - the "Sport Trading
Cards" category. Predicting listing prices with the Title2Price model can be done either directly
by its regression layer, or by extracting its embeddings to find similar listings and aggregate
their price. In order to compare the price prediction accuracy of both approaches, the MAE
between the predicted price and actual transaction sold price was measured during the model
ifne-tuning. Measuring the MAE for epochs with minimal validation MAE on seed test data
shows that , -neighbors is on par with the regular BERT regression for CLS pooling (29.3 vs
29.3 resp.) and outperforms it for MEAN pooling (29.7 vs 31.1 resp.).</p>
      <p>Figure 2 shows seed test data MAE for Title2Price, Siamese and Multi-task with diferent
16
14
%
h
tca 12
m
s
i
M 10
8</p>
      <p>Title2Price
Title2Price
Pooling</p>
      <p>CLS
MEAN</p>
      <p>Siamese
Siamese
values of the tasks scaling parameter  . Figure 3 shows Attribute Mismatch Percentage (AMP)
on the test data for two attributes: Player and Grade. We can see a trade of between the
performance of the price prediction and the explainability (semantic similarity of the nearest
neighbors). As the scale ( ) is increased, there’s an ascending trend in MAE and a descending
trend in AMP for Player. AMP for Grade, however, exhibits a behavior which is more similar to
MAE and tends to grow. The Grade (e.g. PSA Grade) of a Sport Card describes its condition
quality. The price of a card is dramatically afected by its grading score. This could explain the
diferent behavior between the Player attribute, compared to the Grade attribute.</p>
      <p>Of note, the CLS pooling outperforms the MEAN pooling in terms of MAE (Figure 2) and
Grade AMP (Figure 3), while underperforming the MEAN pooling in Player AMP (Figure 3),
thereby further demonstrating the pricing-semantic trade-of.
Online evaluation We evaluate our approach in an online production setting as part of eBay’s
Price Recommendation service, as described in Section 1. The current production requirements
emphasize the price prediction accuracy (as opposed to semantic similarity), so the Title2Price
model was used. Furthermore, the service also has to present similar listings that contributed
to the recommendation. Therefore, we use the , -neighbors (KEN) method described in
Section 3 to predict the price and retrieve the list of neighbors. In order to encompass the
performance requirements of   search in a production setting, we reduce the dimension of
title embeddings from 768 to 256 by adding a linear layer to the original Title2Price model. For
the adjusted model, we use MEAN-Pooler as it shows slightly better accuracy for the reduced
embeddings.</p>
      <p>We deployed the production-adjusted Title2Price model and performed an A/B test to compare
it with the current service performance. The test lasted 30 days during the beginning 2022.
The new model served 20% of the Price Recommendation service trafic for the "Sport Trading
Cards" category during the test.</p>
      <p>We compared the performance by four main evaluation metrics: Mean Absolute Error (MAE),
Root Mean Squared Error (RMSE), and the adoption rate within a 5% and 10% bi-directional
margin (which we define as P5 and P10). These metrics serve as a proxy to the seller’s acceptance
with the recommendation and correlate with the platform’s long-term business success. The
Title2Price model demonstrated significant improvement in all four metrics, as can be seen in
Table 1.</p>
      <p>The online evaluation required creating a scalable infrastructure to execute the model and
generate recommendations with low latency in real-time. We deployed a cluster of 48 nodes,
each 178 RAM 24 CPU cores with Ubuntu Linux. When a seller creates a new listing,
the listing’s title is sent to a service node. The node generates the title’s embedding using
Title2Price Tensorflow model and performs LSH index lookup to fetch a short list of similar
listing candidates for recommended price calculation using KEN method described in Section 3.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions</title>
      <p>In this work we propose several models to tackle the task of E-commerce price prediction based
on non-structured text. We present two diferent models, The first, Title2Price, introduced to
regress the ground truth price and the other, Siamese, trained to retrieve semantically similar
embeddings. In theory, both tasks should work towards the same goal: embeddings from the
Title2Price model would be expected to make semantically similar listings close, as their prices
are generally close, and embeddings from the Siamese model should have relatively similar
prices. To our surprise, this is not the case. Vanilla Semantic Similarity models lack the ability
to diferentiate which parts of a title are volatile to the price, and which are non important. For
example, two sport cards titles with exactly the same phrasing, but a diferent grading can have
dramatically diferent prices, while two sport cards of a diferent year may be of a similar price.
On the other hand, the Title2Price model may be very good at predicting the price, but in doing
so it might use entirely diferent cards. Suppose the cards with the titles “AJ Green 2011 Topps
Football Rookie Card" and “Nickeil Alexander 2019 Prizm Silver" have very similar prices. The
Title2Price model may push the embeddings to be close together, although to a user this may
seem very ‘wrong’, as these cards are not similar. To overcome this dificulty, we present a
Multi-Task model to balance the two objectives. The models can be trained to support more
semantic similarity, or more price accuracy. To test the trade-of between the diferent models,
we present the AMP metrics, on diferent listing attributes. We show a detailed analysis of the
performances using well-known metrics and the ones proposed in this paper.
R. Kurzweil, Eficient natural language response suggestion for smart reply, ArXiv
abs/1705.00652 (2017).
[11] X. Liu, P. He, W. Chen, J. Gao, Multi-task deep neural networks for natural language
understanding, in: ACL, 2019.
[12] J. Johnson, M. Douze, H. Jégou, Billion-scale similarity search with gpus, arXiv preprint
arXiv:1702.08734 (2017).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>G.</given-names>
            <surname>Fuchs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Acriche</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Hasson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Petrov</surname>
          </string-name>
          ,
          <article-title>Intent-driven similarity in e-commerce listings</article-title>
          ,
          <source>in: Proceedings of the 29th ACM International Conference on Information Knowledge Management</source>
          , CIKM '20,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2020</year>
          , p.
          <fpage>2437</fpage>
          -
          <lpage>2444</lpage>
          . URL: https://doi.org/10.1145/3340531.3412715. doi:
          <volume>10</volume>
          .1145/3340531. 3412715.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          ,
          <year>2018</year>
          . arXiv:
          <year>1810</year>
          .04805.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A. A. S.</given-names>
            <surname>Ali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Seker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Farnie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Elliott</surname>
          </string-name>
          ,
          <article-title>Extensive data exploration for automatic price suggestion using item description: Case study for the kaggle mercari challenge</article-title>
          ,
          <source>in: Proceedings of the 2nd International Conference on Advances in Artificial Intelligence, ICAAI</source>
          <year>2018</year>
          , Barcelona, Spain,
          <source>October 06-08</source>
          ,
          <year>2018</year>
          , ACM,
          <year>2018</year>
          , pp.
          <fpage>41</fpage>
          -
          <lpage>45</lpage>
          . URL: https: //doi.org/10.1145/3292448.3292458. doi:
          <volume>10</volume>
          .1145/3292448.3292458.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>N.</given-names>
            <surname>Pal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Arora</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Sundararaman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kohli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. S.</given-names>
            <surname>Palakurthy</surname>
          </string-name>
          ,
          <article-title>How much is my car worth? a methodology for predicting used cars prices using random forest</article-title>
          ,
          <year>2017</year>
          . arXiv:
          <volume>1711</volume>
          .
          <fpage>06970</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>L.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <article-title>Price suggestion for online second-hand items with texts</article-title>
          and images,
          <year>2020</year>
          . arXiv:
          <year>2012</year>
          .06008.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A. E.</given-names>
            <surname>Fathalla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Salah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Francesco</surname>
          </string-name>
          ,
          <article-title>Deep end-to-end learning for price prediction of second-hand items</article-title>
          ,
          <source>Knowledge and Information Systems</source>
          (
          <year>2020</year>
          )
          <fpage>1</fpage>
          -
          <lpage>28</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>B.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <article-title>An analysis of multi-modal deep learning for art price appraisal</article-title>
          ,
          <source>2021 IEEE Intl Conf on Parallel &amp; Distributed Processing with Applications</source>
          ,
          <source>Big Data &amp; Cloud Computing, Sustainable Computing &amp; Communications</source>
          ,
          <string-name>
            <given-names>Social</given-names>
            <surname>Computing</surname>
          </string-name>
          &amp;
          <string-name>
            <surname>Networking</surname>
          </string-name>
          (ISPA/BDCloud/SocialCom/SustainCom) (
          <year>2021</year>
          )
          <fpage>1509</fpage>
          -
          <lpage>1513</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>Sentence-bert: Sentence embeddings using siamese bert-networks</article-title>
          ,
          <source>in: EMNLP/IJCNLP</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bromley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Bentz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bottou</surname>
          </string-name>
          , I. Guyon, Y. LeCun,
          <string-name>
            <given-names>C.</given-names>
            <surname>Moore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Säckinger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Shah</surname>
          </string-name>
          ,
          <article-title>Signature verification using a "siamese" time delay neural network</article-title>
          ,
          <source>in: Int. J. Pattern Recognit</source>
          . Artif. Intell.,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Henderson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Al-Rfou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Strope</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-H.</given-names>
            <surname>Sung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Lukács</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Miklos</surname>
          </string-name>
          ,
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>