<!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>Personalizing Item Recommendation via Price Understanding</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Soumya Wadhwa</string-name>
          <email>soumya.wadhwa@walmartlabs.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ashish Ranjan</string-name>
          <email>ashish.ranjan@walmartlabs.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Selene Xu</string-name>
          <email>yue.xu@walmartlabs.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jason H.D. Cho</string-name>
          <email>hcho@walmartlabs.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sushant Kumar</string-name>
          <email>skumar4@walmartlabs.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kannan Achan</string-name>
          <email>kachan@walmartlabs.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Walmart Labs</institution>
          ,
          <addr-line>Sunnyvale, California</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Personalization has gained a lot of traction in the e-commerce domain since there is ample evidence for short-term and long-term benefits of understanding user preferences and ensuring user satisfaction. However, efectively personalizing recommendations is a challenging task, especially at scale. Price is often a key consideration for purchases, and user behavior varies widely depending on demographic and psychological factors. While dificult to model, this is an important signal to consider for user-item recommendation. In this paper, we focus on personalizing and improving the relevance of item recommendations for e-commerce users by leveraging price as an essential input. More concretely, we segregate items into price bands indicating how expensive they are, infer user afinity to price bands based on historical behavior and use features derived from this knowledge to re-rank items in a real-world recommendation scenario. We experiment with various statistical and machine learning methods to determine item price bands, user price afinities and item price similarities, and demonstrate impact on the recommendation quality for millions of users and items.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        Recommender systems are ubiquitous on websites today.
