<!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>Measuring Feature Quality for Improved Ranking Performance⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Sulagna Gope</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ravi Sugandharaju</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anup Kotalwar</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vamsi Salaka</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Amazon Search</institution>
          ,
          <addr-line>Bangalore</addr-line>
          ,
          <country country="IN">India</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Amazon Search</institution>
          ,
          <addr-line>Palo Alto</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Learning-to-rank models are mostly evaluated based on how good it is able to estimate the user behaviour. Output metrics like NDCG become the obvious choice for the purpose. A model is considered to have a good performance if it is able to predict the correct ranked ordering, else it is considered to be of poor quality. However the performance of a model is not only dependent on the prediction power of the model but also the quality of input features. Hence evaluation via output metrics like NDCG does not truly reflect the underlying problem. In this paper we introduce a simple feature coverage metric (FeCo) that can be used for tracking feature quality for diagnostic purpose as well as to get insight into model performance. Our experiments show that FeCo score is correlated with output metrics like NDCG. We also found that even a small change in FeCo score during training can have significant impact on the feature's contribution to the model. Our findings provide a perspective of having a 360 degree evaluation of model performance for ranking in production setup.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;learning-to-rank</kwd>
        <kwd>IR metrics</kwd>
        <kwd>explainability</kwd>
        <kwd>feature importance</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Features play a crucial role in learning-to-rank models. The ranked list of items in e-commerce
is not only dependent on the model’s predictive power but also the quality of input features.
In real world large scale e-commerce stores, ensuring a good data quality can become a major
challenge. Real world data is often characterised by sparse features. Additionally, poor feature
design may also lead to noise or sparsity that in turn afects ranking. During ofline model
training, we often sample a set of the data, post-process it to get a cleaner version that is finally
used for training models. However at inference time, noisy or sparse features may lead to poor
ranking. This gives rise to a gap between ofline and online evaluation metrics. Moreover,
tracking feature quality can be useful for diagnostic purpose and to understand overall trends.</p>
      <p>In order to have a full 360 degree view of model performance, we propose a feature evaluation
metric FeCo that evaluates the coverage of ranking features. To the best of our knowledge
currently there does not exist any such metric that measures the quality of ranking features.
Most of the existing metrics in the field of information retrieval (IR) evaluates a model based on
the output produced. This does not give a full insight into the model. Essentially the ranking
performance may still remain poor if model complexity is increased without focusing on the
quality of input metrics. To validate the utility of the new metric, we conducted experiments on
in-house Amazon product search dataset as well as one of the publicly available dataset. Our
experiments show a high correlation between FeCo and output metrics like NDCG. Furthermore,
we show that the metric can give more insight into the nature of the data. In this study we
have also explored the impact of FeCo change on model explainability. Though this study has
been performed for learning-to-rank models, this can also be extended to any other machine
learning models in large scale production setup.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Learning-to-rank models are generally evaluated using output evaluation metrics which are
based on user interactions. Some of the common metrics include Discounted Cumulative Gain
(DCG) and Normalised DCG [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ], Rank-based precision [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], Expected reciprocal rank [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ],
Expected browsing utility [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], Time-based gain [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], U-measure [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], INSQ [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ],INST [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and so
on. Recently user model based evaluations have been extended to session based evaluations
[
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ]. Ranking models essentially try to simulate the user behaviour under operational
conditions. There has been some efort to understand and characterize user behaviour models
[
        <xref ref-type="bibr" rid="ref12 ref9">12, 9</xref>
        ]. [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] introduced an anchor-aware evaluation metric where user’s bias towards initial
values or starting points is taken into consideration for evlauation of IR systems.
      </p>
      <p>
        On the other hand, recently there has been a lot of efort on model explainability to get
better insight into machine learning based retrieval models. Estimating feature importances
in model training using SHAP values, has been widely used for model explanation [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. For
latent factor models, explanability has been attempted by aligning each latent factor with an
explicit meaning such as item features [
        <xref ref-type="bibr" rid="ref15 ref16 ref17">15, 16, 17</xref>
        ]. Recently many neural algorithms have been
developed with explainable recommendations. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] proposed to explain recommender models
by highlighting important words in user reviews. In [
        <xref ref-type="bibr" rid="ref19 ref20">19, 20</xref>
        ] model explanation is achieved
by ranking user review sentences. [
        <xref ref-type="bibr" rid="ref21">21, 22</xref>
        ] proposed a visual recommendation approach by
highlighting the important regions in the image. It is evident from the existing literature that
input features play an important role in model performance. However, quality of input features
are rarely considered while evaluating the learning models. Our work is novel in the sense that
we give a simple measure of feature quality that can be indicative of the output performance of
the model and afect the internal working of the model.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. FeCo Design</title>
      <p>FeCo metric computation involves three main steps. In the first step, we sample data instances
from past user logs for the required period of time. This is followed by feature extraction step
and finally the computation of the metric. In the following subsections, we provide the details
of each of the steps.</p>
      <sec id="sec-3-1">
        <title>3.1. Data Sampling</title>
        <p>Since real world e-commerce applications may witness a high amount of trafic daily, we propose
to sample a smaller set of events from the actual user logs on which we measure FeCo. Some
of the popular sampling techniques are 1) random sampling 2) stratified and cluster sampling
and 3) systematic sampling. Reservoir sampling is another popular sampling technique mostly
applicable in case of sampling from streaming data. Though our use case also involves streaming
data, we perform the metric computation in ofline setup rather than in real time. Our sampling
approach is close to systematic sampling. Since the trafic varies across a day in e-commerce
sites, we propose to pick a few time windows across a day and sample a fixed set of instances
from each window. We compared diferent strategies by varying the number of windows in a day
and number of samples from each window. We set the window size to be of 10 minutes duration.
Based on our study we found that 8 uniformly distributed windows with 200K samples from
each window to be a close approximation to the actual trafic distribution. We used this strategy
to sample data points from daily logs for FeCo computation. Note that this configuration can be
varied based on the nature of diferent e-commerce stores.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. FeCo Computation</title>
        <p>In theory, FeCo can be computed on any input feature to a ranking model. However to have more
