<!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/3534678.3539354</article-id>
      <title-group>
        <article-title>Impressions in Recommender Systems: Present and Future</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Discussion Paper</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fernando B. Pérez Maurera</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maurizio Ferrari Dacrema</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pablo Castells</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Paolo Cremonesi</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>ContentWise</institution>
          ,
          <addr-line>Milano</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>ICSC</institution>
          ,
          <addr-line>Bologna</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Politecnico di Milano</institution>
          ,
          <addr-line>Milano</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Universidad Autónoma de Madrid</institution>
          ,
          <addr-line>Madrid</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>48</volume>
      <fpage>0000</fpage>
      <lpage>0001</lpage>
      <abstract>
        <p>Impressions are a novel data source providing researchers and practitioners with more details about user interactions and their context. In particular, an impression contain the items shown on screen to users, alongside users' interactions toward such items. In recent years, interest in impressions has thrived, and more papers use impressions in recommender systems. Despite this, the literature does not contain a comprehensive review of the current topics and future directions. This work summarizes impressions in recommender systems under three perspectives: recommendation models, datasets with impressions, and evaluation methodologies. Then, we propose several future directions with an emphasis on novel approaches. This work is part of an ongoing review of impressions in recommender systems.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Recommender Systems</kwd>
        <kwd>Impressions</kwd>
        <kwd>Exposure</kwd>
        <kwd>Past Recommendations</kwd>
        <kwd>Slates</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Recommender systems aim to generate user engagement in the short and long term. They
achieve this by creating personalized recommendations, i.e., a curation of the catalog tailored to
users based on their preferences. When such recommendations are relevant, they generate the
desired engagement of users toward the recommender system. However, this is not an easy
task or goal. A recommender system must be able to predict future user preferences in various
conditions, e.g., when new users arrive, when users change their tastes, or when handling
anonymous users.</p>
      <p>The research community has devised recommenders using distinct data sources to learn
users’ preferences. Interactions are one of the most relevant and commonly used data sources;
most research works in recommender systems use interactions. Interactions are those actions
users perform toward items of a recommender system, e.g., product purchases or movie ratings.</p>
      <p>Using additional data sources is an efective approach to improve the recommendation
quality. This work focuses on one specific data source: impressions, also known as slates, past
recommendations, exposure. An impression contain information about items shown on-screen
to users, alongside the possible interactions with such items. In some cases, an impression also
contains layout information, i.e., the collection of items shown on-screen, the position of items,
their placement on-screen, and labels indicating which items were interacted with. Impressions
are not exclusive to recommender systems; they can be generated by diferent entities, e.g., a
search engine or editors. This work, however, focuses on impressions in recommender systems.</p>
      <p>With impressions, researchers are able to dissect whether a given item has been shown to a
user and whether the user preferred it. Impressions contain mixed signals of users’ preferences,
e.g., for a given user and impression, the user may like all, some, or none of the items in the
impression. This juxtaposition enables researchers to investigate novel areas or complex attributes
of recommender systems using impressions. However, using impressions in recommender
systems does come with additional challenges, e.g., the number of impressions is usually higher
than the number of interactions, in some cases, by several orders of magnitude.</p>
      <p>This work is part of an in-progress systematic literature review on impressions in
recommender systems. This work summarizes our review’s relevant findings, highlighting the current
state of the art, open research questions, and future directions. Throughout this work, we
structure the discussion under three perspectives: recommendation models, datasets with
impressions, and evaluation methodologies.</p>
    </sec>
    <sec id="sec-2">
      <title>2. State of the Art</title>
      <p>We start this section by providing the definition of the most common and relevant terms used
in this work. Then, we proceed with the discussion of the state of the art. We structure the
discussion around three fundamental angles in recommender systems: recommendation models,
datasets with impressions, and evaluation methodologies.</p>
      <p>The reviewed literature consists of regular conference or journal papers published in
