<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Annotation Practices in Societally Impactful Machine Learning Applications: What are Popular Recom mender Systems Models Actually Trained On?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Andra-Georgiana Sav</string-name>
          <email>andra-sav@outlook.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrew M. Demetriou</string-name>
          <email>a.m.demetriou@tudelft.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Cynthia C. S. Liem</string-name>
          <email>c.c.s.liem@tudelft.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Delft University of Technology</institution>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <abstract>
        <p>Machine Learning (ML) models influence all aspects of our lives. They also commonly are integrated in recommender systems, which facilitate users' decision-making processes in various scenarios, such as e-commerce, social media, news and online learning. Training performed on large volumes of data is what ultimately drives such systems to provide meaningful recommendations. However, a lack of standardized practices has been observed when it comes to data collection and annotation methods for ML datasets. This research paper systematically identifies and synthesizes the state of standardization with regard to data collection and annotation reporting in the recommender systems domain, through a systematic literature view into the 100 most-cited recommender systems papers from the most impactful venues within the Computing and Information Technology field. Multiple facets of the employed techniques are touched upon, such as reported human annotations and annotator diversity, label quality, and the public availability of training datasets. Recurrent use of just a few benchmark datasets, poor documentation practices, and reproducibility issues in experiments are some of the most striking findings uncovered by this study. We discuss the necessity of transitioning from pure reliance on algorithmic performance metrics to prioritizing data quality and fit. Finally, concerns are raised when it comes to biases and socio-psychological factors inherent in the datasets, and further exploration of embedding these early in the design of ML models is suggested.</p>
      </abstract>
      <kwd-group>
        <kwd>machine learning</kwd>
        <kwd>recommender systems</kwd>
        <kwd>data collection</kwd>
        <kwd>annotation practices</kwd>
        <kwd>societal impact</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Automated systems are fueled by data—yet when it comes to annotating data for Machine
Learning (ML) models, a lack of standardized practices, processes or training of practitioners
will afect the reliability of the produced output. As mentioned by [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], most of the current ML
research focuses on optimizing accuracy metrics to evaluate the correctness of outputs, rather
than establishing qualitative data collection and standardized annotation methods. Recent
work [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] further highlights the current challenges when it comes to data annotation practices,
pointing out how “practitioners described nuanced understandings of annotator diversity, but
rarely designed dataset production to account for diversity in the annotation process”.
nEvelop-O
(C. C. S. Liem)
Perspectives on the Evaluation of Recommender Systems Workshop (PERSPECTIVES 2023), September 19th, 2023,
      </p>
      <p>In order to get more structured and systematic insight into the degree—or, lack—of data
annotation practices in societally impactful ML application domains, a topic proposal was
submitted to the 3rd year undergraduate Research Project in the Computer Science and
Engineering curriculum at Delft University of Technology. Here, students were invited to choose an
impactful applied machine learning domain or publication venue of their choice, and conduct a
systematic literature review in which annotation practices were documented for the top cited
publications for their chosen domain or venue. In this article, we will report on the outcomes of
such a review for the domain of recommender systems.</p>
      <p>
        Recommender systems have emerged as powerful instruments in nowadays’ society, with use