meaningful insights into ranking performance, we select a few features for FeCo computation.
We prefer to compute FeCo for features which are important contributors to ranking models
and are user-centric in nature. Feature coverage or FeCo measures the percentage of events
where the feature has non-zero value compared to all the events. Here an event simply refers to
a search event where a user visits an e-commerce site, performs some keyword search and gets
a list of ranked products. Such events are generally logged in the search backend for purpose
of future model training. We extract the required feature values for the sampled events and
compute FeCo for the same using equation 1.</p>
        <p>where
  =
∑︀=0 I ()
∑︀</p>
        <p>=0 
I () =
{︃
1 if  () &gt; 0
0 otherwise
(1)
(2)
In equation 1 and 2,   , stands for FeCo score for feature  ,  is the number of events
sampled. Here we have considered the threshold for coverage to be greater than 0. Based on
the nature of the feature, one may also consider the threshold to be the mean or median of the
feature values. FeCo can be measured as a percentage by multiplying the score with 100.</p>
        <p>Since FeCo is used for tracking and measuring feature quality health, it is important to ensure
that it is stable and movable. Based on our study on in-house Amazon dataset, we observed that
the FeCo score on user engagement based signals show considerable variation between days. In
order to get a smooth trend, we compute a moving average of the score over a 7 days window.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experiments</title>
      <sec id="sec-4-1">
        <title>4.1. Dataset</title>
        <p>In this section we describe the datasets and the experiment performed with the proposed metric.
We have performed our study on a sample of Amazon search data, comprising of query-product
pairs which were anonymized and post-processed to remove user specific information. For
computing FeCo, we extracted the query and product based features that are used in product
search ranking in Amazon. Additionally we have performed our study on the publicly available
MSLR-WEB10K [23] dataset. The study on the public dataset is done for purpose of research, to
show the generalization power and wider applicability of the proposed metric.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Relation between FeCo and NDCG metrics</title>
        <p>In this experiment we tried to study the impact of FeCo on output NDCG metric. We performed
the experiment on public dataset WEB10K, and an in-house Amazon product search ranking
dataset. We trained a LightGBM model for ranking for both the datasets. In the first set, we
trained and evaluated the model using the standard available dataset, as our baseline. We then
reduced the coverage of a few top features in the test set, by setting their value to 0. We then
reduced the feature coverage in both the train and test set, retrained our model and computed
the NDCG metric. In all these cases, we used the same set of parameters for model training and
test. We have only reported NDCG@4 and NDCG@8 for our experiments. We varied the FeCo
score and reported the impact on NDCG in the Table 1 for Web10K dataset.</p>
        <p>It is to be noted that the impact of FeCO on output metrics like NDCG also depends on the
type of model. For example some of the machine learning models like decision trees are more
robust to noisy data than other other models. More robust the model is to noisy data, lesser will
be the impact of FeCo score on output metrics. In this study we only present the results for
tree based LightGBM model[24]. Comparative study of the impact of FeCO on other types of
models is left as part of future scope.</p>
        <p>In Table 2 we show the impact of coverage drop on NDCG for an internal Amazon search
dataset.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Model Explanability with FeCo</title>
        <p>Model explainability is often characterised by feature importance in trained model. In this
experiment we studied the efect of coverage on feature importance. As a baseline, we first
trained a LightGBM model on full training data. We then decreased the coverage of some of the
top important features and studied the efect on the feature importance.</p>
        <p>In Figure 1 we show the baseline feature importance for the top few important features as
obtained from the LightGBM model trained on the actual dataset. We have used the standard
LightGBM library to compute the feature importances. We then decreased the feature coverage
of the top few features by 5 and observed that the importance of that feature drops significantly.
Moreover, the importances of the other features also change, indicating that the model undergoes
considerable changes by even a minor drop in feature coverage. In Figure 2 we show the feature
importance curve for Web10K dataset where the coverage of feature _267 is decreased by
5%.</p>
        <p>We performed similar study with respect to the ranking model that powers product search in
Amazon. Decrease in FeCo leads to lesser contribution of the feature during model training. We
hence infer that a high FeCo score of all the ranking features helps the model to pick up the
right set of features and eventually improve ranking performance. In our study we also found
that FeCo drop in more important features has more impact on output NDCG compared to FeCo
drop in less important features. However whether there is a direct relationship between feature
importance and impact of FeCo drop requires more detailed analysis as feature importance
depends on other features and the prediction model. We leave this as a scope for our next study.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Usage of FeCo</title>
      <sec id="sec-5-1">
        <title>5.1. Tracking Cold Start with FeCo</title>
        <p>It has been found in practice, that ranking models perform better when they leverage past
customer engagement data for query-item pairs, besides the item metadata features. However
past engagement signals when used in ranking models, give rise to an inherent bias where more
a product is clicked in the past, the more it has a chance of being ranked higher up, eventually
giving rise to cold start problem for new products with lesser customer engagement. A direct
comparison of FeCo on engagement based ranking features for cold start products and older
relevant products would help in understanding the cold start impact. Tracking FeCO over a
period of time, can help in understanding the growth of engagement based features coverage
for new ASINs. For large scale e-commerce search engines FeCo can quantify the magnitude
of cold start problem and also track the reduction in cold start over time. In the figure 3 we
show a comparison between FeCo on behavioural features for some old versus new products in
Amazon, tracked over a period of time.</p>
      </sec>
      <sec id="sec-5-2">
        <title>5.2. Tracking customer behaviour OR overall ranking improvements in newly launched locations</title>
        <p>E-commerce systems also sufer from a generic cold start problem when launched in new
locations. Since towards the beginning of a launch the customer base is small, it does not
give rise to significant engagements that can potentially improve ranking. Due to this ranking
models often rely on metadata features only for such scenarios. Over time the engagement
based features start getting more coverage and tends to contribute more towards ranking. FeCo
can be used in such case to track the feature dynamics in newly launched locations.</p>
        <p>In general, FeCo can be used for monitoring feature health in large scale applications. It
is also insightful to study FeCo across diferent segments like product groups, head/torso/tail
queries, regions, etc.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion</title>
      <p>In this paper we explored the feature coverage metric aka FeCo for evaluation of ranking
features in production e-commerce applications. Through this study we show that this simple
metric has a strong correlation with output metrics and model explainability through feature
importance. In the future scope we would like to attempt to unify FeCo with output metrics
like NDCG to have a single metric for overall model evaluation. We would further like to study
the impact of FeCo on output for diferent types of models and also for applications beyond
ranking.
ommendation with visual explanations based on multimodal attention network: Towards
visually explainable recommendation, 765–774, 2019.
[22] S. Geng, Z. Fu, Y. Ge, L. Li, G. de Melo, Y. Zhang (Eds.), Improving Personalized Explanation</p>
      <p>Generation through Visualization, 244–255, 2022.
[23] T. Qin, T. Liu, Introducing LETOR 4.0 datasets, CoRR abs/1306.2597 (2013).
[24] G. Ke, Q. Meng, T. Finley, T. Wang, W. Chen, W. Ma, Q. Ye, T.-Y. Liu, Lightgbm: A highly
eficient gradient boosting decision tree, Advances in neural information processing
systems 30 (2017).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>K.</given-names>
            <surname>Järvelin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kekäläinen</surname>
          </string-name>
          ,
          <article-title>Cumulated gain-based evaluation of ir techniques</article-title>
          ,
          <source>ACM Transactions on Information Systems (TOIS) 20</source>
          (
          <year>2002</year>
          )
          <fpage>422</fpage>
          -
          <lpage>446</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>K.</given-names>
            <surname>Järvelin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. L.</given-names>
            <surname>Price</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. M.</given-names>
            <surname>Delcambre</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. L.</surname>
          </string-name>
          Nielsen (Eds.),
          <article-title>Discounted cumulated gain based evaluation of multiple-query IR sessions</article-title>
          ,
          <volume>4</volume>
          -
          <fpage>15</fpage>
          , Springer,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Mofat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zobel</surname>
          </string-name>
          ,
          <article-title>Rank-biased precision for measurement of retrieval efectiveness</article-title>
          ,
          <source>ACM Transactions on Information Systems (TOIS) 27</source>
          (
          <year>2008</year>
          )
          <fpage>1</fpage>
          -
          <lpage>27</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>O.</given-names>
            <surname>Chapelle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Metlzer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , P. Grinspan (Eds.),
          <article-title>Expected reciprocal rank for graded relevance</article-title>
          ,
          <fpage>621</fpage>
          -
          <lpage>630</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>E.</given-names>
            <surname>Yilmaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Shokouhi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Craswell</surname>
          </string-name>
          , S. Robertson (Eds.),
          <article-title>Expected browsing utility for web search evaluation</article-title>
          ,
          <fpage>1561</fpage>
          -
          <lpage>1564</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M. D.</given-names>
            <surname>Smucker</surname>
          </string-name>
          ,
          <string-name>
            <surname>C. L.</surname>
          </string-name>
          Clarke (Eds.),
          <source>Time-based calibration of efectiveness measures</source>
          ,
          <fpage>95</fpage>
          -
          <lpage>104</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>T.</given-names>
            <surname>Sakai</surname>
          </string-name>
          ,
          <string-name>
            <surname>Z.</surname>
          </string-name>
          Dou (Eds.),
          <article-title>Summaries, ranked retrieval and sessions: A unified framework for information access evaluation</article-title>
          ,
          <fpage>473</fpage>
          -
          <lpage>482</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.</given-names>
            <surname>Mofat</surname>
          </string-name>
          , P. Thomas,
          <string-name>
            <given-names>F.</given-names>
            <surname>Scholer</surname>
          </string-name>
          (Eds.),
          <article-title>Users versus models: What observation tells us about efectiveness metrics</article-title>
          ,
          <fpage>659</fpage>
          -
          <lpage>668</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Mofat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bailey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Scholer</surname>
          </string-name>
          , P. Thomas (Eds.),
          <source>INST: An adaptive metric for information retrieval evaluation</source>
          , 1-
          <fpage>4</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A. F.</given-names>
            <surname>Wicaksono</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mofat</surname>
          </string-name>
          ,
          <article-title>Modeling search and session efectiveness</article-title>
          ,
          <source>Information Processing &amp; Management</source>
          <volume>58</volume>
          (
          <year>2021</year>
          )
          <fpage>102601</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Lipani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Carterette</surname>
          </string-name>
          , E. Yilmaz (Eds.),
          <article-title>From a user model for query sessions to session rank biased precision (sRBP</article-title>
          ),
          <fpage>109</fpage>
          -
          <lpage>116</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>B.</given-names>
            <surname>Carterette</surname>
          </string-name>
          (Ed.),
          <article-title>System efectiveness, user models, and user utility: a conceptual framework for investigation</article-title>
          ,
          <fpage>903</fpage>
          -
          <lpage>912</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>N.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , T. Sakai (Eds.),
          <article-title>Constructing Better Evaluation Metrics by Incorporating the Anchoring Efect into the User Model</article-title>
          ,
          <fpage>2709</fpage>
          -
          <lpage>2714</lpage>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>I. E.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Venkatasubramanian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Scheidegger</surname>
          </string-name>
          , S. Friedler (Eds.),
          <article-title>Problems with Shapley-value-based explanations as feature importance measures</article-title>
          ,
          <fpage>5491</fpage>
          -
          <lpage>5500</lpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , T. Xu (Eds.),
          <article-title>Learning to rank features for recommendation over multiple categories</article-title>
          ,
          <fpage>305</fpage>
          -
          <lpage>314</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , G. Lai,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Y. Liu, S. Ma (Eds.),
          <article-title>Explicit factor models for explainable recommendation based on phrase-level sentiment analysis</article-title>
          ,
          <fpage>83</fpage>
          -
          <lpage>92</lpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , H. Zhang,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Y. Liu, S. Ma (Eds.),
          <article-title>Do users rate or review? Boost phrase-level sentiment labeling with review-level sentiment classification</article-title>
          ,
          <fpage>1027</fpage>
          -
          <lpage>1030</lpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>S.</given-names>
            <surname>Seo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yang</surname>
          </string-name>
          , Y. Liu (Eds.),
          <article-title>Interpretable convolutional neural networks with dual local and global attention for review rating prediction</article-title>
          ,
          <fpage>297</fpage>
          -
          <lpage>305</lpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <surname>Z.</surname>
          </string-name>
          Qin (Eds.),
          <source>Dynamic explainable recommendation based on neural attentive models</source>
          , volume
          <volume>33</volume>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>L.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , L. Chen (Eds.),
          <article-title>Extra: Explanation ranking datasets for explainable recommendation</article-title>
          ,
          <fpage>2463</fpage>
          -
          <lpage>2469</lpage>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Qin</surname>
          </string-name>
          , H. Zha (Eds.), Personalized fashion rec-
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>