<!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>
      <journal-title-group>
        <journal-title>International Journal of Data Science and Analytics</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Shaina Raza</string-name>
          <email>shaina.raza@torontomu.ca</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chen Ding</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Toronto Metropolitan University</institution>
          ,
          <addr-line>ON</addr-line>
          ,
          <country country="CA">Canada</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <volume>13</volume>
      <issue>2022</issue>
      <abstract>
        <p>News recommendation systems face unique challenges, including the dynamic nature of user preferences and the need for diversity in recommended news articles. To address these challenges, we propose a deep neural network architecture that learns representations for both news items and users. Our approach uses an enhanced vector for each query and news item to facilitate information interaction between these entities. To overcome selection bias in implicit user feedback, we employ negative sampling. We also promote diversity in recommended news by aligning the uneven news category representations of items in a loss function. Experimental results on a benchmark dataset demonstrate the superiority of our proposed architecture over baselines, achieving both relevancy and diversity in the news recommendations.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Prominent news organizations such as Yahoo!, BBC, NYTimes, and CNN have introduced
online news portals, which users can access from any location to peruse a wide range of news
categories and stay up-to-date. However, with the abundance of information available on the
internet, locating pertinent news has become a challenging and time-consuming task. News
recommender systems (NRS) address the issue of information overload by presenting users with
personalized and intriguing recommendations, chosen from an extensive pool of available news
articles [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
of an NRS.
      </p>
      <p>An NRS must balance between maintaining relevance to the user’s interests and introducing
enough diversity to keep the user engaged. If the NRS recommends news articles that are too
diverse or unrelated to the user’s interests, the user may lose interest and stop using the system.
Conversely, if the NRS recommends only news articles that are closely related to the user’s
interests, it may miss out on opportunities to introduce the user to new topics and categories.
Therefore, finding the optimal balance between relevance and diversity is crucial for the success</p>
      <p>
        In general, users’ preferences can be either long-term or short-term, with short-term
preferences defining their current interests. For example, a user may have a long-standing interest in
Joint Proceedings of 10th International Workshop on News Recommendation and Analytics (INRA’22) and the Third
International Workshop on Investigating Learning During Web Search (IWILDS‘22) co-located with the 45th International
ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR’22), July 15, 2022, Madrid, Spain
a particular topic, such as climate change, and read numerous articles related to this topic over
the course of their lifetime [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. However, if the user has been reading only news articles related
to climate change for an extended period, the NRS may consider suggesting news articles on
related topics, such as sustainable living or renewable energy, to introduce some diversity into
the recommendations. By doing so, the NRS can help the user explore related topics and expand
their knowledge in the field, while also keeping them engaged with new and exciting news
articles.
      </p>
      <p>Short-term interests can also be identified by analyzing the user’s recent behavior on the
NRS. For instance, if a user has been reading numerous articles on a particular topic over the
past few days, the NRS can infer that the user is currently interested in that topic and adjust its
recommendations accordingly. By incorporating short-term interests into the recommendation
process, the NRS can provide more personalized and relevant recommendations to the user.</p>
      <p>
        This paper presents an NRS that prioritizes both relevancy and diversity in the
recommendation process, achieving a more balanced and engaging user experience. The specific
contributions of this paper are:
• The proposed deep neural network is based on a query-candidate architecture [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ][
        <xref ref-type="bibr" rid="ref4">4</xref>
        ],
featuring a query (user) model that retrieves relevant news items and an item (candidate
news) model that ranks them based on user actions. The model introduces a similarity
score between the user feedback and item representations, enabling it to recommend a
more diverse set of news articles.
• The proposed model takes into account the uneven distribution of news articles across
diferent categories, which is prevalent in news data, and ensures that recommendations
include a balance of news items from all categories.
• The proposed model also ofer a negative sampling approach to tackle the selection bias
of implicit user feedback by bringing in news samples from the entire news corpus.
      </p>
      <p>Extensive experiments on a news dataset show that our proposed approach can provide both
relevant and diversified news recommendations in an NRS.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Proposed Approach</title>
      <p>Next, we discuss our approach.</p>
      <sec id="sec-2-1">
        <title>2.1. Problem Formulation</title>
        <p>The objective of news recommendation is to select relevant candidate news items from a news

corpus, given a set of queries. The item set is represented as {  }=1 and the query set as
{  }=1 . The recommendation problem, denoted as R, is learned from the query-item feedback
represented by a matrix ℝ × . Each query is considered as feedback provided by the user.
If query j gives positive feedback on news item i, then   = 1; otherwise, it is considered as

non-positive feedback.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Query-Candidate Model</title>
        <p>We show our proposed architecture in Figure 1 and explain next.</p>
        <p>The proposed model is a query-candidate model that consists of an embedding layer, an
augmented layer, and two models (query and news item generation). The model takes into
account diferent content features related to news items, such as news ID, title, body, and
category, as well as contextual information.</p>
        <p>The embedding layer is represented by an embedding matrix E ∈ ℝ× , which maps each
piece of information (e.g., news item or user ID) in   and   to a low-dimensional dense vector
  ∈ ℝ .</p>
        <p>The augmented layer creates two augmented vectors   and   by concatenating the IDs
corresponding to two input feature vectors f and f , respectively. These augmented vectors
are then concatenated with the original feature vectors f and f to obtain the augmented
representations of query   and news item   . The fully connected layers with the ReLU activation
function are applied to these concatenated vectors, and the output from the fully connected
layers goes through the  2 normalization layer to obtain the augmented representations of
query   and news item   .</p>
        <p>The loss function of the proposed model is defined as the mean square error between the
augmented vectors   and   and query/item embedding for each sample of which label equals 1.
The augmented vectors   and   are used to fit all positive interactions in the model belonging
to the corresponding query or item. The stop gradient strategy is applied to stop the gradient of
  and   from flowing back into   and   , respectively. The output of the model is the inner
product of the query embedding and news item embeddings.</p>
        <p>To improve the generalization ability of the model and enable it to learn more transferable
features across diferent news categories, we introduce an additional loss function during
the training phase. This loss function aims to minimize the distance between the feature
representations of news items from diferent categories. To achieve this, we first select the
largest news category as the reference category. We then calculate the squared Euclidean
distance between the feature representations of news items in this category and the feature
representations of news items in the other categories. This loss function is added to the overall
objective function, with a regularization parameter to control its relative importance.</p>
        <p>The final loss function is calculated as the sum of the binary cross-entropy loss, the loss
functions for query and news item representations, and the category-aware loss function.</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Training</title>
        <p>To train the model for news recommendation, we treat the problem as a binary classification
task. We use a random negative sampling technique, where for each positive query-item pair
(the label = 1), we randomly select a set of N news items from the news corpus to create negative
query-item pairs (the label = 0) for that query. This process results in a dataset with a balance
of positive and negative samples. We then use binary cross-entropy loss to train the model by
minimizing the error between the predicted scores and the ground truth labels.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Experimental Settings</title>
      <p>
        We use the benchmark dataset MIND-small [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] that was collected during 6 weeks (Oct. 12, 2019
to Nov. 22, 2019), with 50k users, 161,013 news, and 156,925 clicks.
      </p>
      <p>
        Following the standard evaluation methodology s in NRS [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ],[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], we conduct a time-based
splitting and use the following metrics.
      </p>
      <p>Relevancy metrics: We use Mean Reciprocal Rank (MRR) and F1-score (harmonic mean of
precision and recall) to evaluate the relevancy of news recommendations. MRR is the average
of the reciprocal rank of the first relevant item in the recommendation list for a set of queries.</p>
      <p>To compute MRR, we first calculate the reciprocal rank for each query:</p>
      <p>Reciprocal Rank = 1</p>
      <p>rank of first relevant item
Then, MRR is calculated as the mean of the reciprocal ranks for all queries:
(1)
MRR =
∑|=| 1 Reciprocal Rank
||
where || is the number of queries.</p>
      <p>
        Diversity metric: In addition to the relevancy metrics of MRR and F1-score, we also use the
GINI index to evaluate the diversity of news recommendations. GINI is a diversity metric that
measures the inequality of item distribution across diferent categories or clusters [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. In the
context of news recommendation systems, GINI reflects the extent to which recommended
news articles cover a variety of topics and viewpoints. To calculate GINI, we first group the
recommended news articles into diferent categories based on their content. Then, we compute
the proportion of news articles in each category and use this information to calculate the GINI
index.
      </p>
      <p>Tradeof metric : In the context of news recommendation systems, trade-ofs are necessary
to balance multiple objectives, such as relevancy and diversity. Striking an optimal balance
between these two aspects enhances user satisfaction and engagement. We use the trade-of
metric, which is the product of the MRR and GINI scores, divided by their sum, multiplied by 2,
to measure the balance between relevancy and diversity.</p>
      <p>tradeof = 2 ∗
( MRR ∗ GINI )
( MRR + GINI )</p>
      <p>The trade-of metric ranges from 0 to 1, with higher values indicating a better balance between
relevancy and diversity. By evaluating both relevancy and diversity, we can ensure that our
news recommendation system provides users with personalized, engaging, and informative
news articles. The trade-of metric ranges from 0 to 1, with higher values indicating a better
balance between relevancy and diversity.</p>
      <p>We use the following baseline methods for evaluation.</p>
      <p>
        Wide Deep [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], a hybrid model that combines deep neural networks with linear models for
recommendation. It is designed to provide both memorization and generalization capabilities.
      </p>
      <p>
        DKN [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], a knowledge-aware news recommendation method that incorporates knowledge
graphs for news representation and recommendation.
      </p>
      <p>
        LightGCN [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], a simplified Graph Convolutional Network (GCN) for collaborative filtering,
aiming to reduce complexity while maintaining performance.
      </p>
      <p>
        SASRec [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], a self-attentive sequential recommendation model that captures long-range
dependencies in user sequences for personalized recommendation.
      </p>
      <p>
        NeuMF [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], a hybrid model that combines the strengths of Generalized Matrix Factorization
(GMF) and Multi-Layer Perceptron (MLP) for better recommendation performance.
      </p>
      <p>We implemented these models in TensorFlow. The embedding dimension and batch size were
ifxed to 32 and 256. We use the Adam optimizer for training. Other hyperparameters of all
models were individually tuned to achieve optimal results to ensure a fair comparison. The
dimensions of augmented vectors were both set to d= 32, and the tuning parameter  1,  2 were
set to 0.5 and  3 to 1. We set top@ k to 5 and 10 as it is normally good practice to retrieve a
relatively large number of candidate news items to rank.
(2)
(3)</p>
    </sec>
    <sec id="sec-4">
      <title>4. Results and Discussion</title>
      <sec id="sec-4-1">
        <title>4.1. Performance Evaluation</title>
        <p>
          We evaluate the results for both relevancy and diversity and mainly evaluate the model
performance based on the tradeof score, as it shows a harmonic mean between relevancy and
diversity. We expect a good tradeof score to be above 50% as it is a balancing score between 2
diferent metrics [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ][
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. The results are shown in Table 2.
        </p>
        <p>Method
Wide &amp; Deep
DKN
LightGCN
SASRec
NeuMF
Proposed Model</p>
        <p>Overall, we observe in Table 1, our proposed approach outperforms all the other methods in
terms of relevancy (MRR, F1, precision), diversity (GINI), and trade-of scores on the dataset. This
indicates that the current model is capable of providing personalized news recommendations
that are not only relevant to individual users but also diverse enough to expose them to a variety
of content. The relevancy scores may not be optimal but we achieve balanced tradeof scores.</p>
        <p>The improvements in relevancy, as demonstrated by the higher MRR and F1-score, suggest
that the current model can better capture users’ preferences and deliver news articles that cater
to their interests. This is particularly important in the news recommendation domain, where
user engagement largely depends on the presentation of content that aligns with their interests
and preferences.</p>
        <p>The higher diversity, as represented by the GINI score, shows that the current model is able
to recommend a more diverse set of news articles, helping users discover new and unexpected
content. This is an essential aspect of a news recommender system, as it encourages users to
explore diferent perspectives and broadens their understanding of various topics.</p>
        <p>Moreover, the better trade-of score signifies that the current model strikes an optimal
balance between relevancy and diversity, ensuring that users receive a well-rounded set of
recommendations. This balance is crucial in maintaining user satisfaction and engagement,
as it prevents filter bubbles and echo chambers from forming while still providing users with
content that matches their interests.</p>
        <p>
          These results also show that by using negative sampling, we are reducing the selection bias
[
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. This is shown by the relatively higher diversity score of our model compared to other
items, as all news items in the corpus get a chance to serve as negatives so that the model gets
better retrievals towards diversified and long-tail items.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Relation Between Relevancy and Diversity</title>
        <p>Next, we showcase the relevancy-diversity trade-of achieved by our model in Figure 2.</p>
        <p>In Figure 2, we observe several trends and relationships between relevancy, diversity, and
the tradeof as the number of recommendations increases. The relevancy scores decrease
as the number of recommendations increases. This observation suggests that it becomes
more challenging for the recommender system to maintain high relevancy for all items as the
recommendation list size grows. This challenge is a common trade-of in recommender systems,
as providing more recommendations can increase the likelihood of including diverse items at
the cost of potentially lower relevancy for some items.</p>
        <p>Conversely, diversity scores increase with the number of recommendations. This trend
indicates that the recommender system is capable of providing more diverse recommendations
as the list size grows. Including a larger variety of items in the recommendation list can enhance
the user experience, as it exposes users to a broader range of content that may match their
interests.</p>
        <p>The tradeof scores, which measure the balance between relevancy and diversity, remain
relatively stable across diferent recommendation list sizes. This stability suggests that the
recommender system is maintaining a reasonable balance between providing relevant and
diverse recommendations. In the given example, the tradeof scores show a slight decrease
as the number of recommendations increases, indicating a minor compromise in balancing
relevancy and diversity for larger recommendation lists.</p>
        <p>This analysis highlights the challenge of balancing relevancy and diversity in recommender
systems as the number of recommendations increases. It is crucial to find a suitable balance to
ensure an optimal user experience, providing recommendations that are both relevant to the
user’s preferences and diverse enough to expose them to a variety of content.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Negative Sampling</title>
        <p>To analyze the impact of negative sampling on our news recommendation system, we compared
the performance of the model with and without negative sampling using precision and recall
metrics at a recommendation list size of 10. As illustrated in Figure 3, employing negative
sampling significantly improves both precision and recall scores. This finding highlights the
importance of incorporating negative samples during the model training process, as it enables
the system to provide more accurate and diverse recommendations for users.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. CONCLUSION</title>
      <p>In this paper, we present a deep neural network-based architecture designed to model the
information interaction between query and news items. Our approach incorporates a variety of
features in both the news item and query representations. Additionally, we introduce a loss
function that selects distinctive news items across diferent news categories. We briefly discuss
selection bias and demonstrate how using negative sampling can mitigate this bias by including
random negatives from the news corpus.</p>
      <p>
        Extensive experiments on a benchmark dataset showcase the superior performance of our
proposed method in achieving a balance between accuracy and diversity. For future work, we
plan to conduct experiments on additional real-world news datasets and explore the potential
of deeper neural networks. We also intend to incorporate more evaluation metrics to assess
relevancy, diversity, and novelty in the recommendation results. Furthermore, we aim to address
challenges such as mitigating biases [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] and combating fake news [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] in news recommendation
systems by employing more advanced deep neural networks.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Raza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <article-title>News recommender system: a review of recent progress, challenges, and opportunities</article-title>
          ,
          <source>Artificial Intelligence Review</source>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>52</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Raza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <article-title>A regularized model to trade-of between accuracy and diversity in a news recommender system</article-title>
          ,
          <source>in: 2020 IEEE International Conference on Big Data (Big Data)</source>
          , IEEE,
          <year>2020</year>
          , pp.
          <fpage>551</fpage>
          -
          <lpage>560</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>R.</given-names>
            <surname>Wang</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>
          , D. Z. Cheng, L. Hong,
          <string-name>
            <given-names>S.</given-names>
            <surname>Tjoa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kang</surname>
          </string-name>
          , E. Ettinger,
          <string-name>
            <given-names>H.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <article-title>Improving relevance prediction with transfer learning in large-scale retrieval systems</article-title>
          ,
          <source>in: Proceedings of the 1st Adaptive &amp; Multitask Learning Workshop</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Yi</surname>
          </string-name>
          , D. Zhiyuan Cheng, L. Hong,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. Xiaoming</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. H.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <article-title>Mixed negative sampling for learning two-tower neural networks in recommendations</article-title>
          ,
          <source>in: Companion Proceedings of the Web Conference</source>
          <year>2020</year>
          ,
          <year>2020</year>
          , pp.
          <fpage>441</fpage>
          -
          <lpage>447</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>F.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Qiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-H.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wu</surname>
          </string-name>
          , et al.,
          <article-title>Mind: A large-scale dataset for news recommendation</article-title>
          ,
          <source>in: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>3597</fpage>
          -
          <lpage>3606</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <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>X.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Guo</surname>
          </string-name>
          , Dkn:
          <article-title>Deep knowledge-aware network for news recommendation</article-title>
          ,
          <source>in: Proceedings of the 2018 world wide web conference</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>1835</fpage>
          -
          <lpage>1844</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sun</surname>
          </string-name>
          , J. Liu,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Ou</surname>
          </string-name>
          , P. Jiang,
          <article-title>BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformer</article-title>
          ,
          <source>in: Proceedings of the 28th ACM International Conference on Information and Knowledge Management</source>
          , CIKM '19,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery,
          <year>2019</year>
          , pp.
          <fpage>1441</fpage>
          -
          <lpage>1450</lpage>
          .
          <source>doi:1 0 . 1 1</source>
          <volume>4 5 / 3 3 5 7 3 8 4 . 3 3 5 7 8 9 5 .</volume>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8] H.-T. Cheng, L. Koc,
          <string-name>
            <given-names>J.</given-names>
            <surname>Harmsen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Shaked</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Chandra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Aradhye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Anderson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Ravichander</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pennington</surname>
          </string-name>
          , et al.,
          <article-title>Wide &amp; deep learning for recommender systems</article-title>
          ,
          <source>in: Proceedings of the 1st Workshop on Deep Learning for Recommender Systems</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>7</fpage>
          -
          <lpage>10</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Deng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Lightgcn: Simplifying and powering graph convolution network for recommendation</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="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>W.-C. Kang</surname>
            ,
            <given-names>J. McAuley</given-names>
          </string-name>
          ,
          <article-title>Self-attentive sequential recommendation</article-title>
          ,
          <source>in: Proceedings of the 2018 IEEE International Conference on Data Mining (ICDM)</source>
          , IEEE,
          <year>2018</year>
          , pp.
          <fpage>197</fpage>
          -
          <lpage>206</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Liao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Nie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Hu</surname>
          </string-name>
          , T.-S. Chua,
          <article-title>Neural collaborative filtering</article-title>
          ,
          <source>in: Proceedings of the 26th International Conference on World Wide Web, International World Wide Web Conferences Steering Committee</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>173</fpage>
          -
          <lpage>182</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S.</given-names>
            <surname>Raza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <article-title>Deep Neural Network to Tradeof between Accuracy and Diversity in a News Recommender System</article-title>
          ,
          <source>in: 2021 IEEE International Conference on Big Data (Big Data)</source>
          , IEEE,
          <year>2021</year>
          , pp.
          <fpage>5246</fpage>
          -
          <lpage>5256</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S.</given-names>
            <surname>Caton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Haas</surname>
          </string-name>
          ,
          <article-title>Fairness in machine learning: A survey</article-title>
          , arXiv preprint arXiv:
          <year>2010</year>
          .
          <volume>04053</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>S.</given-names>
            <surname>Raza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Reji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ding</surname>
          </string-name>
          , Dbias:
          <article-title>Detecting biases and ensuring Fairness in news articles</article-title>
          ,
          <source>International Journal of Data Science and Analytics</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S.</given-names>
            <surname>Raza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <article-title>Fake news detection based on news content and social contexts: a</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>