Recommendation algorithms can be based on item-item interactions or
user-item feedback. In recent times, websites are increasingly
focusing on providing an experience tailored to their users [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ] [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
[
        <xref ref-type="bibr" rid="ref36">36</xref>
        ] with personalization at the segment or individual level.
Understanding user preferences and recommending relevant items to
them accordingly has been shown to improve user satisfaction and
conversion rates, which is a win-win situation [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. While it is
essential, scaling the personalization of recommendations anchored
on combinations of users and items is very challenging, especially
in the e-commerce domain where millions of users can potentially
interact with millions of items.
      </p>
      <p>
        For most users, price is often a key factor for making purchases
[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ]. Users make price-value trade-ofs when they purchase
products, and their behavior can vary widely depending on
demographic factors such as their salary or location and psychological
factors such as money consciousness or additional interest in
certain types of products. Let us consider two users. The first user is a
sound engineer and is looking to purchase high-quality headphones
for use at work. Since this user needs to discern any imperfections,
they may be looking to purchase expensive headphones. Another
user may decide to purchase headphones to listen to podcasts. As
long as this user can understand the podcast, sound quality is not
an issue and they can buy lower-priced headphones. To efectively
personalize their shopping journey, understanding that the first
customer is looking for higher priced headphones and the second
customer is looking for lower priced ones will help recommend
products they are looking for.
      </p>
      <p>However, defining what constitutes a high-priced or low-priced
item is a dificult task. In the e-commerce domain, products, of
course, have price associated with them. But, we do not know
whether a given price is considered expensive or inexpensive for
a given type of product, for example, a light bulb and a laptop.
$100 may be a bargain for the laptop, but the same price-tag for
the light bulb might make it very expensive. Similarly, we need
to understand item prices for each product type and categorize
them into diferent price bands (e.g. low vs. high) based on this.
Subsequently, we can start understanding which price bands users
are likely to purchase from for diferent product types.</p>
      <p>To summarize, using price to personalize item recommendation
is challenging because user price preferences need to be implicitly
inferred and vary based on the type of product. Additionally, item
prices are not suficient to determine if a product is considered
expensive versus not, and need to be standardized such that they
can be compared across diferent types of products. In this paper,
we aim to model user price afinity and item price similarity, and
utilize them as input signals along with item-item relevance scores
to personalize and improve the quality of item recommendations
for e-commerce users. We achieve this using the following:
• Unsupervised methods to divide items into price bands
indicating their degree of expensiveness
• Supervised methods to compute user afinity to diferent
price bands based on their historical interactions
• Item and user price-related features to re-rank items in an
actual user-item recommendation setting
This is done at the Product Type (PT) level which is the most granular
level of the product taxonomy available in the Walmart product
catalog. We use a large e-commerce dataset, and experiment with
multiple statistical and machine learning methods to determine
item price bands, user price afinities and item price similarities. We
quantitatively show the positive impact on recommendation quality
upon including price-related features in the re-ranking algorithm.
2</p>
    </sec>
    <sec id="sec-2">
      <title>RELATED WORK</title>
      <p>
        There has been extensive research on recommender systems and
personalization. Many research eforts have been focused on
collaborative filtering-based techniques. Traditional matrix factorization
(MF) models [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] and variants [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ], incorporating implicit
feedback, temporal efects and confidence levels, have proved superior
to the classic nearest neighbor approaches in recommending items
[
        <xref ref-type="bibr" rid="ref33">33</xref>
        ]. Factorization machines [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ] have also been used for
recommendation to overcome feature sparsity issues. Emerging deep
learning based solutions [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] have also shown promising
results for recommendation. Item embeddings can be used to
compute item-item similarity and recommend items accordingly [
        <xref ref-type="bibr" rid="ref37">37</xref>
        ]
[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. For modeling recommendations based on short session-based
data, a sequential Recurrent Neural Network [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] (RNN)-based
approach can be used to predict the next item [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. More recently,
causal embeddings for recommendation [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] have shown significant
improvements over state-of-the-art factorization methods.
      </p>
      <p>
        Price is an important factor to consider for users while making
an online purchase. In [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ], a conceptual framework is developed
to explain the efects of the online medium on customer price
sensitivity. User price sensitivity and price thresholds are discussed
in [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Traditional and online supermarkets are compared in terms
of user behavior with respect to brand, price and other search
attributes in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], and price sensitivity is found to be higher online.
There are also other studies about impact of advertising [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] and
brand credibility [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] on price sensitivity. In [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ], the potential efect
of the consumption occasion (functional vs. hedonic), social context
and household income on users’ price sensitivity is analyzed. There
is substantial additional literature on consumer price sensitivity.
      </p>
      <p>
        However, price has received relatively less attention as an input
signal for recommendation. Price is used as a feature in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] for
personalization in the e-commerce domain by taking the ratio of
the price of the current item to the average price of previously
clicked items. There is also a brief mention of how price can afect
user’s afinity towards an item in [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Authors in [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] perform
data analysis of logs to investigate what makes recommendations
efective in practice, and include some factors based on “price levels”
per product category. However, methods for determining these price
levels are not discussed and user price afinity is incorporated as
an average of recent price levels (not per category). Their focus is
on the impact of popularity, discounts, reminders and recency on
user click behavior. In [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], Willingness To Pay (WTP) distributions
per user and product are modeled, and this is used with discount
indication and seller reputation in a context-aware recommendation
model to improve recommendation quality. More recently, [
        <xref ref-type="bibr" rid="ref40">40</xref>
        ]
model the transitive relationship between user-to-item and
itemto-price using Graph Convolution Networks [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] (GCN) to make
the learned user representations price-aware. They incorporate
prices and categories as nodes along with users and items in a
heterogeneous graph. They also consider price as a categorical
variable and discretize the price value into separate levels based on
price ranges but do not experiment with diferent methods for this.
      </p>
      <p>In our work, we explore several methods to compute item price
bands and explicitly model user price afinity for various types of
products, such that these input signals can be leveraged generally
for use cases such as recommendation and search. We demonstrate
results for user-item and item-item price-related features obtained
from diferent model variations used together with an item-item
relevance score for personalizing item-anchored recommendations.
3</p>
    </sec>
    <sec id="sec-3">
      <title>METHODOLOGY</title>
      <p>Our goal is to use past item interaction data (such as clicks and add
to carts) for a given user and predict their afinity for a particular
price band, and eventually incorporate this price understanding into
recommendations. To achieve this, items are clustered into price
bands at the product type level (Section 3.1), and then user activity
patterns are learnt with respect to these item price bands to predict
the probability that the user will purchase an item from a particular
price band versus others for that product type. These predicted
user-item price band afinity scores (Section 3.2) and item-item
price band similarity scores (Section 3.3) are used as features along
with relevance scores to re-rank item-anchored recommendations
(Section 3.4) for personalization using price understanding.
3.1</p>
    </sec>
    <sec id="sec-4">
      <title>Item Price Bands</title>
      <p>Item prices vary a lot, from less than 10 dollars for a USB drive to
thousands of dollars for a QLED television. However, to decide if
an item is expensive or not, just the absolute value of price is
insufifcient. It is also important to take into consideration the product
type since a price of $100 might be low for televisions, but high for
a USB drive. Thus, we need to create representations for prices of
items for each product type such that they are directly comparable
across diferent items. So, we assign each item to one out of  bands
using unsupervised methods since labels are unavailable.
3.1.1 Statistical Methods. We first explore statistical methods
using item prices for each product type.</p>
      <p>• Range-Based: For example, say television prices vary from
$100 to $5100, and we decide to create 3 price bands with
price range ratios 3:5:2. Then one unit of the range becomes
($5100 - $100)/(3+5+2) = $500, and the lowest price band
extends from $100 to $100 + 3*$500 (= $1600), the middle
from $1600 to $2600 + 5*$500 (= $4100) and the highest from
$4100 to $4100 + 2*$500 (= $5100).
• Percentile-Based: For example, say, in the above situation, we
decide to create 3 price bands with percentiles 30%, 50% and
20%. If there are 200 televisions on our item catalog with 60
TVs having price less than $500, 100 TVs with prices between
$500 - $2500 and 40 TVs with prices greater than $2500, then
those delineate the price bands.</p>
      <p>Splitting items into equal bins based on range or percentiles did
not work well in practice due to skew in item price distributions
and transaction volumes. Creating unequal bins needs extensive
manual tuning.
3.1.2 Clustering. Next, we use some common clustering methods
to automatically put items from each product type into  clusters
using the item price values.</p>
      <p>
        • K-Means [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]: Each item is assigned to the cluster for which
the mean price value is closest to the item price.
• Gaussian Mixture Model (GMM) [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ]: We assume that all the
price values are generated from a mixture of a finite number
of normal distributions with unknown means and variances
(estimated using Expectation Maximization). We pick the
highest probability cluster as the item’s price band.
3.1.3 Transaction Balancing. Another method is based on
computing cumulative transaction volumes after arranging items in
increasing order of their price value, and determining price band
boundaries such that each price band accounts for an equal volume
of item transactions. This technique was devised to mitigate data
imbalance in the subsequent step of using price bands to compute
price afinities based on user activity.
on a number of smaller samples from the data. The final output is
the average of diferent tree outputs.
3.2
After assigning price bands to items at the product type level, the
next step is to determine the user price afinity per product type.
In other words, given a product type, we want to predict the
probability that the user will purchase an item from a certain price
band versus others. For example, say we are considering two price
bands, “expensive” and “cheap”. Sam might have afinities 0.8 and
0.2 towards expensive and cheap fitness trackers, but 0.3 and 0.7
towards expensive and cheap bed frames. This indicates that she
likes buying expensive fitness trackers but inexpensive bed frames.
To predict this, we use historical data to train various machine
learning models, using 6 months’ data for generating features and
the next 1 month for labels. The baseline prediction is based on the
transactions in 6 months.
3.2.1 Baseline. For each user, per product type, we take the number
of transactions (trx) in each price band ( ) and normalize it by
summing transactions across all price bands for that product type
(  ) and user to obtain afinity scores.
      </p>
      <p>
        user_price_afinity
(,  ) =
# of trx in ,  
# of trx in  
(1)
3.2.2 Machine Learning. We consider user price afinity prediction
as a multi-class classification (supervised machine learning)
problem with number of classes equal to the number of price bands ().
For each user and product type, we use features such as number
of transactions, add to carts and views of items per price band per
month (for 6 months) by that user for that product type. We did not
have ground truth data for labels. As a proxy, we use the price band
which has the maximum number of transactions by the user for
that product type, as the label. The aggregation of data for labels
is done using the month following the last month used for feature
generation. Thus, each data point is used to predict price afinities
of a specific user towards diferent price bands in a particular
product type. Subsequently, we use these features and labels to train
and test multi-class Logistic Regression (LR) [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] and Decision Tree
(DT) [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] models.
      </p>
      <p>In LR, for each input data point (feature vector  and label ), the
model learns weights (weight vector  ) and outputs a probability
distribution over the price bands () for a given user and product
type ( ) which represents their afinity.</p>
      <p>
        user_price_afinity
(,  ) = Í=1 exp  
exp  
(2)
We use two variants - unweighted (LR-unbal) which is the vanilla
model and weighted (LR-bal) based on class imbalance, where
each data point is assigned a weight while contributing to the
loss/gradient computation. The weight balancing heuristic used
n_samples
[
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] is inversely proportional to class frequencies: n_classes ∗ count_y ,
where  is the class label.
      </p>
      <p>In DT, data is continuously split based on a certain feature at each
step. We also consider random forests and fit multiple decision trees
3.3
Another input is the similarity between price bands for items across
product types based on user transaction patterns. For example,
users who purchase medium-priced televisions might be likely to
purchase high-priced sound bars and these ( , ) pairs are similar.
This is also used as a feature while re-ranking to capture the
itemitem price similarity.</p>
      <p>
        Pearson Correlation [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]: We compute the Pearson correlation ()
between observed transactions for each user for diferent (product
type, price band) pairs (say ,  and ,   ), and these are used
as the price similarity scores.
      </p>
      <p>
        price2price = , =
cov( ,  )
 ∗ 
Matrix Factorization [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]: We learn latent representations for
(product type, price band) pairs by creating a user-(product type, price
band) transaction matrix and factorizing it.  × denotes the user
representation ( users) and  × denotes the (product type, price
band) representation ( pairs). Embeddings are learned such that
   is a good approximation of transaction matrix  . Cosine
similarity between these low-dimensional vectors are used as price
similarity scores.
      </p>
      <p>price2price =  ( ) =</p>
      <p>·
|| || || ||
(3)
(4)
3.4</p>
    </sec>
    <sec id="sec-5">
      <title>Re-Ranking</title>
      <p>To tie everything up, we have a re-ranker engine that is capable of
incorporating user price understanding and item price similarity
into any item recommendation set such as Viewed also Viewed
and Bought also Bought. We use an inference function to combine
features related to user preference and item relevance, and predict
user-item interactions:
 ( interacts with  |  just interacted with ) =  ((,  ), ℎ (,  ))
(5)
where  is the user,  is the anchor item,  is the recommended item,
(,  ) represents ’s preference for  , and ℎ (,  ) represents item
relevance between  and  . Currently, the inference function we
use is simple logistic regression where user preference score and
relevance score are combined linearly. The weights can be learned
either at the global level (i.e. same weights across all product types)
or at the product type level. There are more details in Section 4.4.
4</p>
    </sec>
    <sec id="sec-6">
      <title>EXPERIMENTS AND RESULTS</title>
      <p>We use a real-world proprietary e-commerce dataset from
walmart.com for demonstrating results. We determine price bands for
few million items and predict price afinity scores for millions of
users across around 6000 product types.
4.1</p>
    </sec>
    <sec id="sec-7">
      <title>Item Price Bands</title>
      <p>We explored the trade-of between granularity for more useful user
afinity scores and data sparsity issues in user-price band
interactions as the number of price bands per product type increases, and
decided to use  = 5 item price bands for our experiments. We
evaluate the discovered item price bands qualitatively, since ground
truth labels are unavailable. One way is to look at how price ranges
for diferent products were being split based on diferent methods
described in Section 3.1. Of these, (as shown in Figure 1) we pick
k-means and transaction balancing (transac-bal) as methods to
further evaluate in the subsequent steps of predicting user afinities
and using these to re-rank recommendations. We observe that
clustering methods such as k-means put fewer very high priced items
into the higher price bands, whereas trying to equalize number of
transactions puts fewer items into the lower price bands, which is
expected since less expensive items usually have more transactions.
We also randomly sample items and inspect the quality of price
bands. An example of televisions from 5 price bands (v low-0, low-1,
medium-2, high-3 and v high-4) is shown in Figure 2.
4.2</p>
    </sec>
    <sec id="sec-8">
      <title>User Price Afinity</title>
      <p>
        We hold out 20% of data to test the trained user price afinity
models described in Section 3.2. We use precision, recall and F1 score,
which are common multi-class classification evaluation metrics, to
assess the performance of diferent models. Since the classes in the
data are not balanced, accuracy is not a good metric. Additionally,
we also use the Mean Reciprocal Rank (MRR) to check whether
even if the max transaction price band (ground truth label) does
not get the maximum price afinity score, it gets a reasonably low
(better) rank. Results for diferent models when price bands are
determined using k-means and transac-bal are shown in Table 1 and
Table 2 respectively. Random forests did not give much
improvement over simple decision trees, so we have omitted those results.
For the baseline, we obtain an overall MRR of around 0.51 for
kmeans and around 0.37 for transac-bal. All the machine learning
methods performed better than the baseline. For logistic regression,
we explored hyperparameters aggregation depth: [
        <xref ref-type="bibr" rid="ref2 ref4">2,4</xref>
        ], maximum
iterations: [100,1000], regularization: [0,0.01] and elastic net weights:
[0.4,0.8], and were able to obtain an overall MRR of around 0.85
for k-means and around 0.79 for transac-bal. For decision trees, we
explored hyperparameters impurity: ["entropy", "gini"], maximum
depth: [
        <xref ref-type="bibr" rid="ref10 ref20 ref30">10, 20, 30</xref>
        ] and maximum bins: [
        <xref ref-type="bibr" rid="ref16 ref32">16, 32, 64</xref>
        ], and were able to
obtain an overall MRR of around 0.85 for k-means and around 0.76
for transac-bal. We observe that weighted / class-balanced logistic
regression performs the best for both item price banding strategies,
but performance varies across diferent price bands as seen in
Figure 3, with metrics falling for higher price bands in the k-means
case and remaining at similar levels in the transac-bal case.
4.3
      </p>
    </sec>
    <sec id="sec-9">
      <title>Item Price Similarity</title>
      <p>We show how price understanding models perform when
implemented on the "customers who viewed also viewed" (VAV)
application (example shown in Figure 5). We take few million anchor
items from VAV and limit to  &lt;= 30 recommendations for each
item ranked by a "relevance" score. This relevance score is based
on item-item features such as number of co-views, title match and
popularity. The price understanding model ofers two additional
features for re-ranking on top of the relevance score: user price
afinity score and price2price similarity score.</p>
      <p>
        We first test out various methods used to develop user price
afinity. We start with two main methods for item price banding:
k-means and transaction balancing. For each item price banding
model we have four variations for user price afinity: baseline,
logistic regression (unbalanced), logistic regression (balanced) and
decision trees. This gives us a total of eight versions of user price
afinity scores. The inference function for re-ranking is balanced
logistic regression:
 =  0 +  1 × relevance +  2 × user_price_afinity
(6)
The weights in the equation above are trained at the global level
(as opposed to at each product-type level) and are optimized for
items that are co-viewed within each user session. To evaluate
performance, we use common ranking evaluation metrics Normalized
Discounted Cumulative Gain (NDCG) [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], Mean Hit Rate (MHR),
Mean Reciprocal Rank (MRR) and Mean Average Precision (MAP)
[
        <xref ref-type="bibr" rid="ref27">27</xref>
        ] [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. The ofline evaluation results are shown in Table 4. We
limit the evaluation metrics to be based on the top 5
recommendations. We observe that all the models outperform the relevance
only model (no re-ranking). The best performing model uses
transaction balancing for price banding and applies weighted logistic
regression (balanced) to derive user price afinity scores.
      </p>
      <p>We now expand on the previously established best performing
model and supplement it with item price similarity information
between the anchor item and the recommended item. We have two
variations of item similarity scores to compare: Pearson
correlation and matrix factorization. The inference function now has an
additional feature, as follows:
 =  0 +  1 × relevance
+  2 × user_price_afinity
+  3 × price2price_similarity
(7)
Again we adopt a balanced logistic regression model to train the
above objective function and learn the weights at the global level.
The results are shown in Table 5. We observe an even greater
boost in performance by adding the price2price feature. Overall, the
best performing model uses price2price scores derived from matrix
factorization. Compared to the relevance only model, this method
shows 0.64% improvement in NDCG, 1% improvement in MHR, and
0.93% improvement in MAP. The improvements in NDCG, MHR
and MAP@5 are statistically significant at 5% level in our ofline
evaluation. Though the MRR is slightly lower, the diference is
not statistically significant. Also, since 5-6 recommended items are
typically shown on the first pane of the module, metrics such as
MHR become more important.</p>
      <p>We further study the weights,  1  2  3 from the inference
function to gauge feature importance. After adjusting for feature
variance (standard scaling of features), the ratio among the weights
 1 :  2 :  3 = 33:3:1. This tells us that the relevance score from
the VAV model contributes the most even during re-ranking, but
price-related features also add value. The user price afinity feature
has greater weight than the price2price feature.</p>
    </sec>
    <sec id="sec-10">
      <title>CONCLUSION</title>
      <p>In this paper, we discuss a novel approach to incorporate
pricerelated user-item signals into recommender systems to personalize
their output. This is done by assigning price bands to items of
different types, using historical user-item data to predict user price
afinity and using this afinity along with an item price band
similarity score to re-rank item recommendations anchored on a (user,</p>
      <sec id="sec-10-1">
        <title>Item Price Band Method</title>
        <p>User Price Afinity Method</p>
      </sec>
      <sec id="sec-10-2">
        <title>NDCG@5</title>
        <p>k-means
k-means
k-means
k-means
transac-bal
transac-bal
transac-bal
transac-bal
- Relevance</p>
      </sec>
      <sec id="sec-10-3">
        <title>Baseline</title>
        <p>LR (unbalanced)
LR (balanced)
Decision Trees</p>
      </sec>
      <sec id="sec-10-4">
        <title>Baseline LR (unbalanced)</title>
        <p>LR (balanced)
Decision Trees
- Relevance</p>
      </sec>
      <sec id="sec-10-5">
        <title>Pearson Correlation</title>
        <p>Matrix Factorization
item) pair. We demonstrate statistically significant improvement in
ofline ranking metrics after explicitly including price inputs (user
price afinity using balanced logistic regression with
transactionbalanced price bands; item price similarity using matrix
factorization). To compute price afinities, other user-website interaction
data such as user’s historical search queries can also be used. In
the future, we plan to learn embeddings which implicitly encode
item price information and user representations such that similarity
between user and item embeddings is indicative of price afinity.
We can also experiment with other pairwise or listwise learning to
rank methods to improve the current pointwise ranking function.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Grigor</given-names>
            <surname>Aslanyan</surname>
          </string-name>
          , Aritra Mandal, Prathyusha Senthil Kumar, Amit Jaiswal, and Manojkumar Rangasamy Kannadasan.
          <year>2020</year>
          .
          <article-title>Personalized Ranking in eCommerce Search</article-title>
          .
          <source>In Companion Proceedings of the Web Conference</source>
          <year>2020</year>
          .
          <fpage>96</fpage>
          -
          <lpage>97</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Jacob</given-names>
            <surname>Benesty</surname>
          </string-name>
          , Jingdong Chen, Yiteng Huang,
          <string-name>
            <given-names>and Israel</given-names>
            <surname>Cohen</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Pearson Correlation Coeficient</article-title>
          .
          <source>In Noise Reduction in Speech Processing</source>
          . Springer, 1-
          <fpage>4</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Bonner</surname>
          </string-name>
          and
          <string-name>
            <given-names>Flavian</given-names>
            <surname>Vasile</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Causal Embeddings for Recommendation</article-title>
          .
          <source>In Proceedings of the 12th ACM Conference on Recommender Systems</source>
          .
          <volume>104</volume>
          -
          <fpage>112</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Pei-Yu Chen</surname>
          </string-name>
          and
          <string-name>
            <surname>Shin-yi Wu</surname>
          </string-name>
          .
          <year>2007</year>
          .
          <article-title>Does Collaborative Filtering Technology Impact Sales? Empirical Evidence from Amazon.com. Empirical Evidence from Amazon</article-title>
          .
          <source>Com (July</source>
          <volume>8</volume>
          ,
          <year>2007</year>
          ) (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Pei-Yu</surname>
            <given-names>Chen</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shin-yi Wu</surname>
            , and
            <given-names>Jungsun</given-names>
          </string-name>
          <string-name>
            <surname>Yoon</surname>
          </string-name>
          .
          <year>2004</year>
          .
          <article-title>The Impact of Online Recommendations and Consumer Feedback on Sales</article-title>
          .
          <source>ICIS 2004 Proceedings</source>
          (
          <year>2004</year>
          ),
          <fpage>58</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Heng-Tze</surname>
            <given-names>Cheng</given-names>
          </string-name>
          , Levent Koc, Jeremiah Harmsen, Tal Shaked, Tushar Chandra, Hrishi Aradhye,
          <string-name>
            <surname>Glen Anderson</surname>
          </string-name>
          , Greg Corrado, Wei Chai,
          <string-name>
            <surname>Mustafa Ispir</surname>
          </string-name>
          , et al.
          <year>2016</year>
          .
          <article-title>Wide &amp; Deep Learning for Recommender Systems</article-title>
          .
          <source>In Proceedings of the 1st Workshop on Deep Learning for Recommender Systems</source>
          .
          <volume>7</volume>
          -
          <fpage>10</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>W</given-names>
            <surname>Bruce Croft</surname>
          </string-name>
          , Donald Metzler, and
          <string-name>
            <given-names>Trevor</given-names>
            <surname>Strohman</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Search Engines: Information Retrieval in Practice</article-title>
          . Vol.
          <volume>520</volume>
          .
          <string-name>
            <surname>Addison-Wesley Reading</surname>
          </string-name>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Alexandru</surname>
            <given-names>M Degeratu</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Arvind</given-names>
            <surname>Rangaswamy</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Jianan</given-names>
            <surname>Wu</surname>
          </string-name>
          .
          <year>2000</year>
          .
          <article-title>Consumer Choice Behavior in Online and Traditional Supermarkets: The Efects of Brand Name, Price, and other Search Attributes</article-title>
          .
          <source>International Journal of Research in Marketing 17</source>
          ,
          <issue>1</issue>
          (
          <year>2000</year>
          ),
          <fpage>55</fpage>
          -
          <lpage>78</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Tülin</given-names>
            <surname>Erdem</surname>
          </string-name>
          , Jofre Swait, and
          <string-name>
            <given-names>Jordan</given-names>
            <surname>Louviere</surname>
          </string-name>
          .
          <year>2002</year>
          .
          <article-title>The Impact of Brand Credibility on Consumer Price Sensitivity</article-title>
          .
          <source>International Journal of Research in Marketing 19</source>
          ,
          <issue>1</issue>
          (
          <year>2002</year>
          ),
          <fpage>1</fpage>
          -
          <lpage>19</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Carlos</surname>
            <given-names>A</given-names>
          </string-name>
          <string-name>
            <surname>Gomez-Uribe</surname>
            and
            <given-names>Neil</given-names>
          </string-name>
          <string-name>
            <surname>Hunt</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>The Netflix Recommender System: Algorithms, Business Value, and Innovation</article-title>
          .
          <source>ACM Transactions on Management Information Systems (TMIS) 6</source>
          ,
          <issue>4</issue>
          (
          <year>2015</year>
          ),
          <fpage>1</fpage>
          -
          <lpage>19</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Mihajlo</surname>
            <given-names>Grbovic</given-names>
          </string-name>
          , Vladan Radosavljevic, Nemanja Djuric, Narayan Bhamidipati, Jaikit Savla, Varun Bhagwan, and
          <string-name>
            <given-names>Doug</given-names>
            <surname>Sharp</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>E-commerce in your Inbox: Product Recommendations at Scale</article-title>
          .
          <source>In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>
          .
          <year>1809</year>
          -
          <fpage>1818</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Asnat</given-names>
            <surname>Greenstein-Messica</surname>
          </string-name>
          and
          <string-name>
            <given-names>Lior</given-names>
            <surname>Rokach</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Personal Price Aware MultiSeller Recommender System: Evidence from eBay</article-title>
          .
          <source>Knowledge-Based Systems</source>
          <volume>150</volume>
          (
          <year>2018</year>
          ),
          <fpage>14</fpage>
          -
          <lpage>26</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Huifeng</surname>
            <given-names>Guo</given-names>
          </string-name>
          , Ruiming Tang, Yunming Ye,
          <string-name>
            <given-names>Zhenguo</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Xiuqiang</given-names>
            <surname>He</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>DeepFM: A Factorization-Machine based Neural Network for CTR Prediction</article-title>
          .
          <source>arXiv preprint arXiv:1703.04247</source>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Sangman</surname>
            <given-names>Han</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Sunil</given-names>
            <surname>Gupta</surname>
          </string-name>
          , and
          <string-name>
            <surname>Donald R Lehmann</surname>
          </string-name>
          .
          <year>2001</year>
          .
          <article-title>Consumer Price Sensitivity and Price Thresholds</article-title>
          .
          <source>Journal of Retailing 77</source>
          ,
          <issue>4</issue>
          (
          <year>2001</year>
          ),
          <fpage>435</fpage>
          -
          <lpage>456</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Xiangnan</surname>
            <given-names>He</given-names>
          </string-name>
          , Lizi Liao, Hanwang Zhang, Liqiang Nie, Xia Hu, and
          <string-name>
            <surname>Tat-Seng Chua</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Neural Collaborative Filtering</article-title>
          .
          <source>In Proceedings of the 26th International Conference on World Wide Web</source>
          .
          <fpage>173</fpage>
          -
          <lpage>182</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Balázs</surname>
            <given-names>Hidasi</given-names>
          </string-name>
          , Alexandros Karatzoglou, Linas Baltrunas, and
          <string-name>
            <given-names>Domonkos</given-names>
            <surname>Tikk</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Session-based Recommendations with Recurrent Neural Networks</article-title>
          .
          <source>arXiv preprint arXiv:1511.06939</source>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Yifan</surname>
            <given-names>Hu</given-names>
          </string-name>
          , Yehuda Koren, and
          <string-name>
            <given-names>Chris</given-names>
            <surname>Volinsky</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Collaborative Filtering for Implicit Feedback datasets</article-title>
          .
          <source>In 2008 Eighth IEEE International Conference on Data Mining. IEEE</source>
          ,
          <fpage>263</fpage>
          -
          <lpage>272</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Dietmar</surname>
            <given-names>Jannach</given-names>
          </string-name>
          , Malte Ludewig, and
          <string-name>
            <given-names>Lukas</given-names>
            <surname>Lerche</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Session-Based Item Recommendation in e-Commerce: On Short-Term Intents</article-title>
          , Reminders,
          <source>Trends and Discounts</source>
          .
          <volume>27</volume>
          ,
          <issue>3</issue>
          -
          <fpage>5</fpage>
          (
          <issue>Dec</issue>
          .
          <year>2017</year>
          ),
          <fpage>351</fpage>
          -
          <lpage>392</lpage>
          . https://doi.org/10.1007/s11257-017- 9194-1
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>Kalervo</given-names>
            <surname>Järvelin</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jaana</given-names>
            <surname>Kekäläinen</surname>
          </string-name>
          .
          <year>2002</year>
          .
          <article-title>Cumulated Gain-based Evaluation of IR Techniques</article-title>
          .
          <source>ACM Transactions on Information Systems (TOIS) 20</source>
          ,
          <issue>4</issue>
          (
          <year>2002</year>
          ),
          <fpage>422</fpage>
          -
          <lpage>446</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>Anil</given-names>
            <surname>Kaul and Dick R Wittink</surname>
          </string-name>
          .
          <year>1995</year>
          .
          <article-title>Empirical Generalizations about the Impact of Advertising on Price Sensitivity and Price</article-title>
          .
          <source>Marketing Science</source>
          <volume>14</volume>
          , 3_supplement (
          <year>1995</year>
          ),
          <fpage>G151</fpage>
          -
          <lpage>G160</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>Gary</given-names>
            <surname>King</surname>
          </string-name>
          and
          <string-name>
            <given-names>Langche</given-names>
            <surname>Zeng</surname>
          </string-name>
          .
          <year>2001</year>
          .
          <article-title>Logistic Regression in Rare Events Data</article-title>
          .
          <source>Political Analysis</source>
          <volume>9</volume>
          ,
          <issue>2</issue>
          (
          <year>2001</year>
          ),
          <fpage>137</fpage>
          -
          <lpage>163</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Thomas</surname>
            <given-names>N Kipf</given-names>
          </string-name>
          and
          <string-name>
            <given-names>Max</given-names>
            <surname>Welling</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Semi-Supervised Classification with Graph Convolutional Networks</article-title>
          .
          <source>arXiv preprint arXiv:1609.02907</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>David G Kleinbaum</surname>
            ,
            <given-names>K</given-names>
          </string-name>
          <string-name>
            <surname>Dietz</surname>
            ,
            <given-names>M Gail</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Mitchel</given-names>
            <surname>Klein</surname>
          </string-name>
          , and Mitchell Klein.
          <year>2002</year>
          . Logistic Regression. Springer.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Yehuda</surname>
            <given-names>Koren</given-names>
          </string-name>
          , Robert Bell, and
          <string-name>
            <given-names>Chris</given-names>
            <surname>Volinsky</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Matrix Factorization Techniques for Recommender Systems</article-title>
          .
          <source>Computer 42</source>
          ,
          <issue>8</issue>
          (
          <year>2009</year>
          ),
          <fpage>30</fpage>
          -
          <lpage>37</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Wei-Yin Loh</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Fifty Years of Classification and Regression Trees</article-title>
          .
          <source>International Statistical Review</source>
          <volume>82</volume>
          ,
          <issue>3</issue>
          (
          <year>2014</year>
          ),
          <fpage>329</fpage>
          -
          <lpage>348</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>James</surname>
            <given-names>MacQueen</given-names>
          </string-name>
          et al.
          <year>1967</year>
          .
          <article-title>Some Methods for Classification and Analysis of Multivariate Observations</article-title>
          .
          <source>In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability</source>
          , Vol.
          <volume>1</volume>
          . Oakland, CA, USA,
          <fpage>281</fpage>
          -
          <lpage>297</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <surname>Christopher</surname>
            <given-names>D</given-names>
          </string-name>
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>Hinrich</given-names>
          </string-name>
          <string-name>
            <surname>Schütze</surname>
            , and
            <given-names>Prabhakar</given-names>
          </string-name>
          <string-name>
            <surname>Raghavan</surname>
          </string-name>
          .
          <year>2008</year>
          . Introduction to Information Retrieval. Cambridge University Press.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <surname>Barak</surname>
            <given-names>A</given-names>
          </string-name>
          <string-name>
            <surname>Pearlmutter</surname>
          </string-name>
          .
          <year>1995</year>
          .
          <article-title>Gradient Calculations for Dynamic Recurrent Neural Networks: A Survey</article-title>
          .
          <source>IEEE Transactions on Neural networks 6</source>
          ,
          <issue>5</issue>
          (
          <year>1995</year>
          ),
          <fpage>1212</fpage>
          -
          <lpage>1228</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>F.</given-names>
            <surname>Pedregosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Varoquaux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gramfort</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Michel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Thirion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Grisel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Blondel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Prettenhofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Weiss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Dubourg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Vanderplas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Passos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cournapeau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brucher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Perrot</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Duchesnay</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Scikit-learn: Machine Learning in Python</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          <volume>12</volume>
          (
          <year>2011</year>
          ),
          <fpage>2825</fpage>
          -
          <lpage>2830</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>Stefen</given-names>
            <surname>Rendle</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Factorization Machines</article-title>
          .
          <source>In 2010 IEEE International Conference on Data Mining. IEEE</source>
          ,
          <fpage>995</fpage>
          -
          <lpage>1000</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <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>2012</year>
          .
          <article-title>BPR: Bayesian Personalized Ranking from Implicit Feedback</article-title>
          .
          <source>arXiv preprint arXiv:1205.2618</source>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <surname>Douglas</surname>
            <given-names>A</given-names>
          </string-name>
          <string-name>
            <surname>Reynolds</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Gaussian Mixture Models</article-title>
          .
          <source>Encyclopedia of Biometrics</source>
          <volume>741</volume>
          (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <surname>Badrul</surname>
            <given-names>Sarwar</given-names>
          </string-name>
          , George Karypis, Joseph Konstan,
          <string-name>
            <given-names>and John</given-names>
            <surname>Riedl</surname>
          </string-name>
          .
          <year>2001</year>
          .
          <article-title>Item-based Collaborative Filtering Recommendation Algorithms</article-title>
          .
          <source>In Proceedings of the 10th International Conference on World Wide Web</source>
          .
          <fpage>285</fpage>
          -
          <lpage>295</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <surname>Venkatesh</surname>
            <given-names>Shankar</given-names>
          </string-name>
          , Arvind Rangaswamy, and
          <string-name>
            <given-names>Michael</given-names>
            <surname>Pusateri</surname>
          </string-name>
          .
          <year>1999</year>
          .
          <article-title>The Online Medium and Customer Price Sensitivity</article-title>
          . Working
          <string-name>
            <surname>Paper</surname>
          </string-name>
          (
          <year>1999</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>Brent</given-names>
            <surname>Smith</surname>
          </string-name>
          and
          <string-name>
            <given-names>Greg</given-names>
            <surname>Linden</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Two Decades of Recommender Systems at Amazon.com</article-title>
          .
          <source>IEEE Internet Computing</source>
          <volume>21</volume>
          ,
          <issue>3</issue>
          (
          <year>2017</year>
          ),
          <fpage>12</fpage>
          -
          <lpage>18</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <surname>Jaime</surname>
            <given-names>Teevan</given-names>
          </string-name>
          , Susan T. Dumais, and
          <string-name>
            <given-names>Eric</given-names>
            <surname>Horvitz</surname>
          </string-name>
          .
          <year>2005</year>
          .
          <article-title>Personalizing Search via Automated Analysis of Interests and Activities</article-title>
          .
          <source>In Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (Salvador, Brazil) (SIGIR '05)</source>
          .
          <article-title>Association for Computing Machinery</article-title>
          , New York, NY, USA,
          <fpage>449</fpage>
          -
          <lpage>456</lpage>
          . https://doi.org/10.1145/1076034.1076111
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <surname>Flavian</surname>
            <given-names>Vasile</given-names>
          </string-name>
          , Elena Smirnova, and
          <string-name>
            <given-names>Alexis</given-names>
            <surname>Conneau</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Meta-prod2vec: Product Embeddings using side-information for Recommendation</article-title>
          .
          <source>In Proceedings of the 10th ACM Conference on Recommender Systems</source>
          .
          <volume>225</volume>
          -
          <fpage>232</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <surname>Kirk L Wakefield</surname>
            and
            <given-names>J Jefrey</given-names>
          </string-name>
          <string-name>
            <surname>Inman</surname>
          </string-name>
          .
          <year>2003</year>
          .
          <article-title>Situational Price Sensitivity: the Role of Consumption Occasion, Social Context and Income</article-title>
          .
          <source>Journal of Retailing 79</source>
          ,
          <issue>4</issue>
          (
          <year>2003</year>
          ),
          <fpage>199</fpage>
          -
          <lpage>212</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <surname>Matei</surname>
            <given-names>Zaharia</given-names>
          </string-name>
          , Reynold S. Xin, Patrick Wendell,
          <string-name>
            <surname>Tathagata Das</surname>
          </string-name>
          ,
          <string-name>
            <surname>Michael Armbrust</surname>
            , Ankur Dave, Xiangrui Meng, Josh Rosen, Shivaram Venkataraman,
            <given-names>Michael J.</given-names>
          </string-name>
          <string-name>
            <surname>Franklin</surname>
            , Ali Ghodsi,
            <given-names>Joseph</given-names>
          </string-name>
          <string-name>
            <surname>Gonzalez</surname>
            ,
            <given-names>Scott</given-names>
          </string-name>
          <string-name>
            <surname>Shenker</surname>
            , and
            <given-names>Ion</given-names>
          </string-name>
          <string-name>
            <surname>Stoica</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Apache Spark: A Unified Engine for Big Data Processing</article-title>
          .
          <source>Commun. ACM</source>
          <volume>59</volume>
          ,
          <issue>11</issue>
          (Oct.
          <year>2016</year>
          ),
          <fpage>56</fpage>
          -
          <lpage>65</lpage>
          . https://doi.org/10.1145/2934664
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <string-name>
            <surname>Yu</surname>
            <given-names>Zheng</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Chen</given-names>
            <surname>Gao</surname>
          </string-name>
          , Xiangnan He,
          <string-name>
            <given-names>Yong</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Depeng</given-names>
            <surname>Jin</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>Price-Aware Recommendation with Graph Convolutional Networks</article-title>
          .
          <source>In 2020 IEEE 36th International Conference on Data Engineering (ICDE)</source>
          . IEEE,
          <fpage>133</fpage>
          -
          <lpage>144</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>