<!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>
      <article-id pub-id-type="doi">10.1145/nnnnnnn.nnnnnnn</article-id>
      <title-group>
        <article-title>Did We Get It Right? Predicting ery Performance in E-commerce Search</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Rohan Kumar</string-name>
          <email>rohankumar@ipkart.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Neil Shah∗</string-name>
          <email>neilshah@cs.cmu.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Information Retrieval, Evaluation, ery Performance, e-commerce,</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mohit Kumar</string-name>
          <email>k.mohit@ipkart.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Christos Faloutsos</string-name>
          <email>christos@cs.cmu.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Carnegie Mellon University</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Flipkart</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>mobile search behavior</institution>
          ,
          <addr-line>implicit feedback</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <abstract>
        <p>In this paper, we address the problem of evaluating whether results served by an e-commerce search engine for a query are good or not. is is a critical question in evaluating any e-commerce search engine. While this question is traditionally answered using simple metrics like query click-through rate (CTR), we observe that in ecommerce search, such metrics can be misleading. Upon inspection, we nd cases where CTR is high but the results are poor and vice versa. Similar cases exist for other metrics like time to click which are oen also used for evaluating search engines. We aim to learn the quality of the results served by the search engine based on users' interactions with the results. Although this problem has been studied in the web search context, this is the rst study for e-commerce search, to the best of our knowledge. Despite certain commonalities with evaluating web search engines, there are several major dierences such as underlying reasons for search failure, and availability of rich user interaction data with products (e.g. adding a product to the cart). We study largescale user interaction logs from Flipkart's1 search engine, analyze behavioral paerns and build models to classify queries based on user behavior signals. We demonstrate the feasibility and ecacy of such models in accurately predicting query performance. Our classier is able to achieve an average AUC of 0.75 on a held-out test set.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Permission to make digital or hard copies of part or all of this work for personal or
classroom use is granted without fee provided that copies are not made or distributed
for prot or commercial advantage and that copies bear this notice and the full citation
on the rst page. Copyrights for third-party components of this work must be honored.
For all other uses, contact the owner/author(s).</p>
      <p>SIGIR 2018 eCom, Ann Arbor, Michigan, USA
© 2018 Copyright held by the owner/author(s). 978-x-xxxx-xxxx-x/YY/MM. . . $15.00
DOI: 10.1145/nnnnnnn.nnnnnnn</p>
    </sec>
    <sec id="sec-2">
      <title>INTRODUCTION</title>
      <p>
        Search engines are a fundamental component of most modern
Internet applications, and evaluating their performance on a query
is not only needed for evaluating their overall performance, but is
also critical in the iterative process of improving the algorithms
that power them. is is important since bad performance of a
search engine leads to customer arition as described in White and
Dumais [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Traditionally, the performance of a search engine on a
query is measured using metrics derived from ordinal ratings of the
search results given by human experts [
        <xref ref-type="bibr" rid="ref13 ref23 ref4">4, 13, 23</xref>
        ]. However,
obtaining such manual judgments is prohibitive for the large document
collections and high number of unique queries commonly
encountered in most modern Internet applications. While one could solicit
explicit feedback on the quality of search results from the users of
a search engine, this may be detrimental to their experience of the
application.
      </p>
      <p>
        More recent work [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] has focused on automating the
evaluation of search engine performance by using implicit feedback on
the quality of search results derived from various user activity
signals generated by the interactions between users and the results
presented to them. Most of this work has been done for Internet
search engines while in this paper, we focus on e-commerce search
engines. e users of e-commerce applications tend to look for
products and services, and thus the queries typically encountered
by e-commerce search engines are fundamentally dierent from
the informational and navigational queries typically encountered
by Internet search engines.
      </p>
      <p>
        e most popular user activity signal in the aforementioned work
is clicks and it is used to dene the Click-rough Rate (CTR) metric.
e CTR of a query is oen used as a proxy for the performance of
the search engine on that query, and this approximation is based on
the assumption that clicks on search results are a reliable indicator
of performance. However, Hassan et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] points out that while
clicks are a useful indicator of performance, they can nevertheless
be quite noisy.
      </p>
      <p>We validate this observation for e-commerce search by
