<!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>Serendipity and Diversity Boosting for Personalized Streaming Media Recommendation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Gaetano Manzo</string-name>
          <email>gaetano.manzo@hevs.ch</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yvan Pannatier</string-name>
          <email>yvan.pannatier@hevs.ch</email>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gabriel Autès</string-name>
          <email>Gabriel.Autes@srgssr.ch</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michaël De Lucia</string-name>
          <email>Michael.Delucia@rts.ch</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jean-Gabriel Piguet</string-name>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jean-Paul Calbimonte</string-name>
          <email>jean-paul.calbimonte@hevs.ch</email>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National Institutes of Health (NIH)</institution>
          ,
          <addr-line>Bethesda, MD</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Radio Télévision Suisse RTS</institution>
          ,
          <addr-line>Genève</addr-line>
          ,
          <country country="CH">Switzerland</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>SRG SSR</institution>
          ,
          <addr-line>Genève</addr-line>
          ,
          <country country="CH">Switzerland</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>The Sense Innovation and Research Center</institution>
          ,
          <addr-line>Lausanne and Sion</addr-line>
          ,
          <country country="CH">Switzerland</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>University of Applied Sciences and Arts Western Switzerland HES-SO Valais-Wallis</institution>
          ,
          <addr-line>Sierre</addr-line>
          ,
          <country country="CH">Switzerland</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Streaming media platforms constitute a significant source of information and entertainment for diferent population segments. Although major corporations have taken the lead in market share, public media companies have also started to produce and broadcast films, series, and documentaries centered on locally-created content. Moreover, beyond the purely commercial goals of major corporations, these public streaming platforms have the mission of expanding the cultural landscape of the viewers, for instance, through the exploration of content produced in other regions and other languages, especially in multicultural societies such as Switzerland. In such a context, this paper proposes a novel approach for personalized recommendations of streaming media content, focusing on serendipity and multicultural diversity, while minimizing the need for personal data sharing. The approach is based on the feature extraction from user media consumption and a combination of data-driven recommendation algorithms. The approach has been tested with real data from the public PlaySuisse streaming platform.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Recommendation Systems</kwd>
        <kwd>Serendipity</kwd>
        <kwd>Multicultural Diversity</kwd>
        <kwd>Feature extraction</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In recent years, traditional and public media have faced new competition from streaming media