highlevel venues describing recommenders using impressions. We discovered papers using relevant
academic search engines and a query to match papers containing the keywords impression (or
its synonyms) and recommender systems in their content. Most papers were discarded due to the
broad definition of impression, e.g., some papers use the word impression as how users perceive
the recommender system.</p>
      <sec id="sec-2-1">
        <title>2.1. Definitions</title>
        <p>We define an impression as a selection of N items to be served to the user by a recommender
system or another entity (e.g., a search engine). Upon arrangement of an impression on-screen,
users decide whether to interact with items in the impression or not, i.e., a user’s action over
an item. Traditionally, the community handles user feedback using user-item pairs, i.e., for a
given user and item, the pair indicates whether the user interacted with the item. We refine the
definition of user feedback based on users’ interactions with impressions: interacted impression,
non-interacted impression, and non-impressed. An interacted impression is a user-item pair
where the user interacts with the item. A non-interacted impression is a user-item pair where
the user does not interact with a served item. Lastly, a non-impressed is a user-item pair where
the item has never been served to the user.</p>
        <p>Depending on the recommender’s system data collection strategy, impressions can be
categorized into two classes: contextual and global impressions. A contextual impression holds
the items shown on-screen and the interactions such items receive. On the contrary, a global
impression holds only one of the two: the items shown on-screen or the interactions one item
receives.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Recommendation Models</title>
        <p>
          This section describes recommendation models: the module in a recommender system in charge
of learning users’ preferences and predicting the relevance of items. Recommendation models
can be classified according to the design of the recommender. 1 From the literature, we identify
ifve classes of recommenders:
Heuristics Use ad-hoc functions, techniques, or rules to learn users’ preferences.
Recommenders of this type were published between 2014 and 2017. See [
          <xref ref-type="bibr" rid="ref1 ref2 ref3">1, 2, 3</xref>
          ] for examples.
Statistical Use probabilistic techniques or statistical models to learn users’ preferences. One
paper was published in 2009, two in 2016, and one in 2017. See [
          <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
          ] for examples.
Machine learning Use machine learning techniques to learn users’ preferences. Machine
learning and statistical recommenders are the least common recommender type in the
literature. See [
          <xref ref-type="bibr" rid="ref3 ref6">3, 6</xref>
          ] for examples.
        </p>
        <p>
          Deep learning Use deep learning architectures to learn users’ preferences. This is the most