studying the distributions of the ordinal ratings of search results given
by human experts to queries having a wide range of CTR values
randomly sampled from Flipkart search query-logs. We discretized
the CTR values into 5 buckets with the bucket boundaries at the
20th, 40th, 60th, and 80th percentiles of the CTR values of our
sampled queries. e distributions of search result ratings across
these percentile-based CTR buckets is shown in Figure 2. e
details of how queries are sampled from our query-logs and how the
associated search results are rated by human experts are given in
Section 3.</p>
      <p>
        From Figure 2 it is evident that while the fraction of queries
whose results are rated as poor decreases as we go from the
lowest CTR bucket to the highest CTR bucket, a signicant fraction
of queries whose results are rated as bad still exists even in the
highest CTR bucket. Figure 1 shows an example of a search engine
results page (SERP) that appears in Flipkart’s mobile app for the
query “sling bags women lavie”. e query has good results even
though it belongs to the 0-20% CTR bucket from Figure 2. is
highlights the need for a richer set of user activity signals beyond
click behavior. Guo et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] made use of such signals, but their
focus was on Internet search where the set of user activity signals
available is limited in comparison to e-commerce search, where
we have additional signals available such as the time taken to click
an add-to-cart or buy-now buon. Using a richer set of such user
activity signals, we build a classication model to predict whether
the results for any query from our query-logs would be rated as
bad or good by human experts and thus automate the evaluation
of our search engine performance. Such a system also serves as a
rst step towards building a system to predict user satisfaction at
the level of individual user activity sessions as studied in [
        <xref ref-type="bibr" rid="ref18 ref6 ref9">6, 9, 18</xref>
        ].
      </p>
      <p>Our classier is able to achieve an average AUC of 0:75 on a
held-out test set. On certain product categories like Mobile Phones,
we achieve an average AUC of 0:88 on the held-out test set.</p>
      <p>Summarily, the primary contributions of our work are:
(1) We identify a rich set of user activity signals that help
predict whether the results for any search query would be
rated as bad or good by human experts.
(2) We demonstrate that it is possible to use user activity
signals to automate the evaluation of search engine
performance for e-commerce applications.
(3) We analyze the performance of our classier and derive
insights into the eectiveness of automated systems for
evaluating search engine performance that are of particular
interest to e-commerce applications.
2
2.1</p>
    </sec>
    <sec id="sec-3">
      <title>RELATED WORK ery Performance</title>
      <p>
        Evaluating search engine performance has been well-studied in
the domain of web search. Topical relevance based metrics like
nDCG [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], expected reciprocal rank [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and weighted information
gain [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] require explicit human labeled relevance judgments for
query-document pairs which are prohibitively costly to calculate
at scale for real-world web scale evaluation.
      </p>
      <p>
        Several methods were proposed to automatically measure
various characteristics of the documents retrieved for a query, which
can then be used for measuring overall system performance. Clarity
score [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] evaluates query performance by measuring the relative
entropy between query language model and corresponding
collection language model. e Robustness score [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] exploits the
fact that query-level ranking robustness is correlated with retrieval
performance. It is measured as the expected value of Spearman's
rho between ranked lists from original collection and a corrupted
collection. Carmel et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] nd Jensen-Shannon divergence
between queries, relevant documents and the entire collection to
be an indicator of query performance. However, [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]
experimentally show the ineectiveness of these metrics in measuring search
performance on web-scale engines.
      </p>
      <p>
        User click behavior has been used as an alternative to expert
judgments for automatically tuning retrieval algorithms (predicting
document relevance) as well as estimating IR evaluation metrics
[
        <xref ref-type="bibr" rid="ref15 ref3 ref7 ref8">3, 7, 8, 15</xref>
        ]. Kim et al. [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] show that only analysing user clicks
naively may not indicate satisfaction, but rather using dwell time
per click appropriately indicates query level satisfaction in a beer
manner. Guo et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] also make use of interaction features and
engine switches as signals to predict DCG@3.
2.2
      </p>
    </sec>
    <sec id="sec-4">
      <title>Search Session Performance</title>
      <p>
        ere has been considerable work in the area of analyzing user