providers like Netflix, Disney+, and HBO. This has led to the creation of ideological bubbles, as
noted by Pariser et al.[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. These large corporations ofer content on demand for a subscription
fee and have significant influence over their viewers. To counter this, national public television
and broadcasting companies have introduced similar services with diferent content, distribution,
and impact visions. These public streaming services aim to provide spaces for open dialogue and
cultural exchange while ofering personalized content without limiting viewers to a standard
profile.
      </p>
      <p>This paper presents an innovative approach to personalize recommendations for streaming
media content with a focus on cultural diversity and serendipity. The proposed method
requires minimal explicit user profile information to preserve privacy, as most user data remains
undisclosed. The approach utilizes knowledge extraction techniques to estimate user
preferences based on viewing patterns. Additionally, it includes (i) knowledge inference methods to
determine user scores for viewed content and (ii) knowledge discovery techniques to classify
media consumption based on time and language preferences. The personalization efectiveness
is evaluated using a combination of content-based, collaborative filtering, and user clustering
methods. Results show that users within the same cluster have a high level of serendipity, which
means they are more likely to discover new content with a low risk of disliking it.</p>
      <p>The approach was developed and tested in collaboration with SRG SSR, a non-profit public
media company that provides audiovisual services for the Swiss federal government. The testing
and evaluation were carried out using real data from PlaySuisse, a streaming platform launched
in 20201.</p>
      <p>The rest of the paper is organized as follows. Section 2 presents the state-of-the-art of media
recommendations, particularly on serendipity and cultural diversity. Section 3 describes the
methodology and architecture of the system. Section 4 presents an evaluation of the approach
using data from the PlaySuisse platform. Finally, Section 6 concludes the paper.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Streaming media platforms have powerful recommendation algorithms that provide users
with highly relevant suggestions. The main goal of these recommendations was to increase
businesses’ profit by meeting customer needs [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Consequently, the focus is on maximizing
viewing time, avoiding switching to other content providers, and maintaining fidelity over
time. However, these algorithms also have the efect of locking the user into a filter bubble [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
Serendipity comprises diferent ways to reduce the efect of this bubble [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ]. When related
to recommendation systems, Kotkov et al. define serendipity as a property that reflects how
good a recommendation system is at suggesting serendipitous items that are relevant, novel,
and unexpected [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Novelty and unexpectedness require serendipitous items to be relatively
unpopular and significantly diferent from a user profile [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>
        However, research on this topic has gathered comparatively less attention in the community.
In their extensive review of the literature on recommendation systems between 2015 and 2020,
Alhijawi et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] explain that a recommendation system must try to fulfill five goals: relevance,
diversity, coverage, novelty, and serendipity. According to their study, only 2.3% of the articles
aimed to generate serendipitous recommendations. Among the principal works on this topic,
we can mention SIRUP, which combines both novelty and coping potential metrics to generate
recommendations for content-based filtering [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. In other domains such as health information
and news, computational serendipity models have been explored, formalizing the concepts of
surprise and curiosity [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Finally, authors in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] focused on the definition of user and content
1PlaySuisse platform: https://www.playsuisse.ch/.
elasticity, which can be quantified and used to build a relevance network for both surprising
and attractive recommendations.
      </p>
      <p>
        Contextual information, such as time, place, the company of other people, and other factors
afecting the viewing experience, is not always considered by recommendation algorithms [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
However, this information can be crucial. For instance, recommending a movie during the week
to a user that only watches series may have poor relevancy. Contextual information can be
applied at various stages of the recommendation process, including at the pre-filtering and
the post-filtering stages [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ]. As detailed in [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], contextual attributes can be observable
and unobservable. The latter introduces the additional challenge of discovering these features
through latent and indirect information.
      </p>
      <p>
        Recent recommendation systems use extensive user information. For instance, Sridhar et al.
collect information about users by scraping social media such as Facebook [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], while Ramzan
et al. perform sentiment analysis using user’s feedback to improve the recommendations [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
To a lesser extent, Subramaniyaswamy et al. retrieve user preference to rank their favorite
movies [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
      </p>
      <p>Beyond existing works, this paper proposes a recommendation approach that focuses on
cultural diversity as one of the main sources of serendipity, intending to enlarge the streaming
media ofer to users. At the same time, the approach considers context-aware parameters relative
to watching time-of-day and day-of-week to increase relevance. Finally, and as opposed to most
recommender systems in streaming media, this work considers almost no explicit demographic
and rating information. Instead, these data items are obtained through a knowledge extraction
process shown in the next section.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Methodology</title>
      <p>This section describes the methodology employed for our personalized recommendation
approach. We start by describing the dataset and the knowledge extracted. Then, we explore the
core of the architecture —the Recommendation Engine— and the algorithm within. Finally, we
discuss the metrics implemented to evaluate our system.</p>
      <sec id="sec-3-1">
        <title>3.1. Dataset</title>
        <p>The dataset is divided in two parts and corresponds to all data acquired during the platform’s
ifrst year (2021). The first part includes 1855 rows (assets) and 182 columns (features). It
contains information about the assets available on the platform, i.e. films, documentaries, and
series that users can watch through the PlaySuisse streaming service. In addition to the basic
asset information, such as name and the type of asset, we can find 25 columns corresponding to
asset categories and 124 columns to subcategories. The remaining features are the language of
the asset, platform information (e.g., publication date of the asset), and information such as the
duration of the content.</p>
        <p>The second part of the dataset includes more than 3.6 million rows and 12 columns. Each row
corresponds to an interaction between a user and an asset, i.e., diferent time intervals in which
a user watched a specific asset. Each column corresponds to a particular feature related to the
user-asset interaction. We find information such as the user identifier, the watched asset’s id,
and the percentage of content watched.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Data Cleaning and Knowledge Extraction</title>
        <p>The datasets from PlaySuisse do not provide personal information about the user, due to strict
privacy protection policies. In addition, given that the data was produced in early versions of
the platform, there are several inconsistencies in the dataset. Therefore our first goal was to
clean the datasets, and to identify and extract implicit information about the users to be able to
feed the recommendation algorithms.</p>
        <p>We started by discarding irrelevant features and data, i.e., user-asset interactions with no
user id; user-asset interactions with no asset id; user-assets with non-numeric asset id, etc.
because these missing features made impossible to establish the relation between the user and
the asset watched. One of the main issues that is present in both datasets is that some features
are expressed in diferent formats. For example, french language can be expressed as french,
French, fr, etc.. We decided to define one format for those features and standardize them. We
ifnally choose to restrict the number of features for our first experiments, from the initial 182
features. At this stage, we kept the information on languages, categories, and asset types. In
order to prevent any potential bias in the model’s output, we made the decision to remove the
subcategories due to their significant imbalance.</p>
        <p>We created new features to enhance context-aware recommendation, personalization, and
serendipity. The knowledge extraction of these features is crucial for the recommender engine
since the provided dataset misses those essential features due to privacy concerns. Since each
record in the user-asset interaction dataset has a timestamp, it is possible to extract two features:
the day and time-of-day (e.g., morning, evening) the asset was watched. The third feature
that was estimated is the rating that a user provides for the watched asset. This is essential
information to understand if the user liked or not the asset. The estimation is performed in two
steps. First, we calculate the percentage of the asset that has been watched by the user. We
can infer it because we know when the user started/finished watching the asset, and we also
have the duration of each asset. Once this information is obtained, a rank can be estimated by
assuming that a user who has completed an asset is more likely to have liked it.</p>
        <p>Finally, the last feature we engineered is an estimation of the principal language of the user.
This feature enables us to facilitate cross-cultural exchanges by recommending assets viewed
by users with a specific main language to users with another main language. To compute this
estimation, we assumed that if a user is watching an asset without subtitles, he has strong
knowledge of this language. On the other hand, if a user watches an asset with subtitles, he
most likely needs it to understand the asset, and therefore the main language will be the one
from the subtitle.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Recommendation Engine</title>
        <p>The goal of the Recommendation Engine is to provide personalized recommendations based
on the user-content interaction, the augmented features and the serendipity level. The engine
is built using a combination of three approaches: content-based filtering, collaborative-based
ifltering, and clustering-user-based. A dedicated module weights and evaluates the algorithms,
which fine-tune their parameters based on a feedback loop. Finally, the output is filtered to
adjust the recommendation load suggested to the users. Below, we provide a detailed description
of the algorithms, evaluation metrics, and filters adopted by the Feature Engineering.</p>
        <sec id="sec-3-3-1">
          <title>3.3.1. Algorithms</title>
          <p>We first formalize the recommendation problem in order to formulate the diferent
recommendation strategies. The fundamental concepts in this scope are content items (i.e., films, series,
etc.) and users. We define the -th content item as ∀ ∈ 1 ≤  ≤  and the -th user as
 ∀ ∈ 1 ≤  ≤  , with  and  the number of content items and users in the dataset,
respectively. For each content item  a set of features  is related, where  ∈ ((0), (1), .., ()),
with  the number of item’s features. Finally, we define the interaction of the -th user with
the -th content defined as .</p>
          <p>The Content-based filtering provides a list of content items based on the user-content
interactions and measures the distance between the features vector of watched contents and the rest.
The content items with the minimum distance are suggested to the user. In other words, given
the -th user,Content-based filtering is defined as:
arg min (, ˆ) ∀</p>
          <p≯∈  , ˆ ∈  ,  ∈ 
where  are the feature vectors of the content not watched by the -th user, ˆ are the
feature vectors of the content item watched by the -th user, and (, ˆ) is the distance
(e.g., euclidean) between the two sets of feature vectors.</p>
          <p>A user profile lists available categories with a score indicating the user’s preference for each.
By applying a dot product between each asset and the user profile, we generate a score for each
asset, which enables us to create a ranking and provide personalized suggestions. As these
suggestions are based on the user’s preferences, the risk of rejection is low. However, they may
lack serendipity. To overcome these limitations, the Collaborative-based filtering suggests the
rest of the content items not watched by one user to the other, and vice versa. Given the -th
and -th users, Collaborative-based filtering is defined as:
arg min (,  )

∀ ,  ∈ 
where  and  are the user-asset interactions of the -th and -th users.</p>
          <p>The third method used by the recommendation engine is the Clustering-user-based algorithm.
It starts by grouping users into clusters. Then it finds the closest clusters to the one of a particular
user. Finally, it recommends to the user content items that are liked by other users belonging
to the found cluster. Recommending items from a close cluster can increase the intercultural
exchange and still ensure that the user may like the content because the distance between the
two clusters is small. For each user, we define→−  = 0, 1, ...,  its profile representing the
weight accorded to the feature by the user. In other words, a feature appearing in most of the
assets a user likes has a higher weight than a feature appearing in assets that a user dislikes.
Given the -th and -th users, the Clustering-user-based algorithm is defined as:
arg min (,  )

∀ ,  ∈ 
where  and  are the user profile of the -th and -th users.</p>
          <p>We adopt K-Means, DBScan, and Gaussian mixture algorithms to estimate the users’cohorts.
In order to define the number of clusters needed for the K-Means algorithm, we used the Elbow
method coupled with Silhouette graph computation.</p>
        </sec>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Metrics and Filtering</title>
        <p>
          The two remaining elements of our recommendation engine are the Recommendation Evaluator
and Recommendation Filter. The first one evaluates the performance of the above-presented
algorithms via metrics such as Mean Absolute Error (MAE), Root Mean Squared Error (RMSE),
Diversity, Novelty, HitRate and Serendipity. Moreover we also computed the coverage and
catalog coverage [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. Finally, Recommendation Filtering selects the top suggestions among the
list of recommendations provided by the three algorithms to provide to the user.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Results</title>
      <p>This section presents the results of the recommendation systems we developed. We begin by
discussing our data exploration of the pre-processed dataset and the insights we gained from it.
We then present the results obtained using diferent content rating estimations. After that, we
illustrate the outputs of the Recommendation Engine. Finally, we compare the results using the
metrics we previously introduced.</p>
      <p>Table 1 presents five diferent scoring systems for our recommender engine. To evaluate
these systems, we computed user profiles on diferent levels of granularity, including users with
at least four views (the minimum), 10 views (the average number of views per user), 500 views
(the maximum), and all users.</p>
      <p>Table 2 shows the performance of our recommendation engine for the diferent scoring
systems described in Table 1. The evaluation is based on several user-asset granularity levels.
The table shows that the scoring system is a crucial component of our evaluation process that
directly impacts the model’s outcomes (i.e., user recommendations).</p>
      <p>The evaluation is based on the mean of MAE and RMSE values, which are commonly used
metrics to evaluate the accuracy of recommendation systems. The first three rows represent
the evaluation results for users with the minimum, average, and maximum number of views,
respectively. These values reflect the average deviation between the predicted ratings and the
actual rating made by each user for each item. The last row of the table shows the overall
evaluation results for all users in the dataset.</p>
      <p>Figure 2a is an example of the results we obtain from our recommendation engine when we
ifne-tune the evaluation towards a content-based approach. In a content-based approach, we
recommend items that are similar in content to what the user has previously engaged with. For
example, if a user has watched several action movies, we may recommend other action movies
that share similar themes, actors, or directors. The figure shows the top 10 results generated by
the recommendation engine using a content-based approach. These results are based on the
user’s previous engagement with assets and are sorted in descending order of their estimated
rating. The top results are those that have the highest likelihood of being preferred by the user.</p>
      <p>Figure 2b presents the top 10 results generated by our recommendation engine when the
evaluation is fine-tuned towards a collaborative-based approach. In a collaborative-based approach,
we recommend items based on the user’s similarity to other users who have engaged with similar
content. To generate these recommendations, we begin by calculating the correlation between
the assets that each user has engaged with. We then use this correlation to identify other users
who have engaged with similar content and calculate the correlation between these users and
the current user. The result is a set of recommendations based on the engagement patterns
of users with similar preferences. This approach is based on the hypothesis that users who
have engaged with similar content are likely to have similar preferences. By identifying these
patterns and leveraging them to generate recommendations, we can provide highly personalized
and relevant suggestions to our users.</p>
      <p>
        Figure 3 displays the results of applying the T-SNE algorithm to our dataset. Each data point
(a) content-based
(b) collaborative-based
in the plot represents a user, and the T-SNE algorithm determines its position. To enhance our
understanding of the user clusters, we color-coded each point based on the item categories
that the user engaged with. By using T-SNE to reduce the dimensionality of our data, we can
gain insights into the underlying structure of our user base. This information can be used to
develop more targeted marketing strategies, personalize user experiences, and improve the
performance of our recommendation engine. Table 3 illustrates the coverage and the catalog
coverage, which represents the percentage of items that the recommender system is able to
output and can efectively be recommended to a user, respectively [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>T-SNERepresentationofgermanusersbyassetcategories
60
40
20
0
20
40
60</p>
    </sec>
    <sec id="sec-5">
      <title>5. Discussion</title>
      <p>We developed a highly personalized recommendation system that is designed to enhance the
diversity and serendipity of cultural content recommendations. Our system employs three
algorithms that take into account users’ preferences and interests, and requires minimal user
information thanks to our cutting-edge feature engineering processes. Our recommendation
engine enables users to discover a wide range of cultural content tailored to their users’ profiles.</p>
      <p>Table 2 demonstrates the efectiveness of our user rate estimation system, with System 1
exhibiting the highest overall performance. However, upon closer examination, we found that
System 3 outperformed the other systems for users with a view count close to the average of
ten user-asset interactions. This suggests that while System 1 may be the best choice for users
with high levels of interaction, System 3 is better suited for users with more moderate levels of
engagement.</p>
      <p>Figure2a presents the results of fine-tuning the recommendation engine towards a
contentbased approach. We observed that, under this approach, the engine only recommends assets
that correspond to the categories liked by the user (e.g., comedy and drama), which may not be
optimal from a diversity and serendipity standpoint. Nonetheless, the novelty metric reveals
that the engine still recommends assets with a moderate level of popularity, with an average
rank of around 337. This suggests that while the engine may not provide the most diverse
range of recommendations, it still manages to balance the user’s preferences. In contrast, the
collaborative-based algorithm recommends assets from a much broader range of categories.
As a result, this approach has a significant potential to enhance the serendipity and diversity
of recommendations. However, the novelty metric for this approach is relatively low, with
a score of only 46, as demonstrated in Figure 2b. This suggests that while the
collaborativebased algorithm may provide a more diverse range of recommendations, it may struggle to
identify unique or novel content for users. Finally, by incorporating various filtering methods,
as demonstrated in Figure 3, we achieved an MSE of 0.1625 and RMSE of 0.4032. These metrics
indicate that our approach is highly efective at recommending assets from one cluster to
another, thereby introducing users to a more diverse and serendipitous range of cultural content.
As illustrated in Table 3, our engine was able to provide a wider range of engaging content to
users, with an impressive coverage rate across the dataset.</p>
      <p>While our personalized recommendation system has demonstrated promising results, its
generalizability to other datasets may be limited. To confirm the system’s broader applicability,
further experimentation on diverse datasets will be conducted. Additionally, the system’s
efectiveness could be further improved by incorporating user feedback, which can help to
ifne-tune recommendations and better match individual user preferences and interests. In future
work, we plan to incorporate user feedback to enhance the efectiveness and usability of the
recommendation engine.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion</title>
      <p>We presented a highly personalized recommendation system that is designed to enhance the
diversity and serendipity of cultural content recommendations. Our approach leverages three
diferent algorithms that consider users’ interests and requires minimal user information thanks
to our feature engineering techniques.</p>
      <p>Our system enables users to discover a wide range of cultural content that is tailored to their
unique tastes. Our results demonstrate the efectiveness of our approach. However, further
experimentation on diverse datasets is required to confirm the system’s broader applicability.
Moreover, the system’s efectiveness could be further improved by incorporating user feedback
to fine-tune recommendations and better match individual user preferences.</p>
      <sec id="sec-6-1">
        <title>Acknowledgements</title>
        <p>This research was funded by the IMI Initiative for Media Innovation grant: Personalized
Recommendation from Polarization to Discovery.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>E. Pariser,</surname>
          </string-name>
          <article-title>The filter bubble: What the Internet is hiding from you</article-title>
          ,
          <source>Penguin</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>B.</given-names>
            <surname>Alhijawi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Awajan</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. Fraihat,</surname>
          </string-name>
          <article-title>Survey on the objectives of recommender system: Measures, solutions, evaluation methodology, and new perspectives</article-title>
          ,
          <source>ACM Comput. Surv</source>
          . (
          <year>2022</year>
          ). doi:
          <volume>10</volume>
          .1145/3527449.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>R. J.</given-names>
            <surname>Ziarani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ravanmehr</surname>
          </string-name>
          ,
          <article-title>Serendipity in recommender systems: a systematic literature review</article-title>
          ,
          <source>J. of Computer Science and Technology</source>
          <volume>36</volume>
          (
          <year>2021</year>
          )
          <fpage>375</fpage>
          -
          <lpage>396</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Delgado-Battenfeld</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jannach</surname>
          </string-name>
          ,
          <article-title>Beyond accuracy: evaluating recommender systems by coverage and serendipity</article-title>
          ,
          <source>in: Proceedings of the fourth ACM conference on Recommender systems</source>
          ,
          <year>2010</year>
          , pp.
          <fpage>257</fpage>
          -
          <lpage>260</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>D.</given-names>
            <surname>Kotkov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Veijalainen</surname>
          </string-name>
          ,
          <article-title>A survey of serendipity in recommender systems</article-title>
          ,
          <source>Knowledge-Based Systems</source>
          <volume>111</volume>
          (
          <year>2016</year>
          )
          <fpage>180</fpage>
          -
          <lpage>192</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>M. De Gemmis</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Lops</surname>
            , G. Semeraro,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Musto</surname>
          </string-name>
          ,
          <article-title>An investigation on the serendipity problem in recommender systems</article-title>
          ,
          <source>Information Processing &amp; Management</source>
          <volume>51</volume>
          (
          <year>2015</year>
          )
          <fpage>695</fpage>
          -
          <lpage>717</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>V.</given-names>
            <surname>Maccatrozzo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Terstall</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Aroyo</surname>
          </string-name>
          , G. Schreiber,
          <article-title>Sirup: Serendipity in recommendations via user perceptions</article-title>
          ,
          <source>in: Proceedings of the 22nd International Conference on Intelligent User Interfaces</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>35</fpage>
          -
          <lpage>44</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>X.</given-names>
            <surname>Niu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Abbas</surname>
          </string-name>
          ,
          <article-title>A framework for computational serendipity</article-title>
          ,
          <source>in: Proc. of 25th Conference on User Modeling, Adaptation and Personalization</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>360</fpage>
          -
          <lpage>363</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          <article-title>Wang, Haes: A new hybrid approach for movie recommendation with elastic serendipity</article-title>
          ,
          <source>in: Proc. of the 28th ACM Intl. Conference on Information and Knowledge Management</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>1503</fpage>
          -
          <lpage>1512</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>M. M. Rahman</surname>
          </string-name>
          ,
          <article-title>Contextual recommendation system</article-title>
          ,
          <source>in: 2013 International Conference on Informatics, Electronics and Vision (ICIEV)</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>H.</given-names>
            <surname>Ito</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Yoshikawa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Furuhashi</surname>
          </string-name>
          ,
          <article-title>A study on improvement of serendipity in item-based collaborative filtering using association rule</article-title>
          ,
          <source>in: 2014 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)</source>
          , IEEE,
          <year>2014</year>
          , pp.
          <fpage>977</fpage>
          -
          <lpage>981</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kulkarni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. F.</given-names>
            <surname>Rodd</surname>
          </string-name>
          ,
          <article-title>Context aware recommendation systems: A review of the state of the art techniques</article-title>
          ,
          <source>Computer Science Review</source>
          <volume>37</volume>
          (
          <year>2020</year>
          )
          <fpage>100255</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S.</given-names>
            <surname>Sekar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dhanasekaran</surname>
          </string-name>
          , G. Charlyn,
          <string-name>
            <given-names>C.</given-names>
            <surname>Latha</surname>
          </string-name>
          ,
          <article-title>Content-based movie recommendation system using mbo with dbn</article-title>
          ,
          <source>Intelligent Automation and Soft Computing</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>B.</given-names>
            <surname>Ramzan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. S.</given-names>
            <surname>Bajwa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Jamil</surname>
          </string-name>
          , R. U. Amin,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ramzan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Mirza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Sarwar</surname>
          </string-name>
          ,
          <article-title>An intelligent data analysis for recommendation systems using machine learning</article-title>
          ,
          <source>Scientific Programming</source>
          <year>2019</year>
          (
          <year>2019</year>
          )
          <article-title>5941096</article-title>
          . URL: https://doi.org/10.1155/
          <year>2019</year>
          /5941096. doi:
          <volume>10</volume>
          .1155/
          <year>2019</year>
          /5941096.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>S. V</surname>
          </string-name>
          , L. R.,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chandrashekhar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Challa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Varadarajan</surname>
          </string-name>
          ,
          <article-title>A personalised movie recommendation system based on collaborative filtering</article-title>
          ,
          <source>International Journal of High Performance Computing and Networking</source>
          <volume>10</volume>
          (
          <year>2017</year>
          )
          <article-title>54</article-title>
          . doi:
          <volume>10</volume>
          .1504/IJHPCN.
          <year>2017</year>
          .
          <volume>083199</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Delgado-Battenfeld</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jannach</surname>
          </string-name>
          ,
          <article-title>Beyond accuracy: Evaluating recommender systems by coverage and serendipity</article-title>
          ,
          <source>in: Proceedings of the Fourth ACM Conference on Recommender Systems</source>
          , RecSys '10,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2010</year>
          , p.
          <fpage>257</fpage>
          -
          <lpage>260</lpage>
          . URL: https://doi.org/10.1145/1864708.1864761. doi:
          <volume>10</volume>
          .1145/ 1864708.1864761.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>