cases spanning across industries (e.g., media, banking, telecom, retail). As [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] notes, Netflix’s
system design revolves around the idea that “everything is a recommendation”. On the same
note, major providers such as Google, Amazon, and LinkedIn make use of profiling mechanisms
to build and expand their businesses. In their literature review on recommender systems and
the ethical challenges they pose, [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] distinguishes six areas of concern, mapping each of them
to a possible solution. Within these proposals, one can note the need for introducing factual
explanations, as well as increasing the transparency of user categorization to minimize the
concerns regarding opacity and lack of user autonomy and personal identity. Here, the interests
of account providers and system owners interests (e.g., increase sales of specific products, news
propaganda) might not be aligned with the users’ original intents of managing information
overload, also emphasizing the need for multi-stakeholder perspectives [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>Often, users are unaware of how recommender systems actually work. If so, they might be
misled to believe that the recommendations meaningfully reflect their own interests, while
selective exposure to certain categories may steer their future choices towards those, and
reshape their personal preferences without them noticing. Therefore, it is important to have
accountability on the manner in which recommendations are provided. With much of the
technical recommender mechanisms including ML components, this also calls for more thorough
understanding of data collection and annotation practices, as these will fundamentally impact
any consequent system components.</p>
      <p>The central question to this paper is What are popular recommender systems models actually
trained on?. This will be done by systematically capturing the extent to which the most-cited
recommender system papers present in impactful venues within the Computing and Information
Technology field have reported explainable data collection and annotation practices, for the
purpose of adopting a transparent, fair, and user-centered approach early in the design of
the recommendation system. To ensure the scope of the search is clearly defined, the study
methodology is further outlined in Section 2. Review results are summarized in Section 3,
followed by a Discussion in Section 4. Findings and key implications are briefly summarized in
Section 5. Finally, to emphasize our researcher accountability, we reflect on responsible research
considerations in Appendix A, and acknowledge individual author contributions in Appendix B.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Methodology</title>
      <p>
        The current research paper is based on a systematic review method, as this provides a clear,
structured framework “to collect, identify, and critically analyze the available research studies
(e.g., articles, conference proceedings, dissertations) through a systematic procedure” [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. This
method has been initially used to gather relevant information sources, after which the paper
progresses to explore and analyze some of the datasets employed by the reviewed papers.
      </p>
      <p>
        In the upcoming subsections, the methods used to collect data will be explained in accordance
to the PRISMA guidelines [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], which is an evidence-based framework commonly adopted when
reporting systematic reviews.
      </p>
      <sec id="sec-2-1">
        <title>2.1. Information sources</title>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Search strategy</title>
        <p>
          All papers reviewed were sampled from the ACM Digital Library, as it is one of the most
comprehensive databases in the domain of Computing and Information Technology [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
In terms of the search criteria used, only English papers published at most 5 years ago were
considered, as to capture the practices in state-of-the-art systems. Moreover, the filtering has
been done considering papers having “recommender system(s)”/“recommendation system(s)” in
the title, and terms such as “supervised machine learning” or “supervised technique(s)” in the
full text. The selection of these specific criteria allows the assessment of current practices in
recommender systems that are possibly built with supervised learning (but not limited to it as
the only technique). The search strings were run on May 8, 2023. From the resulting papers, the
top-100 most cited papers are more thoroughly reviewed. This is based on the need to narrow
down the research to a feasible scope1, while it also is a good indicator of the current practices
within the papers that create the most impact within this field. The resulting set of papers
encompasses [
          <xref ref-type="bibr" rid="ref10 ref100 ref101 ref102 ref103 ref104 ref105 ref106 ref107 ref11 ref12 ref13 ref14 ref15 ref16 ref17 ref18 ref19 ref20 ref21 ref22 ref23 ref24 ref25 ref26 ref27 ref28 ref29 ref30 ref31 ref32 ref33 ref34 ref35 ref36 ref37 ref38 ref39 ref40 ref41 ref42 ref43 ref44 ref45 ref46 ref47 ref48 ref49 ref50 ref51 ref52 ref53 ref54 ref55 ref56 ref57 ref58 ref59 ref60 ref60 ref61 ref62 ref63 ref64 ref65 ref66 ref67 ref68 ref69 ref70 ref71 ref72 ref73 ref74 ref75 ref76 ref77 ref78 ref79 ref80 ref81 ref82 ref83 ref84 ref85 ref86 ref87 ref88 ref89 ref9 ref90 ref91 ref92 ref93 ref94 ref95 ref96 ref97 ref98 ref99">9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32,
33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60,
61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88,
89, 90, 91, 92, 93, 94, 95, 96, 97, 60, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Data collection process</title>
        <p>
          The data collection has entirely been done by the first author of this paper, who firstly examined
the abstract of the paper to check its relevance. Then, the full text was scanned to check
for mentions of data collection and annotation practices. More specifically, inspired by the
procedure adopted by [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], for each paper the following sub-questions were answered:
1. Was the work an original task?
2. Did the work use human annotations as labels for the training data?
3. Were original human annotations (i.e., annotations collected by themselves) or external
human annotations used (i.e., annotations from an existing dataset)?
4. Who were the annotators? (i.e., what population were they drawn from?)
5. Was the number of annotators specified?
6. Was the number of annotators estimated beforehand?
1The course assignment ran over a period of 10 weeks.
The unavailability of data is also taken into consideration, as the ultimate goal is to establish
to which extent the authors explicitly mention the data collection or annotation practices.
Collection of data is done systematically. Results of a paper analysis are immediately noted
down in the results table2. In case an answer to a sub-question is uncertain, this is explicitly
noted as well, to mitigate any possible error of judgment. Where provided, links to the datasets
used and their referencing paper are stored for further analysis. Additionally, papers excluded
from the review process are also stored, and a short explanation for doing so is given3. A
double-check of each entry is performed before proceeding.
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>2.4. Data overview</title>
        <p>This section intends to provide more in-depth insights into the collected data, as to guide an
accurate interpretation of the results discussed later. Hence, the reviewed literature has been
further categorized into several aspects. With regard to publication year, as depicted in
Figure 1, more than half of the literature under review was published in 2020 or 2021, with
less than 10% being published in 2022. Furthermore, as for topic diversity, we identified
several recurrent paper topic categories, as presented in Table 1. It is important to note that
the enumerated categories are not exhaustive; instead, they serve as an overview of recurring
themes identified during the review process. As specific datasets could exhibit greater suitability
for particular scenarios, it may prove useful to bear these categories in mind when assessing
the distribution of datasets used.
2Full results are published online at https://airtable.com/shrP0DCwzaMVdJRsA.
3This information is accessible in a separate “Excluded Papers” table at https://airtable.com/shrbq6E0DxSo82rCo.
2020
32%
24%
24%
11%
9%
2021
2018
2022</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Findings</title>
      <p>This section summarizes the main findings with regard to the established research sub-questions
previously mentioned in Section 2.3. We report results on the originality of tasks encountered
in the papers, use of human annotations (either internal or external), details regarding the
annotators and annotation process, as well as label quality and links to datasets.</p>
      <p>Task originality. Given the complexity and technicality of the papers reviewed, it has been
dificult in some cases to assess whether a work constitutes an ”original task”. Therefore, papers
which were specifically mentioning the novelty of the proposed model, algorithm, or framework
were considered to be original. The findings indicate a majority of 60% of the papers reportedly
did an original work.</p>
      <p>Human annotations. The study’s second objective was to identify to which extent manually
labeled data is being used in training datasets. Here, it is important to bear in mind that multiple
datasets are usually being used to evaluate a single recommender system. When a study has
mentioned at least one dataset which was annotated by humans, it was counted as using human
annotations. Thus, it must not be interpreted that the proposed model uses only manually
labeled datasets, but rather that it uses them to some extent. Interestingly, a vast majority of
86% work done in this domain is not making use of human-annotated data.</p>
      <p>Instead, it has been observed that the main data sources use transactional data that has been
publicly released by large vendors, such as MovieLens, Amazon, Last.FM, or Yelp, with more
than one-third opting for MovieLens as part of their training and evaluation process. The exact
proportions are shown in Table 2. When interpreting the table, it is important to note that the
percentages indicate the number of papers that make use, but are not limited to that specific
dataset. For example, 10% of the papers were using Yelp as part of their dataset choices, but it
does not guarantee the exclusivity of other datasets.</p>
      <p>The annotators. Another aim of the study was to further look at the annotators. Table 3
shows the population the annotators were drawn from. It is worth noting that the proportion is
calculated from the papers which actually reported using some kind of annotations (14 in total).
While there was no indication about the identity of the annotators in 28.57% of these papers,
another 21.43% only mentioned they were crowdsourcing workers. Interestingly enough, no
work mentioned estimating the necessary number of annotators beforehand. However, the
actual number of annotators was provided in most cases, as noted in Table 4.</p>
      <p>Formal instructions, trainings, and pre-screening. A third objective was to identify
if any type of pre-screening was done when selecting crowdsourcing workers, and whether
formal instructions or trainings were provided beforehand. As listed in Table 5, this was rare,
and training was never oficially given.</p>
      <p>Label quality. Further, the use of several metrics regarding label quality has been noted,
such as multiple annotators labeling the same item, reported inter-annotator agreement, or
label quality specification. Table 6 summarizes these results.</p>
      <p>Link to datasets. Lastly, there was the observation regarding the datasets used, and more
specifically, the extent to which the corresponding links are actually made available. The results
Estimated number</p>
      <p>Actual number
Formal instructions</p>
      <p>Trainings
Pre-screening</p>
      <p>Count Proportion
Count Proportion</p>
    </sec>
    <sec id="sec-4">
      <title>4. Discussion</title>
      <p>Drawing upon the findings mentioned in Section 3, the subsequent sections of this report
will delve into three key aspects: the datasets used, the reproducibility of experiments, and
the limitations inherent in this study. Through this discussion, the intent is to deepen the
understanding of the significance and impact of the datasets on the overall study, while also
highlighting areas for improvement and further investigation in the field.</p>
      <sec id="sec-4-1">
        <title>4.1. Datasets Overview</title>
        <p>Given the primary objective of this paper to enhance the understanding of current data collection
and annotation practices, this section aims to explore the datasets employed by most of the papers
by examining the key aspects with regard to their composition, quality, representativeness, and
implications for the research outcomes. Given the relatively low percentage of human-annotated
data actually being employed in the evaluation of recommender systems, a clear distinction of
those datasets will be made in the exploration.</p>
        <sec id="sec-4-1-1">
          <title>4.1.1. Human-annotated Data</title>
          <p>When it comes to manually-annotated data, results reveal that 9 out of the 14 papers using these
types of datasets mention crowdsourcing workers, mostly employed from Amazon Mechanical
Turk (AMT). Furthermore, there are certain scenarios in which manual labor is necessary, such
as evaluating the perceptions of explanations provided by recommendation systems that aim to
ofer explainability. The involvement of human annotators in this context contributes to the
development of more efective and user-centric recommendation systems, and thus the main
purpose for them is to provide qualitative feedback. Below, a summary of the datasets that
mentioned the use of human annotations is ofered.</p>
          <p>
            ReDial Dataset. ReDial comprises of dialogues in which users recommend movies to each
other. Data is collected by pairing up AMT workers and giving them specific roles. Additional
instructions are provided to improve data quality, such as using formal language and discussing
at least four diferent movies per conversation. The collection is limited to English-speaking
countries. Worker agreement on movie dialogue forms is used for validation [
            <xref ref-type="bibr" rid="ref108">108</xref>
            ].
          </p>
          <p>
            TG-ReDial Dataset. TG-ReDial is a conversational dataset consisting of 129,392 utterances
from 1,482 users. The data annotation process involves crowdsourcing workers from a
specialized (unspecified) data annotation company. Each utterance is assigned to an annotator for
labeling and an inspector for quality checking [
            <xref ref-type="bibr" rid="ref109">109</xref>
            ].
          </p>
          <p>
            Beer Advocate Dataset. The dataset includes more than 1.5 million collected beer reviews
spanning more than a decade until 2011. Ground truth labels were provided by external
annotators, who annotated 1,000 reviews. While the inter-annotator agreement is reported,
only 2 annotators were employed. It is noteworthy that the original dataset website indicates
the data is no longer accessible, by BeerAdvocate’s request [
            <xref ref-type="bibr" rid="ref110">110</xref>
            ].
          </p>
          <p>
            CamRest676 Dataset. Human participants were recruited from AMT and assigned the roles
of either a user or a wizard. The participants were instructed to compose conversations from the
perspective of their assigned role. Users were given pre-specified goals to interact with the
wizard, making the collected dialogue more representative of real-world scenarios. This approach
aimed to ensure that the collected dialogue closely resembled actual user interactions [
            <xref ref-type="bibr" rid="ref111">111</xref>
            ].
          </p>
          <p>
            Coat Shopping Dataset. The training data was generated by providing 270 AMT workers
with a web shop interface. They were asked to find and rate their most desired coat from a
selection of 300 items. Even though a link to trace the dataset was provided, in this case, special
permissions are needed to actually access the data [
            <xref ref-type="bibr" rid="ref112">112</xref>
            ].
          </p>
          <p>
            MyFitnessPal Dataset. To obtain this evaluation dataset, CrowdFlower was used to obtain
human judgments of food substitutes. 100 food entries were randomly selected as target queries,
and a ranked list of top-10 substitute candidates was generated for each query using two
methods. CrowdFlower workers rated the suitability of 2,000 food substitute pairs on a 7-point
Likert scale. Each pair was judged by three workers, and quality control was ensured using 57
ground truth questions. [
            <xref ref-type="bibr" rid="ref113">113</xref>
            ]
          </p>
          <p>Our findings indicate that generally, some basic outlines regarding the annotation process
are given. These include details such as the number of annotators, the instructions that they
were given, or specifications regarding the quality of labels. When it comes to eligibility criteria,
they mainly refer to proficiency in English, and no other complex requirements are specified.
Contrary to the expectation, however, is the lack of information regarding the population
these annotators were drawn from. For example, in the case of ReDial dataset, it is explicitly
mentioned that the annotators reside in the US, Canada, UK, Australia, or New Zealand, but for
other datasets this is not the case—while the representativeness of the annotator population
may be worth considering, if a recommender system is intended to universally be efective.</p>
          <p>To develop a full picture of the data, it is necessary to adopt a structured way of reporting
the collection method, with extensive explanations of choices (e.g., why were these specific
annotators chosen? What are the implications of employing these annotators from an ethical
perspective?). When adopting more subjective criteria regarding the choice of annotators,
this introduces some degree of variability. Thus, by employing a more structured method for
reporting, this would give the reader the possibility to make their own informed assessments.</p>
        </sec>
        <sec id="sec-4-1-2">
          <title>4.1.2. Interaction Data</title>
          <p>Since the majority of the reviewed papers leverage publicly available datasets, regarded as
‘benchmarks’ in the field, a discussion around the most popular ones follows.</p>
          <p>
            MovieLens Dataset. More than 33% of the papers were using at least one version of
this dataset [
            <xref ref-type="bibr" rid="ref114">114</xref>
            ], which contains ratings of movies. There are currently three benchmark
versions of this dataset (10k, 1M, and 10M ratings), with the first two being employed by most
papers. Interestingly enough, the data contained within these dates back to 1997-1998, and 2000,
respectively. For that reason, its representativeness and relevance in terms of social aspects of
nowadays’ population could be debated. Furthermore, [
            <xref ref-type="bibr" rid="ref115">115</xref>
            ] explores biases and unfairness of
this dataset in terms of two sensitive features, namely age, and gender. Their findings indicate
that the biases are intrinsic to the dataset, regardless of the models used.
          </p>
          <p>
            Yelp Dataset. This dataset contains data from Yelp, which is a review platform where users
can leave reviews for businesses. It comprises approximately 7 million reviews given by almost
2 million users. Although the dataset is extensive, it still requires exploration to determine the
population of users. [
            <xref ref-type="bibr" rid="ref116">116</xref>
            ] investigated the presence of biases in this dataset, mapping them to
social, cultural, and political aspects.
          </p>
          <p>
            While papers thoroughly justify the choice of algorithms, little to no explanations are given
when it comes to the datasets used. A briefing consisting of the number of users and interactions
is usually given, and the positioning of the choice relies on the fact that these datasets are
widely used within the research domain. While the choice of these datasets could be motivated
by wanting to compare novel models against a known benchmark, more emphasis should be
put on shifting the focus from data quantity to data quality. A rather crucial question would be:
To what extent are these data points representative of the population that the system aims to
serve? Moreover, is it adequate for the specific domain of activity? Along the same line, [
            <xref ref-type="bibr" rid="ref117">117</xref>
            ]
points out that there are no established metrics in place to determine the ”goodness-of-data”, as
”goodness-of-fit” seems to be the preferred approach for most practitioners.
          </p>
          <p>
            More in-depth exploration would be needed to reveal the quality or adequacy of the datasets
employed by all reviewed papers. However, we argue that researchers should be more explicit
regarding the rationale behind selecting a particular dataset, as the representativeness of datasets
has been mentioned as a recurrent challenge of evaluating recommender systems [
            <xref ref-type="bibr" rid="ref118">118</xref>
            ].
          </p>
          <p>Synthetic Data. Another interesting finding was the usage of synthetic datasets, especially
in recommender systems that discussed bandits (i.e., recommender systems that are trying
to balance the exploration phase of new items, with the exploitation phase of known items).
It is therefore likely that the use of synthetic datasets comes from the need of training and
evaluating on datasets that employ certain characteristics. While the generic outlines of these
datasets are given, the findings indicate they are not usually being made publicly available.</p>
          <p>Reproducibility of Experiments. Perhaps one of the most striking findings considers
the extent to which experiments are actually reproducible. As reported in Table 8, 39% of the
reviewed papers either provide no links to the datasets used or only provide some of the links
(but not all), while this is relevant and even critical information for being able to reproduce a
work. Considering the widely recognized reputation of papers published in ACM, arguably, a
rather standardized reporting practice should be deemed as necessary.</p>
          <p>The absence of links to datasets was due to diferent situations: either the authors have
made use of real-world datasets that are assumed to be well-known (and thus easy to trace),
or they used synthetic/non-disclosable datasets. Regardless of the specific scenario, including
the datasets represents a key part of a rigorous reporting procedure. By choosing not to do
so, not only is the reproducibility of an experiment compromised but also the reliability of the
results can then become questionable. In cases where there is really no possibility to disclose
the datasets, a more comprehensive overview should be ofered. While most of the time the
numbers of users and interactions are given, the details could go beyond that. Does it consist of
sensitive features? What is the population embedded in the dataset? And how representative it
is for the domain in which the recommender system is employed? By doing so, it at least ofers
other researchers the relevant details to find a dataset with similar characteristics.</p>
        </sec>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Study Limitations and Future Work</title>
        <sec id="sec-4-2-1">
          <title>4.2.1. Limitations</title>
          <p>Researcher bias. In systematic review studies, there may be risks of biases. Given the limited
scope of the research, it might be that sampling bias has been introduced. As the literature
on recommender systems contains thousands of papers, sampling only 100 of them might
not be representative enough to draw generalizable conclusions. Furthermore, there may be
study design bias. While established carefully and iteratively, there is no guarantee that the
search criteria as mentioned in Section 2.2 are exhaustive. Thus, relevant papers may have been
omitted from the study.</p>
          <p>Time constraints. Reviewing and assessing literature on recommender systems can be time
consuming, especially considering the complex, technical, and mathematical concepts discussed.
As this research has been carried over a total period of 10 weeks with the lead author being an
undergraduate student new to the field, more insights may still be obtainable from the collected
data than were surfaced now.</p>
          <p>
            Studies quality. One of the criteria employed to narrow down the search was the choice
of a specific research database. Although it is one of the most appreciated within academia,
there are certainly equally significant papers published in other journals. As noted by [
            <xref ref-type="bibr" rid="ref119">119</xref>
            ],
the scientific contribution in itself does not necessarily rely on a journal’s reputation, but on
multiple indicators, amongst which actual influence in practical scenarios is noted. Hence, a
greater focus on other types of metrics could be usefully explored in future research.
          </p>
          <p>Results Interpretation. The interpretation of the results can be subject to limitations from
two perspectives. Firstly, the limited amount of time, which did not allow for a more in-depth
exploration of the datasets, and secondly, the subjective nature of the interpretations. It goes
without saying that an expert in recommender systems might have judged the papers diferently
and might have based their conclusions on diferent evaluation criteria.</p>
        </sec>
        <sec id="sec-4-2-2">
          <title>4.2.2. Further Work and Recommendations</title>
          <p>Despite its limitations, this literature review is intended to at least serve as a starting point for a
more extensive exploration of data collection and annotation practices within the domain of
recommender systems. Further work is required to gain a more in-depth understanding of how
these reporting practices are happening on a broader level, and what framework could possibly
be adopted to include social factors in the discussion.</p>
          <p>
            As for this, as previously mentioned, past work points out certain social and psychological
factors that are inherent in the datasets, producing biases and ultimately, leading to skewed
results. Hence, future research should aim to put more emphasis on societal impact from an
interdisciplinary perspective. Furthermore, more attention is needed towards transparency on
the data used to train the models. One way to tackle this issue would be to include a data sheet
with specifications, similar to the one proposed by [
            <xref ref-type="bibr" rid="ref120">120</xref>
            ]. Examples of specifications include
data composition, collection methods, data pre-processing, and intended use cases. To gain an
in-depth understanding of each specification, several questions are posed. For instance, when it
comes to data collection practices, [
            <xref ref-type="bibr" rid="ref120">120</xref>
            ] outline the need to understand diferent angles, such
as sampling strategy, the timeframe of the collection, ethical review processes, or individuals
involved in the collection process. In a similar fashion, [
            <xref ref-type="bibr" rid="ref121">121</xref>
            ] extensively introduces the so-called
‘Data Cards’ which aim to enhance transparency in the documentation process by ofering a
structured framework to work with. The outcome of the case studies conducted by the authors
highlights crucial aspects that should be considered when working with a dataset, such as
the problem space, intended or unsafe use cases, and data collection methods (including data
sources and selection criteria). The adoption of such a structured framework allows one to
derive deeper insights that might have otherwise been neglected, and can further assist in
understanding the foundational components on which the ML model has been built on. Finally,
whether it comes to annotated, synthetic, or interaction datasets, they should be linked and
made available to ensure the reproducibility of experiments.
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>Recommender systems play a pivotal role in today’s society, as they facilitate decision-making
processes by helping users navigate extensive pools of information. It is known, however, that
their ability to provide meaningful recommendations stems from training the recommendation
model using large datasets. In this research paper, current data collection and annotation
practices employed in scientific records were reviewed to identify whether techniques in
state-ofthe-art models take the quality of the data into account. The study examined several dimensions
that influence data quality, including but not limited to the presence of human annotators,
diversity within the annotator population, and label quality, whilst also looking at the public
disclosure of datasets. One of the most significant findings to emerge from this analysis is that
an overwhelming majority of practitioners employ just a few real-world benchmark datasets
comprised of interaction data. Although standardized datasets are suitable to evaluate systems
from an algorithmic perspective, arguably assessing the fit of the data is equally important to
produce meaningful results. It is revealed that no robust reporting framework is in place and that
often researchers fail to justify their dataset choices suficiently. When it comes to annotated
data, general guidelines regarding the annotation process are usually given. However, it was
found that little information is provided regarding the population from which the annotators
were drawn. Consequently, a discussion was centered around the extent to which these datasets
accurately represent the user population they aim to serve. Finally, the dificulty of reproducing
experiments was uncovered, given the lack of links to datasets. Notwithstanding the relatively
limited sample of the reviewed literature, this work ofers valuable insights into the current state
of training recommender system models and emphasizes the need for a consensus regarding
rigorous reporting practices. Further research should be undertaken to explore how to establish
an interdisciplinary framework to assess data quality and its fit for specific purposes when it
comes to developing Machine Learning applications.</p>
    </sec>
    <sec id="sec-6">
      <title>A. Responsible Research</title>
      <p>
        Responsible Research aims to unify conceptual dimensions such as anticipation, inclusion,
responsiveness, and reflexivity, for the purpose of governing research and creating a positive
societal impact. The emphasis is shifted from the outcome to the actual process of the research
activity [
        <xref ref-type="bibr" rid="ref122">122</xref>
        ]. We discuss how these concepts were incorporated when conducting this research,
covering integrity principles, reproducibility, and ethical aspects, to reflect more thoroughly on
the societal implications of and ethical considerations behind our work.
      </p>
      <p>Transparency and integrity. No financial support or funding has been given to conduct
this research, and thus there is no conflict of interest arising from possible afiliations.
Furthermore, in light of transparency, the limitations of this study have been extensively discussed in
Section 4.2, taking into consideration possible biases, subjective criteria of results interpretation,
study quality, and time constraints.</p>
      <p>Reproducibility. The search criteria have been extensively explained in Section 2.2.
However, it is important to note that the papers filtered are then selected based on the descending
number of citations. As this number can potentially increase over time, there is no guarantee
that replicating the same search string in the future will result in the exact same pool of papers
as the one used when conducting this review. This is why we explicitly mentioned the date on
which we conducted the search. Moreover, all of the data gathered during the review process
has been stored and made publicly available. To this extent, all analyzed papers, as well as
their corresponding identifier, findings, or linked datasets are stored, so they can be further
investigated if necessary. Thus, in case the search string might not be fully reusable in diferent
settings, the reviewed papers can still be accessed in the future.</p>
      <p>
        Ethical considerations. In light of Artificial Intelligence’s growing popularity,
supplementary eforts need to be made to establish clear guidelines with regard to AI ethics. To understand
what is needed to make the ethical principles operable, [
        <xref ref-type="bibr" rid="ref123">123</xref>
        ] argue that AI ethics should be
embedded in the whole AI lifecycle, starting with design, and following with data collection for
training and testing purposes. Since recommender systems have been deeply integrated into our
daily lives, having the ability to ultimately influence our decisions, it is crucial to address these
kinds of considerations. By providing more clear insights into the current data annotation and
collection practices observed throughout this research, the objective is to close the gap between
Computer Science and other disciplines and encourage more interdisciplinary approaches.
      </p>
    </sec>
    <sec id="sec-7">
      <title>B. CRediT author statement</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R. S.</given-names>
            <surname>Geiger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Qiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <article-title>Garbage in, garbage out? Do machine learning application papers in social computing report where humanlabeled training data comes from?</article-title>
          ,
          <source>in: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>325</fpage>
          -
          <lpage>336</lpage>
          . URL: https://dl.acm.org/doi/abs/10. 1145/3351095.3372862.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kapania</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Taylor</surname>
          </string-name>
          , D.
          <string-name>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>A hunt for the Snark: Annotator Diversity in Data Practices</article-title>
          ,
          <source>in: Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          . URL: https://dl.acm.org/doi/abs/10.1145/3544548.3580645.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Schrage</surname>
          </string-name>
          ,
          <article-title>The recommender revolution, Technology review (</article-title>
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Milano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Taddeo</surname>
          </string-name>
          , L. Floridi,
          <article-title>Recommender systems and their ethical challenges</article-title>
          ,
          <source>Ai &amp; Society</source>
          <volume>35</volume>
          (
          <year>2020</year>
          )
          <fpage>957</fpage>
          -
          <lpage>967</lpage>
          . URL: https://link.springer.com/article/10.1007/ s00146-020-00950-y.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rokach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Shapira</surname>
          </string-name>
          , Recommender systems: Techniques, applications, and challenges,
          <source>Recommender Systems Handbook</source>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>35</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Carrera-Rivera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Ochoa-Agurto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Larrinaga</surname>
          </string-name>
          , G. Lasa,
          <article-title>How-to conduct a systematic literature review: A quick guide for computer science research</article-title>
          ,
          <source>MethodsX</source>
          (
          <year>2022</year>
          )
          <fpage>101895</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Page</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. E.</given-names>
            <surname>McKenzie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. M.</given-names>
            <surname>Bossuyt</surname>
          </string-name>
          , I. Boutron,
          <string-name>
            <given-names>T. C.</given-names>
            <surname>Hofmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Mulrow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Shamseer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Tetzlaf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. A.</given-names>
            <surname>Akl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Brennan</surname>
          </string-name>
          , et al.,
          <source>The PRISMA</source>
          <year>2020</year>
          statement
          <article-title>: an updated guideline for reporting systematic reviews</article-title>
          ,
          <source>International journal of surgery 88</source>
          (
          <year>2021</year>
          )
          <fpage>105906</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Ormond</surname>
          </string-name>
          , ACM Journals Shine in Latest Impact Factor Release,
          <year>2022</year>
          . URL: https://www. acm.org/media-center/
          <year>2022</year>
          <article-title>/august/acm-journals-impact-factor.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>F.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Plaisant</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Spring</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Shneiderman</surname>
          </string-name>
          ,
          <article-title>Visual Interfaces for Recommendation Systems</article-title>
          ,
          <source>ACM Transactions on Intelligent Systems and Technology</source>
          <volume>10</volume>
          (
          <year>2018</year>
          )
          <fpage>1</fpage>
          -
          <lpage>23</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Xiao,</surname>
          </string-name>
          <article-title>DCDIR: A deep cross-domain recommendation system for cold start users in insurance domain</article-title>
          ,
          <source>in: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>F.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.-P.</given-names>
            <surname>Hsieh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A Joint</given-names>
            <surname>Passenger</surname>
          </string-name>
          <article-title>Flow Inference and Path Recommender System for Deploying New Routes and Stations of Mass Transit Transportation</article-title>
          ,
          <source>ACM Transactions on Knowledge Discovery from Data</source>
          <volume>16</volume>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>36</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V. H.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <source>Streaming Ranking Based Recommender Systems, in: The 41st International ACM SIGIR Conference on Research &amp;amp; Development in Information Retrieval</source>
          , ACM,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Ou</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Zhang,</surname>
          </string-name>
          <article-title>Understanding echo chambers in e-commerce recommender systems</article-title>
          ,
          <source>in: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>P.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Gulla</surname>
          </string-name>
          ,
          <article-title>Multilingual review-aware deep recommender system via aspect-based sentiment analysis</article-title>
          ,
          <source>ACM Trans. Inf. Syst</source>
          .
          <volume>39</volume>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>33</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>G. de Souza Pereira Moreira</surname>
          </string-name>
          , CHAMELEON, in
          <source>: Proceedings of the 12th ACM Conference on Recommender Systems</source>
          , ACM,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <article-title>Hierarchical user profiling for e-commerce recommender systems</article-title>
          ,
          <source>in: Proceedings of the 13th International Conference on Web Search and Data Mining</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Comparison-based conversational recommender system with relative bandit feedback</article-title>
          ,
          <source>in: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>H.</given-names>
            <surname>Bharadhwaj</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Park</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. Y.</given-names>
            <surname>Lim</surname>
          </string-name>
          , RecGAN, in
          <source>: Proceedings of the 12th ACM Conference on Recommender Systems</source>
          , ACM,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <article-title>Deep multifaceted transformers for multiobjective ranking in large-scale e-commerce recommender systems</article-title>
          ,
          <source>in: Proceedings of the 29th ACM International Conference on Information &amp; Knowledge Management</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fenton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Caverlee</surname>
          </string-name>
          ,
          <article-title>Fairness among new items in cold start recommender systems</article-title>
          ,
          <source>in: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>V.</given-names>
            <surname>Rubtsov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kamenshchikov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Valyaev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Leksin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. I.</given-names>
            <surname>Ignatov</surname>
          </string-name>
          ,
          <article-title>A hybrid two-stage recommender system for automatic playlist continuation</article-title>
          ,
          <source>in: Proceedings of the ACM Recommender Systems Challenge</source>
          <year>2018</year>
          , ACM,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>J.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <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>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Hong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. H.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <article-title>Of-policy learning in two-stage recommender systems</article-title>
          ,
          <source>in: Proceedings of The Web Conference</source>
          <year>2020</year>
          , ACM, New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. H.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <article-title>User response models to improve a REINFORCE recommender system</article-title>
          ,
          <source>in: Proceedings of the 14th ACM International Conference on Web Search and Data Mining</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Xie</surname>
          </string-name>
          , M. Guo, RippleNet, in
          <source>: Proceedings of the 27th ACM International Conference on Information and Knowledge Management</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>T.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. K.-I.</given-names>
            <surname>Chio</surname>
          </string-name>
          , H.-T. Cheng, Y. Du,
          <string-name>
            <given-names>S.</given-names>
            <surname>Rendle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kuzmin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , J.
          <string-name>
            <surname>Anderson</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Chandra</surname>
            ,
            <given-names>E. H.</given-names>
          </string-name>
          <string-name>
            <surname>Chi</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Kumar</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Ma</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Soares</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Jindal</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Cao</surname>
          </string-name>
          ,
          <article-title>Zero-shot heterogeneous transfer learning from recommender systems to coldstart search retrieval</article-title>
          ,
          <source>in: Proceedings of the 29th ACM International Conference on Information &amp; Knowledge Management</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hwang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Kweon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <article-title>Topology distillation for recommender system</article-title>
          ,
          <source>in: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery &amp; Data Mining</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , G. Li,
          <string-name>
            <given-names>J.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Gai</surname>
          </string-name>
          ,
          <article-title>Learning Tree-based Deep Model for Recommender Systems</article-title>
          ,
          <source>in: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery &amp;amp; Data Mining, ACM</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>W.</given-names>
            <surname>Lei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Miao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Hong</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kan</surname>
          </string-name>
          , T.-S. Chua, Estimation-actionreflection:
          <article-title>Towards deep interaction between conversational and recommender systems</article-title>
          ,
          <source>in: Proceedings of the 13th International Conference on Web Search and Data Mining</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>H.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sanner</surname>
          </string-name>
          ,
          <article-title>Bayesian critiquing with keyphrase activation vectors for VAE-based recommender systems</article-title>
          ,
          <source>in: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>M.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. Z.</given-names>
            <surname>Gong</surname>
          </string-name>
          , J. Liu,
          <article-title>Poisoning Attacks to Graph-Based Recommender Systems</article-title>
          ,
          <source>in: Proceedings of the 34th Annual Computer Security Applications Conference</source>
          , ACM,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>H.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <article-title>Automated embedding size search in deep recommender systems</article-title>
          ,
          <source>in: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Christakopoulou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ooi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mladenov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Beutel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Boutilier</surname>
          </string-name>
          , E. Chi,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <article-title>Towards content provider aware recommender systems</article-title>
          ,
          <source>in: Proceedings of the Web Conference</source>
          <year>2021</year>
          , ACM, New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Wang</surname>
          </string-name>
          , Ranking Distillation,
          <source>in: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery &amp;amp; Data Mining, ACM</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>N.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.-H.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <article-title>Explainable recommender systems via resolving learning representations</article-title>
          ,
          <source>in: Proceedings of the 29th ACM International Conference on Information &amp; Knowledge Management</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Liu</surname>
          </string-name>
          , H. Liu,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <surname>B. Long,</surname>
          </string-name>
          <article-title>AutoDim: Field-aware embedding dimension searchin recommender systems</article-title>
          ,
          <source>in: Proceedings of the Web Conference</source>
          <year>2021</year>
          , ACM, New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>A.</given-names>
            <surname>Ferraro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bogdanov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yoon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Serra</surname>
          </string-name>
          ,
          <article-title>Automatic playlist continuation using a hybrid recommender system combining features from text and audio</article-title>
          ,
          <source>in: Proceedings of the ACM Recommender Systems Challenge</source>
          <year>2018</year>
          , ACM,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>K.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yang</surname>
          </string-name>
          , G. Wu,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sanner</surname>
          </string-name>
          ,
          <article-title>Deep critiquing for VAE-based recommender systems</article-title>
          ,
          <source>in: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhou</surname>
          </string-name>
          , J. Ma, J. Zhang,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <article-title>Contrastive learning for debiased candidate generation in large-scale recommender systems</article-title>
          ,
          <source>in: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery &amp; Data Mining</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Caverlee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Hu</surname>
          </string-name>
          , TrailMix, in
          <source>: Proceedings of the ACM Recommender Systems Challenge</source>
          <year>2018</year>
          , ACM,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <string-name>
            <given-names>X.</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. Q. V.</given-names>
            <surname>Hung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Crsal,
          <source>ACM Trans. Inf. Syst</source>
          .
          <volume>38</volume>
          (
          <year>2020</year>
          )
          <fpage>1</fpage>
          -
          <lpage>40</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [41]
          <string-name>
            <given-names>M.</given-names>
            <surname>Cheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <article-title>Learning recommender systems with implicit feedback via soft target enhancement</article-title>
          ,
          <source>in: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [42]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.-S.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Nie</surname>
          </string-name>
          ,
          <article-title>Routing Micro-videos via A Temporal Graph-guided Recommendation System</article-title>
          ,
          <source>in: Proceedings of the 27th ACM International Conference on Multimedia, ACM</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          [43]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <article-title>A generic network compression framework for sequential recommender systems</article-title>
          ,
          <source>in: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          [44]
          <string-name>
            <given-names>T.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          , MixGCF, in
          <source>: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery &amp; Data Mining</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          [45]
          <string-name>
            <given-names>F.</given-names>
            <surname>Lv</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Yang</surname>
          </string-name>
          , W. Ng, SDM, in
          <source>: Proceedings of the 28th ACM International Conference on Information and Knowledge Management</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          [46]
          <string-name>
            <given-names>R.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          <article-title>Zheng, Multi-modal knowledge graphs for recommender systems</article-title>
          ,
          <source>in: Proceedings of the 29th ACM International Conference on Information &amp; Knowledge Management</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref47">
        <mixed-citation>
          [47]
          <string-name>
            <given-names>S.</given-names>
            <surname>Mu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-R.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <article-title>Knowledge-Guided Disentangled Representation Learning for Recommender Systems</article-title>
          ,
          <source>ACM Transactions on Information Systems</source>
          <volume>40</volume>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>26</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref48">
        <mixed-citation>
          [48]
          <string-name>
            <given-names>G.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sanner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Soh</surname>
          </string-name>
          ,
          <article-title>Deep language-based critiquing for recommender systems</article-title>
          ,
          <source>in: Proceedings of the 13th ACM Conference on Recommender Systems</source>
          , ACM,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref49">
        <mixed-citation>
          [49]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <article-title>Learning to hash with graph neural networks for recommender systems</article-title>
          ,
          <source>in: Proceedings of The Web Conference</source>
          <year>2020</year>
          , ACM, New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref50">
        <mixed-citation>
          [50]
          <string-name>
            <given-names>W.</given-names>
            <surname>Kweon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <article-title>Bidirectional distillation for Top-K recommender system</article-title>
          ,
          <source>in: Proceedings of the Web Conference</source>
          <year>2021</year>
          , ACM, New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref51">
        <mixed-citation>
          [51]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Weng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Gao</surname>
          </string-name>
          , G. Chen,
          <article-title>Dual Graph Attention Networks for Deep Latent Representation of Multifaceted Social Efects in Recommender Systems</article-title>
          , in: The World Wide Web Conference, ACM,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref52">
        <mixed-citation>
          [52]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chen</surname>
          </string-name>
          , E. Kanoulas,
          <article-title>Towards question-based recommender systems</article-title>
          ,
          <source>in: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref53">
        <mixed-citation>
          [53]
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Zhang,</surname>
          </string-name>
          <article-title>Membership inference attacks against recommender systems</article-title>
          ,
          <source>in: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref54">
        <mixed-citation>
          [54]
          <string-name>
            <given-names>H.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , PAL, in
          <source>: Proceedings of the 13th ACM Conference on Recommender Systems</source>
          , ACM,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref55">
        <mixed-citation>
          [55]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hwang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Kweon</surname>
          </string-name>
          , H. Yu,
          <string-name>
            <surname>DE-RRD</surname>
          </string-name>
          :
          <article-title>A knowledge distillation framework for recommender system</article-title>
          ,
          <source>in: Proceedings of the 29th ACM International Conference on Information &amp; Knowledge Management</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref56">
        <mixed-citation>
          [56]
          <string-name>
            <given-names>I.</given-names>
            <surname>Kostric</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Balog</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Radlinski</surname>
          </string-name>
          ,
          <article-title>Soliciting user preferences in conversational recommender systems via usage-related questions</article-title>
          ,
          <source>in: Fifteenth ACM Conference on Recommender Systems</source>
          , ACM, New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref57">
        <mixed-citation>
          [57]
          <string-name>
            <given-names>D.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Tong</surname>
          </string-name>
          ,
          <article-title>Spiral of Silence in Recommender Systems</article-title>
          ,
          <source>in: Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, ACM</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref58">
        <mixed-citation>
          [58]
          <string-name>
            <surname>W.-C. Kang</surname>
            , D. Z. Cheng, T. Chen,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Yi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Hong</surname>
            ,
            <given-names>E. H.</given-names>
          </string-name>
          <string-name>
            <surname>Chi</surname>
          </string-name>
          ,
          <article-title>Learning multigranular quantized embeddings for large-vocab categorical features in recommender systems</article-title>
          ,
          <source>in: Companion Proceedings of the Web Conference</source>
          <year>2020</year>
          , ACM, New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref59">
        <mixed-citation>
          [59]
          <string-name>
            <given-names>D.</given-names>
            <surname>Antognini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Faltings</surname>
          </string-name>
          ,
          <article-title>Fast multi-step critiquing for VAE-based recommender systems</article-title>
          ,
          <source>in: Fifteenth ACM Conference on Recommender Systems</source>
          , ACM, New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref60">
        <mixed-citation>
          [60]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Ge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , L. Lin,
          <article-title>Real-time Attention Based Look-alike Model for Recommender System</article-title>
          ,
          <source>in: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery &amp;amp; Data Mining, ACM</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref61">
        <mixed-citation>
          [61]
          <string-name>
            <given-names>D.</given-names>
            <surname>Lian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <surname>X. Xie,</surname>
          </string-name>
          <article-title>LightRec: A memory and search-eficient recommender system</article-title>
          ,
          <source>in: Proceedings of The Web Conference</source>
          <year>2020</year>
          , ACM, New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref62">
        <mixed-citation>
          [62]
          <string-name>
            <given-names>D.</given-names>
            <surname>Kalimeris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bhagat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kalyanaraman</surname>
          </string-name>
          , U. Weinsberg,
          <article-title>Preference amplification in recommender systems</article-title>
          ,
          <source>in: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery &amp; Data Mining</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref63">
        <mixed-citation>
          [63]
          <string-name>
            <given-names>C.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhuang</surname>
          </string-name>
          , C. Ma, J. Zhang, H. Xiong, DuerQuiz, in
          <source>: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery &amp;amp; Data Mining, ACM</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref64">
        <mixed-citation>
          [64]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Charlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. M.</given-names>
            <surname>Blei</surname>
          </string-name>
          ,
          <article-title>Causal inference for recommender systems</article-title>
          ,
          <source>in: Fourteenth ACM Conference on Recommender Systems</source>
          , ACM, New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref65">
        <mixed-citation>
          [65]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <surname>X. Zhang,</surname>
          </string-name>
          <article-title>Fast-adapting and privacy-preserving federated recommender system</article-title>
          ,
          <source>The VLDB Journal</source>
          <volume>31</volume>
          (
          <year>2021</year>
          )
          <fpage>877</fpage>
          -
          <lpage>896</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref66">
        <mixed-citation>
          [66]
          <string-name>
            <given-names>W.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Khenissi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Nasraoui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Shafto</surname>
          </string-name>
          ,
          <article-title>Debiasing the Human-Recommender System Feedback Loop in Collaborative Filtering</article-title>
          ,
          <source>in: Companion Proceedings of The 2019 World Wide Web Conference</source>
          , ACM,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref67">
        <mixed-citation>
          [67]
          <string-name>
            <given-names>X.</given-names>
            <surname>Xin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Karatzoglou</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Arapakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Jose</surname>
          </string-name>
          ,
          <article-title>Self-Supervised Reinforcement Learning for Recommender Systems</article-title>
          ,
          <source>in: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , ACM,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref68">
        <mixed-citation>
          [68]
          <string-name>
            <surname>C. Wu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Lian</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Ge</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Zhu</surname>
          </string-name>
          , E. Chen,
          <article-title>Triple adversarial learning for influence based poisoning attack in recommender systems</article-title>
          ,
          <source>in: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery &amp; Data Mining</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref69">
        <mixed-citation>
          [69]
          <string-name>
            <given-names>J.</given-names>
            <surname>You</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Eksombatchai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Rosenburg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Leskovec</surname>
          </string-name>
          ,
          <article-title>Hierarchical Temporal Convolutional Networks for Dynamic Recommender Systems</article-title>
          , in: The World Wide Web Conference, ACM,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref70">
        <mixed-citation>
          [70]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , J. Caverlee,
          <article-title>Key opinion leaders in recommendation systems</article-title>
          ,
          <source>in: Proceedings of the 13th International Conference on Web Search and Data Mining</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref71">
        <mixed-citation>
          [71]
          <string-name>
            <given-names>W.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <surname>X. Wu,</surname>
          </string-name>
          <article-title>AdaFS: Adaptive Feature Selection in Deep Recommender System</article-title>
          ,
          <source>in: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref72">
        <mixed-citation>
          [72]
          <string-name>
            <given-names>L.</given-names>
            <surname>Zou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Song</surname>
          </string-name>
          , W. Liu,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <article-title>Reinforcement Learning to Optimize Long-term User Engagement in Recommender Systems</article-title>
          ,
          <source>in: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery &amp;amp; Data Mining, ACM</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref73">
        <mixed-citation>
          [73]
          <string-name>
            <given-names>G.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , D. Zhang, FairCharge,
          <source>Proc. ACM Interact. Mob. Wearable Ubiquitous Technol</source>
          .
          <volume>4</volume>
          (
          <issue>2020</issue>
          )
          <fpage>1</fpage>
          -
          <lpage>25</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref74">
        <mixed-citation>
          [74]
          <string-name>
            <given-names>X.</given-names>
            <surname>Xin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Karatzoglou</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Arapakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Jose</surname>
          </string-name>
          ,
          <article-title>Supervised Advantage Actor-Critic for Recommender Systems</article-title>
          ,
          <source>in: Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining, ACM</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref75">
        <mixed-citation>
          [75]
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , W. Ma, Y. Liu, S. Ma,
          <article-title>Modeling Item-Specific Temporal Dynamics of Repeat Consumption for Recommender Systems</article-title>
          , in: The World Wide Web Conference, ACM,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref76">
        <mixed-citation>
          [76]
          <string-name>
            <given-names>M.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <surname>X.-M. Wu</surname>
          </string-name>
          ,
          <article-title>M2GRL: A multi-task multi-view graph representation learning framework for web-scale recommender systems</article-title>
          ,
          <source>in: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref77">
        <mixed-citation>
          [77]
          <string-name>
            <given-names>D.</given-names>
            <surname>Zou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.-L.</given-names>
            <surname>Mao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Qiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <surname>X.</surname>
          </string-name>
          <article-title>Cao, Multi-level Cross-view Contrastive Learning for Knowledge-aware Recommender System</article-title>
          ,
          <source>in: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , ACM,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref78">
        <mixed-citation>
          [78]
          <string-name>
            <given-names>H.</given-names>
            <surname>Bharadhwaj</surname>
          </string-name>
          ,
          <article-title>Explainable recommender system that maximizes exploration</article-title>
          ,
          <source>in: Proceedings of the 24th International Conference on Intelligent User Interfaces: Companion</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref79">
        <mixed-citation>
          [79]
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <article-title>Exploring clustering of bandits for online recommendation system</article-title>
          ,
          <source>in: Fourteenth ACM Conference on Recommender Systems</source>
          , ACM, New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref80">
        <mixed-citation>
          [80]
          <string-name>
            <given-names>T.</given-names>
            <surname>Xiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Towards Unbiased and Robust Causal Ranking for Recommender Systems</article-title>
          ,
          <source>in: Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining, ACM</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref81">
        <mixed-citation>
          [81]
          <string-name>
            <given-names>P.</given-names>
            <surname>Kouki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schafer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pujara</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. O'Donovan</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Getoor</surname>
          </string-name>
          ,
          <article-title>Personalized explanations for hybrid recommender systems</article-title>
          ,
          <source>in: Proceedings of the 24th International Conference on Intelligent User Interfaces</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref82">
        <mixed-citation>
          [82]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , J. Caverlee,
          <article-title>Improving the estimation of tail ratings in recommender system with multi-latent representations</article-title>
          ,
          <source>in: Proceedings of the 13th International Conference on Web Search and Data Mining</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref83">
        <mixed-citation>
          [83]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Jiang</surname>
          </string-name>
          , H. Hu,
          <fpage>C2</fpage>
          -CRS, in
          <source>: Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining, ACM</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref84">
        <mixed-citation>
          [84]
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Guo, Exploring High-Order User Preference on the Knowledge Graph for Recommender Systems</article-title>
          ,
          <source>ACM Transactions on Information Systems</source>
          <volume>37</volume>
          (
          <year>2019</year>
          )
          <fpage>1</fpage>
          -
          <lpage>26</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref85">
        <mixed-citation>
          [85]
          <string-name>
            <given-names>K.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-R.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <article-title>Improving conversational recommender systems via knowledge graph based semantic fusion</article-title>
          ,
          <source>in: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref86">
        <mixed-citation>
          [86]
          <string-name>
            <given-names>W. L.</given-names>
            <surname>Leite</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Roy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Chakraborty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Michailidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. C.</given-names>
            <surname>Huggins-Manley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. D</given-names>
            <surname>'Mello</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. K. S. Faradonbeh</surname>
            , E. Jensen,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Kuang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Jing</surname>
          </string-name>
          ,
          <article-title>A novel video recommendation system for algebra: An efectiveness evaluation study</article-title>
          ,
          <source>in: LAK22: 12th International Learning Analytics and Knowledge Conference</source>
          , ACM,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref87">
        <mixed-citation>
          [87]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <article-title>Utility-based multi-criteria recommender systems</article-title>
          ,
          <source>in: Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, ACM</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref88">
        <mixed-citation>
          [88]
          <string-name>
            <given-names>Z. A.</given-names>
            <surname>Pardos</surname>
          </string-name>
          , W. Jiang,
          <article-title>Designing for serendipity in a university course recommendation system</article-title>
          ,
          <source>in: Proceedings of the Tenth International Conference on Learning Analytics &amp; Knowledge</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref89">
        <mixed-citation>
          [89]
          <string-name>
            <given-names>N. R.</given-names>
            <surname>Kermany</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Pizzato</surname>
          </string-name>
          ,
          <article-title>Fair-SRS: A Fair Session-based Recommendation System</article-title>
          ,
          <source>in: Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining, ACM</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref90">
        <mixed-citation>
          [90]
          <string-name>
            <given-names>M.</given-names>
            <surname>Khwaja</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ferrer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. O.</given-names>
            <surname>Iglesias</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Faisal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Matic</surname>
          </string-name>
          ,
          <article-title>Aligning daily activities with personality</article-title>
          ,
          <source>in: Proceedings of the 13th ACM Conference on Recommender Systems</source>
          , ACM,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref91">
        <mixed-citation>
          [91]
          <string-name>
            <given-names>K.</given-names>
            <surname>Mahadik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sabne</surname>
          </string-name>
          ,
          <article-title>Fast distributed bandits for online recommendation systems</article-title>
          ,
          <source>in: Proceedings of the 34th ACM International Conference on Supercomputing, ACM</source>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref92">
        <mixed-citation>
          [92]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-R.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <article-title>Towards Universal Sequence Representation Learning for Recommender Systems</article-title>
          ,
          <source>in: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref93">
        <mixed-citation>
          [93]
          <string-name>
            <given-names>P. T.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Rocco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. D.</given-names>
            <surname>Ruscio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ochoa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Degueule</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. D.</given-names>
            <surname>Penta</surname>
          </string-name>
          ,
          <article-title>FOCUS: A Recommender System for Mining API Function Calls and Usage Patterns</article-title>
          , in: 2019
          <source>IEEE/ACM 41st International Conference on Software Engineering (ICSE)</source>
          , IEEE,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref94">
        <mixed-citation>
          [94]
          <string-name>
            <given-names>E.</given-names>
            <surname>Shulman</surname>
          </string-name>
          , L. Wolf,
          <article-title>Meta decision trees for explainable recommendation systems</article-title>
          ,
          <source>in: Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society</source>
          , ACM, New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref95">
        <mixed-citation>
          [95]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <surname>X. Wu,</surname>
          </string-name>
          <article-title>AutoField: Automating Feature Selection in Deep Recommender Systems</article-title>
          ,
          <source>in: Proceedings of the ACM Web Conference</source>
          <year>2022</year>
          , ACM,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref96">
        <mixed-citation>
          [96]
          <string-name>
            <given-names>Q.-T.</given-names>
            <surname>Truong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lauw</surname>
          </string-name>
          ,
          <article-title>Multimodal Review Generation for Recommender Systems</article-title>
          , in: The World Wide Web Conference, ACM,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref97">
        <mixed-citation>
          [97]
          <string-name>
            <given-names>L. V.</given-names>
            <surname>Tran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , G. Cong,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          , HyperML, in
          <source>: Proceedings of the 13th International Conference on Web Search and Data Mining, ACM</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref98">
        <mixed-citation>
          [98]
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , J. Leskovec,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systems</article-title>
          ,
          <source>in: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery &amp;amp; Data Mining, ACM</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref99">
        <mixed-citation>
          [99]
          <string-name>
            <given-names>A. H.</given-names>
            <surname>Jadidinejad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Macdonald</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Ounis</surname>
          </string-name>
          ,
          <article-title>Using exploration to alleviate closed loop efects in recommender systems</article-title>
          ,
          <source>in: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref100">
        <mixed-citation>
          [100]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kanakia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Eide</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A Scalable</given-names>
            <surname>Hybrid</surname>
          </string-name>
          <article-title>Research Paper Recommender System for Microsoft Academic</article-title>
          , in: The World Wide Web Conference, ACM,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref101">
        <mixed-citation>
          [101]
          <string-name>
            <given-names>N.</given-names>
            <surname>Yadav</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <article-title>Bi-directional Encoder Representation of Transformer model for Sequential Music Recommender System, in: Forum for Information Retrieval Evaluation</article-title>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref102">
        <mixed-citation>
          [102]
          <string-name>
            <given-names>D.</given-names>
            <surname>Tsumita</surname>
          </string-name>
          , T. Takagi,
          <article-title>Dialogue based recommender system that flexibly mixes utterances and recommendations</article-title>
          , in: IEEE/WIC/ACM International Conference on Web Intelligence, ACM,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref103">
        <mixed-citation>
          [103]
          <string-name>
            <surname>C. Wu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Lian</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Ge</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Yuan</surname>
          </string-name>
          ,
          <article-title>Fight fire with fire: Towards robust recommender systems via adversarial poisoning training</article-title>
          ,
          <source>in: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref104">
        <mixed-citation>
          [104]
          <string-name>
            <given-names>D.</given-names>
            <surname>Rafailidis</surname>
          </string-name>
          ,
          <article-title>Bayesian Deep Learning with Trust and Distrust in Recommendation Systems</article-title>
          , in: IEEE/WIC/ACM International Conference on Web Intelligence, ACM,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref105">
        <mixed-citation>
          [105]
          <string-name>
            <given-names>J.</given-names>
            <surname>Cho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hyun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <article-title>Unsupervised proxy selection for session-based recommender systems</article-title>
          ,
          <source>in: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref106">
        <mixed-citation>
          [106]
          <string-name>
            <given-names>F.</given-names>
            <surname>Eskandanian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Sonboli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mobasher</surname>
          </string-name>
          ,
          <article-title>Power of the Few</article-title>
          ,
          <source>in: Proceedings of the 27th ACM Conference on User Modeling, Adaptation and Personalization</source>
          , ACM,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref107">
        <mixed-citation>
          [107]
          <string-name>
            <given-names>C.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          , G. Xv,
          <string-name>
            <given-names>H.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Mitigating sentiment bias for recommender systems</article-title>
          ,
          <source>in: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref108">
        <mixed-citation>
          [108]
          <string-name>
            <given-names>R.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kahou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Schulz</surname>
          </string-name>
          , V. Michalski, L. Charlin,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pal</surname>
          </string-name>
          , Towards deep conversational recommendations,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref109">
        <mixed-citation>
          [109]
          <string-name>
            <given-names>K.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-R.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <article-title>Towards topic-guided conversational recommender system</article-title>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref110">
        <mixed-citation>
          [110]
          <string-name>
            <surname>J. McAuley</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Leskovec</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Jurafsky</surname>
          </string-name>
          ,
          <article-title>Learning Attitudes and Attributes from Multiaspect Reviews</article-title>
          ,
          <source>in: 2012 IEEE 12th International Conference on Data Mining</source>
          ,
          <year>2012</year>
          , pp.
          <fpage>1020</fpage>
          -
          <lpage>1025</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref111">
        <mixed-citation>
          [111]
          <string-name>
            <surname>T.-H. Wen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Vandyke</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Mrksic</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Gasic</surname>
            ,
            <given-names>L. M.</given-names>
          </string-name>
          <string-name>
            <surname>Rojas-Barahona</surname>
            ,
            <given-names>P.-H.</given-names>
          </string-name>
          <string-name>
            <surname>Su</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Ultes</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Young</surname>
          </string-name>
          ,
          <article-title>A network-based end-to-end trainable task-oriented dialogue system</article-title>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref112">
        <mixed-citation>
          [112]
          <string-name>
            <given-names>T.</given-names>
            <surname>Schnabel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Swaminathan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Chandak</surname>
          </string-name>
          , T. Joachims,
          <article-title>Recommendations as treatments: Debiasing learning</article-title>
          and evaluation,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref113">
        <mixed-citation>
          [113]
          <string-name>
            <given-names>P.</given-names>
            <surname>Achananuparp</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Weber</surname>
          </string-name>
          ,
          <article-title>Extracting food substitutes from food diary via distributional similarity</article-title>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref114">
        <mixed-citation>
          [114]
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Harper</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Konstan</surname>
          </string-name>
          ,
          <article-title>The MovieLens datasets: History and context</article-title>
          ,
          <source>ACM transactions on interactive intelligent systems 5</source>
          (
          <year>2016</year>
          )
          <fpage>1</fpage>
          -
          <lpage>19</lpage>
          . doi:
          <volume>10</volume>
          .1145/2827872.
        </mixed-citation>
      </ref>
      <ref id="ref115">
        <mixed-citation>
          [115]
          <string-name>
            <given-names>A.</given-names>
            <surname>Gonzalez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ortega</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Perez-Lopez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Alonso</surname>
          </string-name>
          ,
          <article-title>Bias and unfairness of collaborative ifltering based recommender systems in MovieLens dataset, IEEE access: practical innovations</article-title>
          ,
          <source>open solutions 10</source>
          (
          <year>2022</year>
          )
          <fpage>68429</fpage>
          -
          <lpage>68439</lpage>
          . URL: http://dx.doi.org/10.1109/access.
          <year>2022</year>
          .
          <volume>3186719</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref116">
        <mixed-citation>
          [116]
          <string-name>
            <given-names>S.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pentland</surname>
          </string-name>
          ,
          <article-title>An empirical study identifying bias in Yelp dataset</article-title>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref117">
        <mixed-citation>
          [117]
          <string-name>
            <given-names>N.</given-names>
            <surname>Sambasivan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kapania</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Highfill</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Akrong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Paritosh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. M.</given-names>
            <surname>Aroyo</surname>
          </string-name>
          , “
          <article-title>Everyone wants to do the model work, not the data work”: Data Cascades in High-Stakes AI</article-title>
          ,
          <source>in: Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems, ACM</source>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref118">
        <mixed-citation>
          [118]
          <string-name>
            <given-names>E.</given-names>
            <surname>Zangerle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bauer</surname>
          </string-name>
          ,
          <article-title>Evaluating Recommender systems: Survey and framework</article-title>
          , volume=
          <volume>55</volume>
          , number=8, ACM computing surveys (
          <year>2023</year>
          )
          <fpage>1</fpage>
          -
          <lpage>38</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref119">
        <mixed-citation>
          [119]
          <string-name>
            <given-names>A.</given-names>
            <surname>Lindgreen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. A.</given-names>
            <surname>Di</surname>
          </string-name>
          <string-name>
            <surname>Benedetto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. J.</given-names>
            <surname>Brodie</surname>
          </string-name>
          , Research quality: What it is, and how to achieve it, volume=
          <volume>99</volume>
          , issn=
          <fpage>0019</fpage>
          -
          <lpage>8501</lpage>
          , Industrial marketing management (
          <year>2021</year>
          )
          <fpage>A13</fpage>
          -
          <lpage>A19</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref120">
        <mixed-citation>
          [120]
          <string-name>
            <given-names>T.</given-names>
            <surname>Gebru</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Morgenstern</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Vecchione</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Vaughan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wallach</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Daumé</surname>
          </string-name>
          , Hal,
          <string-name>
            <given-names>K.</given-names>
            <surname>Crawford</surname>
          </string-name>
          , Datasheets for Datasets,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref121">
        <mixed-citation>
          [121]
          <string-name>
            <given-names>M.</given-names>
            <surname>Pushkarna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zaldivar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Kjartansson</surname>
          </string-name>
          ,
          <article-title>Data cards: Purposeful and transparent dataset documentation for responsible ai</article-title>
          ,
          <source>2022 ACM Conference on Fairness, Accountability</source>
          , and
          <string-name>
            <surname>Transparency</surname>
          </string-name>
          (
          <year>2022</year>
          ). URL: https://doi.org/10.1145/3531146.3533231. doi:
          <volume>10</volume>
          .1145/ 3531146.3533231.
        </mixed-citation>
      </ref>
      <ref id="ref122">
        <mixed-citation>
          [122]
          <string-name>
            <given-names>M.</given-names>
            <surname>Burget</surname>
          </string-name>
          , E. Bardone,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pedaste</surname>
          </string-name>
          ,
          <article-title>Definitions and conceptual dimensions of Responsible Research and Innovation: A literature review</article-title>
          ,
          <source>Science and engineering ethics 23</source>
          (
          <year>2017</year>
          )
          <fpage>1</fpage>
          -
          <lpage>19</lpage>
          . URL: https://link.springer.com/article/10.1007/s11948-016-9782-1.
        </mixed-citation>
      </ref>
      <ref id="ref123">
        <mixed-citation>
          [123]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <article-title>AI ethics: from principles to practice</article-title>
          ,
          <source>AI</source>
          society (
          <year>2022</year>
          ). URL: https: //link.springer.com/article/10.1007/s00146-022-01602-z.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>