satisfaction at a session level rather than at an individual query
level. Fox et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] conducted one of the rst studies that found
association between explicit ratings and implicit measures of user
interest, concluding that user satisfaction can be predicted using
such implicit signals. Hassan et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] show empirically that user
behavior alone can give an accurate picture of the success of the
user's web search goals, without considering the relevance of the
documents displayed. ere have been studies focusing on graded
satisfaction [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] as well as specic user behaviors like query
reformulation [
        <xref ref-type="bibr" rid="ref10 ref18">10, 18</xref>
        ] and interaction sequences [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] for understanding
satisfaction.
2.3
      </p>
    </sec>
    <sec id="sec-5">
      <title>E-commerce Search Performance</title>
      <p>
        Most studies have been geared towards web search where user
search goals are dierent from those in product/e-commerce search.
However, there has been some work recently in the context of
product search. Singh et al. [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] study the user behavior in the
e-commerce search context in a specic scenario when the search
engine doesn’t retrieve any results. [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] is a recent study that
addresses the user’s session satisfaction in product search. ey
approach the problem by rstly identifying a taxonomy of user
intents while interacting with product search, and then analyze
the user’s behavior in the context of the dened taxonomy. ey
predict user session satisfaction by utilizing the interaction
behavior, where they build separate models for dierent intents with the
demonstration that user behavior is dierent under dierent intents.
Our work, while building upon the learnings from these studies,
diers in that we are interested in measuring only the aggregate
query performance instead of more user-centric task of session
satisfaction. e example mentioned by Su et al. [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] where the
results expected by two dierent users for the same query iphone
may be dierent and thus they may be individually dissatised even
though the results shown are “relevant.” We aim to address the
simpler, albeit more business-critical problem of understanding a
query’s result relevance in a user-agnostic fashion. e underlying
reason(s) for a search engine’s poor query performance is due to
factors like incorrect spell error handling, vocabulary gap [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ],
selection gap (when the e-commerce platform does not sell a particular
item – e.g. chocolate when packaged food items are not sold), and
more. us understanding and measuring the user-agnostic query
performance can help improve the core relevance algorithm of the
search engine.
3
      </p>
    </sec>
    <sec id="sec-6">
      <title>QUERY PERFORMANCE JUDGEMENTS</title>
      <p>At Flipkart, regular search quality analysis is done for a random
sample of queries (stratied on query volume segment) from search
logs by a team of quality experts. ey are requested to rate queries
on a ve-point scale (PBAGE: Poor-1, Bad-2, Average-3, Good-4,
Excellent-5) based on result relevance. To ensure the consistency of
labeling across experts, inter-rater agreement is continuously
monitored. In this work, we make use of the expert editorial judgments
for the month of January 2018.</p>
      <p>We selected 18,613 queries from this randomized set of
expertlabeled queries which occurred more than 100 times in a week in
order to ensure reasonable user activity data. is set of queries
corresponded to 127M query impressions, 149M clicks and 14M
other interactions (e.g. lters application, sort application) from</p>
    </sec>
    <sec id="sec-7">
      <title>SIGNALS OF USER BEHAVIOR</title>
      <p>Table 1 lists the metrics along with their descriptions that we
extracted for every query instance. We characterize the user behavior
metrics as Activity time, Positional and Activity aggregates. We
characterize the non-user metrics as ery text characteristics and
Meta aspects.</p>
      <p>Activity time features capture the time taken by the user for
various activities. timeToFirstClick is the time taken by the user to click
a product aer the results are displayes. timeToFirstCart is similar
(a) Time to rst click
(b) Time to rst cart
(c) ery duration
(d) First Click Position
to timeToFirstClick except it captures time taken to add a product
to the cart. queryDuration is the total time spent in interacting with
the query results including all interactions with product pages, cart
etc. Figures 3a-3c show the distribution of Activity time features
with respect to query performance. We observe interestingly that
time taken for rst click increases with the query performance. is
is counter-intuitive in that when the query performance is good,
it still takes users longer to click. is is however potentially
explained with Figure 4a, which shows the distribution of the number
of clicks against query performance. We observe that when the
query performance is low the total number of clicks is lower and
it increases with query performance. Intuitively, the users usually
don’t click any products when the query performance is poor but
when they click products for a poorly performing query they do it
faster. Similar paern is observed for the add-to-cart behavior, in
Figures 3b and 4c.</p>
      <p>Positional features correspond to the position of result