popular recommender type in the literature. The most common deep learning architecture
is the two-tower framework [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. See [
          <xref ref-type="bibr" rid="ref10 ref8 ref9">8, 9, 10</xref>
          ] for examples.
        </p>
        <p>
          Reinforcement learning Model the recommendation task using reinforcement learning, i.e.,
as a Markov decision process [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. This is the second most popular recommender type in
the literature. See [
          <xref ref-type="bibr" rid="ref12 ref13 ref14">12, 13, 14</xref>
          ] for examples.
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Datasets with Impressions</title>
        <p>This section describes datasets with impressions from the reviewed literature. We identify three
types of datasets: public, expired, and private datasets. Public datasets are those researchers
and practitioners can access via the Internet and use in future works as long as the license
agreements are respected. Expired datasets have been used in competitions (e.g., the ACM
RecSys Challenge) and are not accessible anymore. Private datasets have never been published
nor made available to the community. The downside of expired and private datasets is they
cannot be used in future research.
1Due to space limitations, we leave out reviewed papers’ descriptions and more taxonomies looking at other
recommenders’ properties.</p>
        <p>
          Inside public datasets, we categorize datasets by the type of impressions they contain:
contextual or global impressions. Three public datasets contain contextual impressions: ContentWise
Impressions [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], MIND [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], and FINN.no Slates [
          <xref ref-type="bibr" rid="ref17">17, 18</xref>
          ]. Ten public datasets contain global
impressions: Yahoo! - R6A [19, 20], Yahoo! - R6B [
          <xref ref-type="bibr" rid="ref13">21, 13</xref>
          ], Search Ads2, PANDOR [22],
Ali-CCP [23], Alimama [24], Cross-Shop Combo [25], In-Shop Combo [25], Kwai_FAIR
System [26], and Kwai_FAIR Experiment [26].
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>2.4. Evaluation Methodologies</title>
        <p>The last topic addresses the current research goals and the importance of using sound
evaluation methodologies to measure progress in the community. Most research papers use ofline
evaluations. However, many papers by industrial actors are also performing online evaluations
via A/B testing. One paper [27] performs user studies.</p>
        <p>
          The most common research goal in the literature is to improve recommendations quality, where
researchers devise one or several recommendation models to improve a particular evaluation
metric, e.g., precision or diversity. Authors may need to alter existing evaluation methodologies
or create ad-hoc ones when using impressions. Nonetheless, they must be cautious to avoid data
leakages, thus, invalidating their findings. Despite the suggestions made by several previous
works [28, 29, 30], we find some papers use improper evaluation methodologies, e.g., creating
artificial sessions to evaluate session-based recommenders [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] or not reporting statistical
significance in evaluations [31].
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Future Directions</title>
      <p>This section describes existing open research questions or research needs in the same three
perspectives of this work: recommendation models, datasets with impressions, and evaluation
methodologies. Then, we identify future work directions addressing such questions or needs.</p>
      <p>On recommendation models, we identify the lack of recommenders handling side information
in the literature, i.e., those recommenders designed to leverage interactions and other data
sources, e.g., factorization machines [32, 33]. In principle, this type of recommender is suitable
for using impressions as side information.</p>
      <p>On datasets with impressions, we identify the need for more datasets containing contextual
impressions. Contextual impressions are more informative than global impressions: researchers
may know all items shown at a particular moment and which are interacted and non-interacted
impressions.</p>
      <p>On evaluations, an open question how to use impressions in the evaluation of recommenders?
Felicioni [34] states one future direction is to use impressions to debias evaluation methodologies,
e.g., by computing propensity scores. Applying inverse propensity weighting [35] produces
an unbiased estimator by adjusting the relevance of items by their propensity score, i.e., the
probability of a given user being exposed to a given item. Using impressions to model propensity
may be beneficial, as impressions contain the system’s exposed and non-exposed items.
2https://www.kaggle.com/competitions/kddcup2012-track2
’21: Fifteenth ACM Conference on Recommender Systems, Amsterdam, The Netherlands,
27 September 2021 - 1 October 2021, ACM, 2021, pp. 556–558. URL: https://doi.org/10.1145/
3460231.3474607. doi:10.1145/3460231.3474607.
[18] S. Eide, D. S. Leslie, A. Frigessi, Dynamic slate recommendation with gated recurrent
units and thompson sampling, Data Min. Knowl. Discov. 36 (2022) 1756–1786. URL:
https://doi.org/10.1007/s10618-022-00849-w. doi:10.1007/s10618-022-00849-w.
[19] L. Li, W. Chu, J. Langford, X. Wang, Unbiased ofline evaluation of contextual-bandit-based
news article recommendation algorithms, in: I. King, W. Nejdl, H. Li (Eds.), Proceedings of
the Forth International Conference on Web Search and Web Data Mining, WSDM 2011,
Hong Kong, China, February 9-12, 2011, ACM, 2011, pp. 297–306. URL: https://doi.org/10.
1145/1935826.1935878. doi:10.1145/1935826.1935878.
[20] W. Chu, S. Park, T. Beaupre, N. Motgi, A. Phadke, S. Chakraborty, J. Zachariah, A case
study of behavior-driven conjoint analysis on yahoo!: front page today module, in: J. F. E.
IV, F. Fogelman-Soulié, P. A. Flach, M. J. Zaki (Eds.), Proceedings of the 15th ACM SIGKDD
International Conference on Knowledge Discovery and Data Mining, Paris, France, June
28 - July 1, 2009, ACM, 2009, pp. 1097–1104. URL: https://doi.org/10.1145/1557019.1557138.
doi:10.1145/1557019.1557138.
[21] C. Gentile, S. Li, G. Zappella, Online clustering of bandits, in: Proceedings of the 31th
International Conference on Machine Learning, ICML 2014, Beijing, China, 21-26 June 2014,
volume 32 of JMLR Workshop and Conference Proceedings, JMLR.org, 2014, pp. 757–765.</p>
      <p>URL: http://proceedings.mlr.press/v32/gentile14.html.
[22] S. Sidana, C. Laclau, M. Amini, Learning to recommend diverse items over implicit feedback
on PANDOR, in: S. Pera, M. D. Ekstrand, X. Amatriain, J. O’Donovan (Eds.), Proceedings of
the 12th ACM Conference on Recommender Systems, RecSys 2018, Vancouver, BC, Canada,
October 2-7, 2018, ACM, 2018, pp. 427–431. URL: https://doi.org/10.1145/3240323.3240400.
doi:10.1145/3240323.3240400.
[23] X. Ma, L. Zhao, G. Huang, Z. Wang, Z. Hu, X. Zhu, K. Gai, Entire space multi-task model:
An efective approach for estimating post-click conversion rate, in: K. Collins-Thompson,
Q. Mei, B. D. Davison, Y. Liu, E. Yilmaz (Eds.), The 41st International ACM SIGIR Conference
on Research &amp; Development in Information Retrieval, SIGIR 2018, Ann Arbor, MI, USA,
July 08-12, 2018, ACM, 2018, pp. 1137–1140. URL: https://doi.org/10.1145/3209978.3210104.
doi:10.1145/3209978.3210104.
[24] Q. Shen, H. Wen, W. Tao, J. Zhang, F. Lv, Z. Chen, Z. Li, Deep interest highlight network for
click-through rate prediction in trigger-induced recommendation, in: F. Laforest, R. Troncy,
E. Simperl, D. Agarwal, A. Gionis, I. Herman, L. Médini (Eds.), WWW ’22: The ACM Web
Conference 2022, Virtual Event, Lyon, France, April 25 - 29, 2022, ACM, 2022, pp. 422–430.</p>
      <p>URL: https://doi.org/10.1145/3485447.3511970. doi:10.1145/3485447.3511970.
[25] C. Zhu, P. Du, W. Zhang, Y. Yu, Y. Cao, Combo-fashion: Fashion clothes matching CTR
prediction with item history, in: A. Zhang, H. Rangwala (Eds.), KDD ’22: The 28th ACM
SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA,
August 14 - 18, 2022, ACM, 2022, pp. 4621–4629. URL: https://doi.org/10.1145/3534678.
3539101. doi:10.1145/3534678.3539101.
[26] J. Wang, W. Ma, J. Li, H. Lu, M. Zhang, B. Li, Y. Liu, P. Jiang, S. Ma, Make fairness more
fair: Fair item utility estimation and exposure re-distribution, in: A. Zhang, H. Rangwala</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>N.</given-names>
            <surname>Buchbinder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Feldman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ghosh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Naor</surname>
          </string-name>
          ,
          <article-title>Frequency capping in online advertising</article-title>
          ,
          <source>J. Sched</source>
          .
          <volume>17</volume>
          (
          <year>2014</year>
          )
          <fpage>385</fpage>
          -
          <lpage>398</lpage>
          . URL: https://doi.org/10.1007/s10951-014-0367-z. doi:
          <volume>10</volume>
          .1007/ s10951-014-0367-z.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>P.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. V. S.</given-names>
            <surname>Lakshmanan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Tiwari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shah</surname>
          </string-name>
          ,
          <article-title>Modeling impression discounting in largescale recommender systems</article-title>
          , in: S. A.
          <string-name>
            <surname>Macskassy</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Perlich</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Leskovec</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
          </string-name>
          , R. Ghani (Eds.),
          <source>The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>
          , KDD '
          <fpage>14</fpage>
          , New York, NY, USA - August
          <volume>24</volume>
          -
          <issue>27</issue>
          ,
          <year>2014</year>
          , ACM,
          <year>2014</year>
          , pp.
          <fpage>1837</fpage>
          -
          <lpage>1846</lpage>
          . URL: https://doi.org/10.1145/2623330.2623356. doi:
          <volume>10</volume>
          .1145/2623330.2623356.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D. C.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Rogers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Shiau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kislyuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. C.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhong</surname>
          </string-name>
          , J. Liu,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jing</surname>
          </string-name>
          ,
          <article-title>Related pins at pinterest: The evolution of a real-world recommender system</article-title>
          , in: R. Barrett,
          <string-name>
            <given-names>R.</given-names>
            <surname>Cummings</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Agichtein</surname>
          </string-name>
          , E. Gabrilovich (Eds.),
          <source>Proceedings of the 26th International Conference on World Wide Web Companion, Perth, Australia, April 3-7</source>
          ,
          <year>2017</year>
          , ACM,
          <year>2017</year>
          , pp.
          <fpage>583</fpage>
          -
          <lpage>592</lpage>
          . URL: https://doi.org/10.1145/3041021.3054202. doi:
          <volume>10</volume>
          .1145/3041021.3054202.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>C.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. V.</given-names>
            <surname>Alvino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. J.</given-names>
            <surname>Smola</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Basilico</surname>
          </string-name>
          ,
          <article-title>Using navigation to improve recommendations in real-time</article-title>
          , in: S. Sen,
          <string-name>
            <given-names>W.</given-names>
            <surname>Geyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Freyne</surname>
          </string-name>
          , P. Castells (Eds.),
          <source>Proceedings of the 10th ACM Conference on Recommender Systems</source>
          , Boston, MA, USA, September
          <volume>15</volume>
          -
          <issue>19</issue>
          ,
          <year>2016</year>
          , ACM,
          <year>2016</year>
          , pp.
          <fpage>341</fpage>
          -
          <lpage>348</lpage>
          . URL: https://doi.org/10.1145/2959100.2959174. doi:
          <volume>10</volume>
          .1145/2959100. 2959174.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>D.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Elango</surname>
          </string-name>
          ,
          <article-title>Spatio-temporal models for estimating click-through rate</article-title>
          ,
          <source>in: Proceedings of the 18th International Conference on World Wide Web, WWW</source>
          <year>2009</year>
          , Madrid, Spain,
          <source>April 20-24</source>
          ,
          <year>2009</year>
          , ACM,
          <year>2009</year>
          , pp.
          <fpage>21</fpage>
          -
          <lpage>30</lpage>
          . URL: https://doi.org/10.1145/ 1526709.1526713. doi:
          <volume>10</volume>
          .1145/1526709.1526713.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>H.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <surname>Z. Shen,</surname>
          </string-name>
          <article-title>User fatigue in online news recommendation</article-title>
          , in: J.
          <string-name>
            <surname>Bourdeau</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Hendler</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Nkambou</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>B. Y.</given-names>
          </string-name>
          <string-name>
            <surname>Zhao</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the 25th International Conference on World Wide Web, WWW</source>
          <year>2016</year>
          , Montreal, Canada,
          <source>April 11 - 15</source>
          ,
          <year>2016</year>
          , ACM,
          <year>2016</year>
          , pp.
          <fpage>1363</fpage>
          -
          <lpage>1372</lpage>
          . URL: https://doi.org/10.1145/2872427.2874813. doi:
          <volume>10</volume>
          .1145/ 2872427.2874813.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>X.</given-names>
            <surname>Yi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Hong</surname>
          </string-name>
          , D. Z. Cheng, L.
          <string-name>
            <surname>Heldt</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Kumthekar</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Wei</surname>
            ,
            <given-names>E. H.</given-names>
          </string-name>
          <string-name>
            <surname>Chi</surname>
          </string-name>
          ,
          <article-title>Sampling-bias-corrected neural modeling for large corpus item recommendations</article-title>
          , in: T.
          <string-name>
            <surname>Bogers</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Said</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Brusilovsky</surname>
          </string-name>
          , D. Tikk (Eds.),
          <source>Proceedings of the 13th ACM Conference on Recommender Systems, RecSys</source>
          <year>2019</year>
          , Copenhagen, Denmark,
          <source>September 16-20</source>
          ,
          <year>2019</year>
          , ACM,
          <year>2019</year>
          , pp.
          <fpage>269</fpage>
          -
          <lpage>277</lpage>
          . URL: https://doi.org/10.1145/3298689.3346996. doi:
          <volume>10</volume>
          .1145/ 3298689.3346996.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>R.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <article-title>A peep into the future: Adversarial future encoding in recommendation</article-title>
          , in: K. S. Candan,
          <string-name>
            <given-names>H.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Akoglu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. L.</given-names>
            <surname>Dong</surname>
          </string-name>
          , J. Tang (Eds.),
          <source>WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining</source>
          , Virtual Event / Tempe, AZ, USA, February
          <volume>21</volume>
          -
          <issue>25</issue>
          ,
          <year>2022</year>
          , ACM,
          <year>2022</year>
          , pp.
          <fpage>1177</fpage>
          -
          <lpage>1185</lpage>
          . URL: https://doi.org/10.1145/3488560.3498476. doi:
          <volume>10</volume>
          .1145/3488560.3498476.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>P.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <article-title>Transform cold-start users into warm via fused behaviors in large-scale recommendation</article-title>
          , in: E. Amigó,
          <string-name>
            <given-names>P.</given-names>
            <surname>Castells</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gonzalo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Carterette</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Culpepper</surname>
          </string-name>
          , G. Kazai (Eds.),
          <source>SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , Madrid, Spain,
          <source>July 11 - 15</source>
          ,
          <year>2022</year>
          , ACM,
          <year>2022</year>
          , pp.
          <fpage>2013</fpage>
          -
          <lpage>2017</lpage>
          . URL: https://doi.org/10.1145/3477495.3531797. doi:
          <volume>10</volume>
          .1145/ 3477495.3531797.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>S.</given-names>
            <surname>Gong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. Q.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <article-title>Positive, negative and neutral: Modeling implicit feedback in sessionbased news recommendation</article-title>
          , in: E. Amigó,
          <string-name>
            <given-names>P.</given-names>
            <surname>Castells</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gonzalo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Carterette</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Culpepper</surname>
          </string-name>
          , G. Kazai (Eds.),
          <source>SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , Madrid, Spain,
          <source>July 11 - 15</source>
          ,
          <year>2022</year>
          , ACM,
          <year>2022</year>
          , pp.
          <fpage>1185</fpage>
          -
          <lpage>1195</lpage>
          . URL: https://doi.org/10.1145/3477495.3532040. doi:
          <volume>10</volume>
          .1145/ 3477495.3532040.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>M. M. Afsar</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Crump</surname>
            ,
            <given-names>B. H.</given-names>
          </string-name>
          <string-name>
            <surname>Far</surname>
          </string-name>
          ,
          <article-title>Reinforcement learning based recommender systems: A survey</article-title>
          ,
          <source>ACM Comput. Surv</source>
          .
          <volume>55</volume>
          (
          <year>2023</year>
          )
          <volume>145</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>145</lpage>
          :
          <fpage>38</fpage>
          . URL: https://doi.org/10.1145/3543846. doi:
          <volume>10</volume>
          .1145/3543846.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>J. McInerney</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Lacker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Hansen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Higley</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Bouchard</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Gruson</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Mehrotra</surname>
          </string-name>
          , Explore, exploit, and
          <article-title>explain: personalizing explainable recommendations with bandits</article-title>
          , in: S. Pera,
          <string-name>
            <given-names>M. D.</given-names>
            <surname>Ekstrand</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Amatriain</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. O'Donovan</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the 12th ACM Conference on Recommender Systems, RecSys</source>
          <year>2018</year>
          , Vancouver, BC, Canada, October 2-
          <issue>7</issue>
          ,
          <year>2018</year>
          , ACM,
          <year>2018</year>
          , pp.
          <fpage>31</fpage>
          -
          <lpage>39</lpage>
          . URL: https://doi.org/10.1145/3240323.3240354. doi:
          <volume>10</volume>
          .1145/ 3240323.3240354.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Karatzoglou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gentile</surname>
          </string-name>
          ,
          <article-title>Collaborative filtering bandits</article-title>
          , in: R.
          <string-name>
            <surname>Perego</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Sebastiani</surname>
            ,
            <given-names>J. A.</given-names>
          </string-name>
          <string-name>
            <surname>Aslam</surname>
            ,
            <given-names>I. Ruthven</given-names>
          </string-name>
          , J. Zobel (Eds.),
          <source>Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>SIGIR</surname>
          </string-name>
          <year>2016</year>
          , Pisa, Italy,
          <source>July 17-21</source>
          ,
          <year>2016</year>
          , ACM,
          <year>2016</year>
          , pp.
          <fpage>539</fpage>
          -
          <lpage>548</lpage>
          . URL: https://doi.org/10.1145/2911451.2911548. doi:
          <volume>10</volume>
          .1145/2911451.2911548.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Paul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hsieh</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Zhang,</surname>
          </string-name>
          <article-title>Toward pareto eficient fairnessutility trade-of in recommendation through reinforcement learning</article-title>
          , in: K. S. Candan,
          <string-name>
            <given-names>H.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Akoglu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. L.</given-names>
            <surname>Dong</surname>
          </string-name>
          , J. Tang (Eds.),
          <source>WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining</source>
          , Virtual Event / Tempe, AZ, USA, February
          <volume>21</volume>
          -
          <issue>25</issue>
          ,
          <year>2022</year>
          , ACM,
          <year>2022</year>
          , pp.
          <fpage>316</fpage>
          -
          <lpage>324</lpage>
          . URL: https://doi.org/10.1145/3488560.3498487. doi:
          <volume>10</volume>
          .1145/3488560.3498487.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>F. B.</given-names>
            <surname>Pérez Maurera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Ferrari</given-names>
            <surname>Dacrema</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Saule</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Scriminaci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cremonesi</surname>
          </string-name>
          ,
          <article-title>Contentwise impressions: An industrial dataset with impressions included</article-title>
          , in: M.
          <string-name>
            <surname>d'Aquin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Dietze</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Hauf</surname>
            , E. Curry,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Cudré-Mauroux</surname>
          </string-name>
          (Eds.),
          <source>CIKM '20: The 29th ACM International Conference on Information and Knowledge Management</source>
          , Virtual Event, Ireland,
          <source>October 19-23</source>
          ,
          <year>2020</year>
          , ACM,
          <year>2020</year>
          , pp.
          <fpage>3093</fpage>
          -
          <lpage>3100</lpage>
          . URL: https://doi.org/10.1145/3340531.3412774. doi:
          <volume>10</volume>
          .1145/3340531.3412774.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>F.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Qiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Zhou, MIND: A large-scale dataset for news recommendation</article-title>
          , in: D.
          <string-name>
            <surname>Jurafsky</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Chai</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Schluter</surname>
            ,
            <given-names>J. R.</given-names>
          </string-name>
          <string-name>
            <surname>Tetreault</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, ACL 2020, Online, July</source>
          <volume>5</volume>
          -
          <issue>10</issue>
          ,
          <year>2020</year>
          , Association for Computational Linguistics,
          <year>2020</year>
          , pp.
          <fpage>3597</fpage>
          -
          <lpage>3606</lpage>
          . URL: https://doi.org/10.18653/v1/
          <year>2020</year>
          .acl-main.
          <volume>331</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .acl-main.
          <volume>331</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>S.</given-names>
            <surname>Eide</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. S.</given-names>
            <surname>Leslie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Frigessi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Rishaug</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Jenssen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Verrewaere</surname>
          </string-name>
          ,
          <article-title>Finn.no slates dataset: A new sequential dataset logging interactions, all viewed items and click responses/no-click for recommender systems research</article-title>
          , in: H.
          <string-name>
            <surname>J. C. Pampín</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          <string-name>
            <surname>Larson</surname>
            ,
            <given-names>M. C.</given-names>
          </string-name>
          <string-name>
            <surname>Willemsen</surname>
            ,
            <given-names>J. A.</given-names>
          </string-name>
          <string-name>
            <surname>Konstan</surname>
            ,
            <given-names>J. J.</given-names>
          </string-name>
          <string-name>
            <surname>McAuley</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Garcia-Gathright</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Huurnink</surname>
          </string-name>
          , E. Oldridge (Eds.), RecSys
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>