interaction. posFirstClick captures which position the user clicked rst. A
lower position value indicates that the results were shown near the
top of the page. We observe that the average position of the rst
result click increases with improving query performance. is is
correlated with the previous observation where time to rst click
of poorly performing queries is lower and correspondingly the
user is clicking the results in lower positions (faster). e total
number of clicks is low when query performance is low. Similar
to Activity Time features, users usually don’t click products when
the query performance is poor but then they click products for a
poorly performing query they do it at lower positions.</p>
      <p>Activity aggregates features capture the aggregated summary
of user’s actions for a query. We observe that all the activity
aggregates are positively correlated with the query performance –
i.e. increasing user activity indicates beer query performance.
Number of product clicks (numClicks: Figure 4a), product swipes
(numSwipes: Figure 4b), cart additions (numCarts: Figure 4c),
lters applied (numFilters: Figure 4d), sort applied (numSorts: Figure
4e), product impressions per query (numImpressions: Figure 4f),
query successful click through rate (clickSuccess: Figure 4g), query
successful cart conversion rate (cartSuccess: Figure 4h) are all
positively correlated with query performance.</p>
      <p>
        ery text characteristics features capture the textual properties
of the query. chareryLen and worderyLen are length of query
in characters and words respectively. LMScore is the perplexity
score of the query based on a language model[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] trained on the
query logs. querySim is the text similarity between the current
query and the following query dened by the measure described in
Hassan et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. We also make use of certain domain-dependent
text features indicating if the query contains speciers (e.g. “greater
than”), modier phrases (e.g. “least expensive”), range speciers
(e.g. “between”) or units (e.g. “liters”, “gb”). e intuition here is that
search engines may face diculty in product retrieval when queries
contain such phrases which require semantic understanding.
      </p>
      <p>Meta aspect features include additional information about the
query. queryCat indicates the e-commerce product category. ese
are broad lines of business, namely Mobile Phones, Books,
Electronics, Lifestyle, and Home and Furniture. Each query is assumed
to belong to one of these categories. e intuition for using this
feature is that the query performance and user behavior might be
dependent on the specic categories. queryType indicates the type
of query which is classied amongst three kinds, namely “Product”,
“FacetCategory’ and “Category.” eries in which the exact product
that the user is looking for is mentioned are called “Product” queries
(e.g. iPhone X ). eries which refer to a broad group of products
are called “Category” queries (e.g. shoes). “FacetCategory” queries
typically contain one or more aributes followed by a category (e.g.
red Nike shoes). For both queryCat and queryType, we make use
of modules which are able to assign appropriate values for a given
query (details of these modules is outside the scope of this paper).
queryCount is the total number of times the query was issued by
users in the past week. isAutoSuggestUsed indicates whether the
user selected the query from the suggested queries (auto-suggest).
e intuition is that the queries suggested by the search engine
typically perform beer than query issued by user. isGoodNetwork
indicates whether the user has a good Internet connection (dened
as WiFi or LTE) while issuing the query. is is important, as the
user experience and behavior might be altered if he/she doesn’t
have a good Internet connection leading to bad experience
independent of the search engine’s performance. numProductsFound
indicates the total number of products found in the search index
for the query. e intuition here is that the number of products
found in conjunction with the type of the query may indicate if the
search engine is not able to retrieve relevant results.
5
5.1</p>
    </sec>
    <sec id="sec-8">
      <title>EXPERIMENTS</title>
    </sec>
    <sec id="sec-9">
      <title>Experimental setup</title>
      <p>
        In this work, we formulate the problem of query performance
prediction as a binary classication task, as is done in [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. As
described in Section 3, we obtained expert judgments for 18,613
queries across a 5-point scale. Similar to [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], we label “poor,” “bad”
and “average” queries as DSAT and “good” and “excellent” as SAT.
(a) Number of clicks
(b) Number of swipes
(c) Number of cart adds
(d) Number of lter applications
(e) Number of sort applications
(f) Number of product card
impressions
(g) Click-through rate
(h) Conversion rate
is results in 6,949 DSAT and 11,664 SAT queries. We treat DSAT
as the positive class (classier target) as the interventions in future
based on the model’s prediction will be for this class.
      </p>
      <p>We aggregate the metrics, described in previous section, across
all the instances of the query in the week to obtain aggregate user
behavior corresponding to the query. For metrics which may not
have values for all query instances (e.g. timeToFirstClick), we only
include instances for which values are present, in the aggregate
calculation. ese aggregate metrics are used as features for the
classication model. We experiment with various descriptive
statistics for the features, namely, average, median, standard deviation,
inter-quartile range5. We bin each numeric feature into 10
percentile buckets and convert them to one-hot encoded features. We
also dened certain interaction features such as clickSuccess
queryCount.</p>
      <p>We split the labeled data into 80% training and 20% test set.
During training, we performed feature selection using recursive
feature elimination along with model hyper-parameter tuning. e
hyper-parameter tuning is done using ve-fold cross validation
with class-stratication and optimized for area under the ROC
curve (AUC).
5.2</p>
    </sec>
    <sec id="sec-10">
      <title>Results</title>
      <p>We analyze the results of our model along the following aspects:
performance of learnt classier, feature importance, performance
across e-commerce categories, performance across query types and
performance across query volume. We use AUC to evaluate the
prediction performance.</p>
      <p>5.2.1 Performance of classifier. We train a binary random forest
model based on the methodology described earlier in section 5.1.
Figure 5 shows the AUC curve and Figure 6 shows the PR curve.
5In all the gures above, we show qualitative analysis of the features with only the
“averaged” metric which suciently indicates the paerns.
e overall test AUC obtained is 0.75. We observe that the classier
is able to achieve a reasonably good performance, thus
establishing that it is feasible to predict query performance based on user
interaction signals.</p>
      <p>One application of this predictive model is to enable automated
interventions for unsatisfactory queries i.e. when the classier is
condent that the results are poor, we can enable certain
interventions like triggering an interactive intent solicitation module.
Towards that end, we need a reasonably high precision operating
point. Based on discussion with business/product team, the
operating point that can be used is 85% precision where we will be able
to achieve 20% recall with the current model.
Rohan Kumar, Mohit Kumar, Neil Shah6, and Christos Faloutsos
for “Product” queries and larger number of products for “Category”
queries. Interestingly numFilters and numSorts which indicate
further renement of results are also indicative of query performance,
where based on Figures 4d and 4e we observe positive
correlation with query performance. One surprising observation is that
none of the Activity Time features are amongst the top 10 features;
even though they are indicative, they are less indicative than other
structured features like lters and sorts applied.</p>
      <p>5.2.3 Performance across categories. Table 2 shows the
performance of the model across the e-commerce categories (described in
Section 4). We observe that the model is able to predict the query
performance in “Mobile” categories considerably beer than all
other categories. We conjecture this is due to model’s performance
across query types (detailed below in section 5.2.4). e “Mobile”
category has 7x more “Product” queries compared to the “Lifestyle”
category. Additionally, “Mobile” category has 3x less “Facet
Category” queries. e model is able to perform much beer for ‘Mobile’
category due to the underlying query type distribution which is
biased towards “Product” queries. is is fairly important from
a business perspective as the “Mobile” category contributes to a
signicant portion of overall sales.</p>
      <p>5.2.4 Performance across query types. Table 3 shows the results
across query types. ere are three query types, namely, “Product,”
“Facet Category” and “Category” as discussed in Section 4.</p>
      <p>We observe that performance of “Product” queries, where the
user’s intent and language is very specic, is signicantly beer
than other query types. We conjecture that indicators like
numProductsFound and numClicks are particularly indicative of the query
performance for “Product” queries.</p>
      <p>5.2.5 Performance across query volume segments. eries are
categorized into three segments based on weekly volume: Head,
TorsoHigh and TorsoLow. Table 4 shows that classier performance
improves as the volume increases. e average queryCount for
queries belonging to the Head segment is about 34x that of queries
belonging to TorsoBoom segment. Despite the huge dierence in
amount of data available per query, the classier is able to predict
performance for queries in all three segments reasonably well.</p>
    </sec>
    <sec id="sec-11">
      <title>CONCLUSION AND FUTURE WORK</title>
      <p>Measuring search engine performance is essential to building and
improving retrieval algorithms. ery performance evaluation
allows for a ne-grained measure of search performance. CTR can
be a noisy metric in that high CTR queries may still have poor
performance, and vice versa. A more sophisticated analysis of search
behavior is needed to distinguish poor and well performing queries.
In this work, we successfully demonstrate that query performance
can be predicted based on user’s interaction with the result set. is
is the rst study to our knowledge that has collectively dened
these signals in the context of query performance prediction for
e-commerce search. Specically, we propose and use several user
interaction signals that help characterize query performance and
enabled us to achieve good classication performance using these
signals. Notably, our model achieved an overall AUC of 0.75 in the
binary SAT/DSAT prediction task. We have analyzed the results
across various factors like category of the query, query type and
query volume. Key takeaways from the performance analysis are (a)
We achieve signicantly higher AUC of 0.90 on certain categories
like “Mobile” making the result very promising from business
impact perspective, (b) Classier performance varies across query
types (“Product”, “Facet Category” and “Category”) and is best for
“Product” queries, and (c) Classier performance improves with
engagement volume, and is beer for Head queries than TorsoBoom
queries.</p>
      <p>Future Work e study can be extended to have a ner
prediction target of issue type like spell error, vocabulary gap, selection
gap etc. which would make the classier prediction more easily
actionable by giving ner details on the query. Even richer
signals of user activities can be used for prediction. For example, the
notion of good dwell time (healthy engagement such as reading
or voting on reviews) and bad dwell time (unhealthy engagement
such as changing seller) might be used. Reducing the number of
observations required (currently set to 100) for robustly predicting
query performance would be another avenue of future work. is
would allow the classier to scale an even larger number of queries
which do not have many instances in a xed time period.
7</p>
    </sec>
    <sec id="sec-12">
      <title>ACKNOWLEDGEMENTS</title>
      <p>We thank Mr. Priyank Patel and Mr. Subhadeep Maji for their
helpful comments.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>David</given-names>
            <surname>Carmel</surname>
          </string-name>
          , Elad Yom-Tov,
          <string-name>
            <given-names>Adam</given-names>
            <surname>Darlow</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Dan</given-names>
            <surname>Pelleg</surname>
          </string-name>
          .
          <year>2006</year>
          .
          <article-title>What makes a query dicult?</article-title>
          .
          <source>In Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval. ACM</source>
          ,
          <volume>390</volume>
          -
          <fpage>397</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Claudio</given-names>
            <surname>Carpineto</surname>
          </string-name>
          and
          <string-name>
            <given-names>Giovanni</given-names>
            <surname>Romano</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>A survey of automatic query expansion in information retrieval</article-title>
          .
          <source>ACM Computing Surveys (CSUR) 44</source>
          ,
          <issue>1</issue>
          (
          <year>2012</year>
          ),
          <fpage>1</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Ben</given-names>
            <surname>Cartere</surname>
          </string-name>
          e
          <string-name>
            <given-names>and Rosie</given-names>
            <surname>Jones</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Evaluating search engines by modeling the relationship between relevance and clicks</article-title>
          .
          <source>In Advances in Neural Information Processing Systems</source>
          .
          <volume>217</volume>
          -
          <fpage>224</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Olivier</given-names>
            <surname>Chapelle</surname>
          </string-name>
          , Donald Metlzer, Ya Zhang, and
          <string-name>
            <given-names>Pierre</given-names>
            <surname>Grinspan</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Expected reciprocal rank for graded relevance</article-title>
          .
          <source>In Proceedings of the 18th ACM conference on Information and knowledge management. ACM</source>
          ,
          <volume>621</volume>
          -
          <fpage>630</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Steve</given-names>
            <surname>Cronen-Townsend</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Yun</given-names>
            <surname>Zhou</surname>
          </string-name>
          , and W Bruce Cro.
          <year>2002</year>
          .
          <article-title>Predicting query performance</article-title>
          .
          <source>In Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval. ACM</source>
          ,
          <volume>299</volume>
          -
          <fpage>306</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Steve</given-names>
            <surname>Fox</surname>
          </string-name>
          , Kuldeep Karnawat, Mark Mydland, Susan Dumais, and omas White.
          <year>2005</year>
          .
          <article-title>Evaluating implicit measures to improve web search</article-title>
          .
          <source>ACM Transactions on Information Systems (TOIS) 23</source>
          ,
          <issue>2</issue>
          (
          <year>2005</year>
          ),
          <fpage>147</fpage>
          -
          <lpage>168</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Fan</given-names>
            <surname>Guo</surname>
          </string-name>
          and
          <string-name>
            <given-names>Chao</given-names>
            <surname>Liu</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Statistical Models for Web Search Click Log Analysis</article-title>
          .
          <source>In Tutorial at the 19 ACM International Conference on Information &amp; Knowledge Management (CIKM '09)</source>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Qi</given-names>
            <surname>Guo</surname>
          </string-name>
          , Ryen W White, Susan T Dumais,
          <string-name>
            <surname>Jue Wang</surname>
            , and
            <given-names>Blake</given-names>
          </string-name>
          <string-name>
            <surname>Anderson</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Predicting query performance using query, result, and user interaction features</article-title>
          .
          <source>In Adaptivity, Personalization and Fusion of Heterogeneous Information</source>
          .
          <string-name>
            <surname>LE CENTRE DE HAUTES ETUDES INTERNATIONALES D'INFORMATIQUE DOCUMENTAIRE</surname>
          </string-name>
          ,
          <volume>198</volume>
          -
          <fpage>201</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Ahmed</given-names>
            <surname>Hassan</surname>
          </string-name>
          , Rosie Jones, and Kristina Lisa Klinkner.
          <year>2010</year>
          .
          <article-title>Beyond DCG: User Behavior As a Predictor of a Successful Search</article-title>
          .
          <source>In Proceedings of the ird ACM International Conference on Web Search and Data Mining (WSDM '10)</source>
          . ACM, New York, NY, USA,
          <fpage>221</fpage>
          -
          <lpage>230</lpage>
          . hps://doi.org/10.1145/1718487.1718515
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Ahmed</surname>
            <given-names>Hassan</given-names>
          </string-name>
          , Xiaolin Shi,
          <string-name>
            <given-names>Nick</given-names>
            <surname>Craswell</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Bill</given-names>
            <surname>Ramsey</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Beyond Clicks: ery Reformulation As a Predictor of Search Satisfaction</article-title>
          .
          <source>In Proceedings of the 22Nd ACM International Conference on Information &amp; Knowledge Management (CIKM '13)</source>
          . ACM, New York, NY, USA,
          <fpage>2019</fpage>
          -
          <lpage>2028</lpage>
          . hps: //doi.org/10.1145/2505515.2505682
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Ahmed</surname>
            <given-names>Hassan</given-names>
          </string-name>
          , Ryen W White, Susan T Dumais,
          <article-title>and</article-title>
          <string-name>
            <given-names>Yi-Min</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Struggling or exploring?: disambiguating long search sessions</article-title>
          .
          <source>In Proceedings of the 7th ACM international conference on Web search and data mining. ACM</source>
          ,
          <volume>53</volume>
          -
          <fpage>62</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Kenneth</given-names>
            <surname>Hea</surname>
          </string-name>
          eld.
          <year>2011</year>
          .
          <article-title>KenLM: Faster and smaller language model queries</article-title>
          .
          <source>In Proceedings of the Sixth Workshop on Statistical Machine Translation. Association for Computational Linguistics</source>
          ,
          <fpage>187</fpage>
          -
          <lpage>197</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Kalervo</surname>
            <given-names>Ja</given-names>
          </string-name>
          <article-title>¨rvelin and Jaana Keka¨la¨inen</article-title>
          .
          <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="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Jiepu</surname>
            <given-names>Jiang</given-names>
          </string-name>
          , Ahmed Hassan Awadallah,
          <string-name>
            <given-names>Xiaolin</given-names>
            <surname>Shi</surname>
          </string-name>
          , and
          <string-name>
            <surname>Ryen</surname>
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>White</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Understanding and Predicting Graded Search Satisfaction</article-title>
          .
          <source>In Proceedings of the Eighth ACM International Conference on Web Search and Data Mining (WSDM '15)</source>
          . ACM, New York, NY, USA,
          <fpage>57</fpage>
          -
          <lpage>66</lpage>
          . hps://doi.org/10.1145/2684822.2685319
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15] orsten Joachims, Laura Granka, Bing Pan, Helene Hembrooke, and
          <string-name>
            <given-names>Geri</given-names>
            <surname>Gay</surname>
          </string-name>
          .
          <year>2005</year>
          .
          <article-title>Accurately interpreting clickthrough data as implicit feedback</article-title>
          .
          <source>In Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval. ACM</source>
          ,
          <volume>154</volume>
          -
          <fpage>161</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Youngho</surname>
            <given-names>Kim</given-names>
          </string-name>
          , Ahmed Hassan,
          <string-name>
            <given-names>Ryen W.</given-names>
            <surname>White</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Imed</given-names>
            <surname>Zitouni</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Modeling Dwell Time to Predict Click-level Satisfaction</article-title>
          .
          <source>In Proceedings of the 7th ACM International Conference on Web Search and Data Mining (WSDM '14)</source>
          . ACM, New York, NY, USA,
          <fpage>193</fpage>
          -
          <lpage>202</lpage>
          . hps://doi.org/10.1145/2556195.2556220
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Rishabh</surname>
            <given-names>Mehrotra</given-names>
          </string-name>
          , Imed Zitouni, Ahmed Hassan Awadallah, Ahmed El Kholy, and
          <string-name>
            <given-names>Madian</given-names>
            <surname>Khabsa</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>User Interaction Sequences for Search Satisfaction Prediction</article-title>
          .
          <source>In Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '17)</source>
          . ACM, New York, NY, USA,
          <fpage>165</fpage>
          -
          <lpage>174</lpage>
          . hps://doi.org/10.1145/3077136.3080833
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Daan</surname>
            <given-names>Odijk</given-names>
          </string-name>
          , Ryen W. White, Ahmed Hassan Awadallah, and
          <string-name>
            <surname>Susan</surname>
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Dumais</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Struggling and Success in Web Search</article-title>
          .
          <source>In Proceedings of the 24th ACM International on Conference on Information and Knowledge Management (CIKM '15)</source>
          . ACM, New York, NY, USA,
          <fpage>1551</fpage>
          -
          <lpage>1560</lpage>
          . hps://doi.org/10.1145/2806416. 2806488
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Gyanit</surname>
            <given-names>Singh</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Nish</given-names>
            <surname>Parikh</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Neel</given-names>
            <surname>Sundaresn</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>User Behavior in Zerorecall Ecommerce eries</article-title>
          .
          <source>In Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '11)</source>
          . ACM, New York, NY, USA,
          <fpage>75</fpage>
          -
          <lpage>84</lpage>
          . hps://doi.org/10.1145/2009916.2009930
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Ning</surname>
            <given-names>Su</given-names>
          </string-name>
          , Jiyin He, Yiqun Liu, Min Zhang, and Shaoping Ma.
          <year>2018</year>
          .
          <article-title>User Intent, Behaviour, and Perceived Satisfaction in Product Search</article-title>
          .
          <source>In Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining (WSDM '18)</source>
          . ACM, New York, NY, USA,
          <fpage>547</fpage>
          -
          <lpage>555</lpage>
          . hps://doi.org/10.1145/3159652.3159714
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Ryen</surname>
            <given-names>W</given-names>
          </string-name>
          <string-name>
            <surname>White and Susan T Dumais</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Characterizing and predicting search engine switching behavior</article-title>
          .
          <source>In Proceedings of the 18th ACM conference on Information and knowledge management. ACM</source>
          ,
          <volume>87</volume>
          -
          <fpage>96</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>Yun</given-names>
            <surname>Zhou</surname>
          </string-name>
          and
          <string-name>
            <given-names>W Bruce</given-names>
            <surname>Cro</surname>
          </string-name>
          <article-title></article-title>
          .
          <year>2006</year>
          .
          <article-title>Ranking robustness: a novel framework to predict query performance</article-title>
          .
          <source>In Proceedings of the 15th ACM international conference on Information and knowledge management. ACM</source>
          ,
          <volume>567</volume>
          -
          <fpage>574</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>Yun</given-names>
            <surname>Zhou</surname>
          </string-name>
          and
          <string-name>
            <given-names>W Bruce</given-names>
            <surname>Cro</surname>
          </string-name>
          <article-title></article-title>
          .
          <year>2007</year>
          .
          <article-title>ery performance prediction in web search environments</article-title>
          .
          <source>In Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval. ACM</source>
          ,
          <volume>543</volume>
          -
          <fpage>550</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>