<!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>mendations in SQUIRREL Movies</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Dimitris Plexousakis</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Eva Chrysostomaki</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maria Stratigi</string-name>
          <email>maria.stratigi@tuni.fi</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vasilis Efthymiou</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Overview</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          ,
          <addr-line>Kostas Stefanidis</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Bases (VLDBW'23) - TaDA'23: Tabular Data Analysis Workshop</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Crete</institution>
          ,
          <country country="GR">Greece</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Workshop Proce dings</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Group recommendations are becoming prominent, since there are several applications in which users form groups for activities (e.g., tourism, restaurants, movies). SQUIRREL is a framework for sequential group recommendations, i.e., it may be used by a group in several rounds, providing a diferent recommendation in each round. The goal is that, after some rounds, all group members will be fairly satisfied with the recommendations, even if, individually, some users may not be very satisfied in every round. In this paper, we present SQUIRREL Movies, an implementation of SQUIRREL in the movies domain.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Group recommendations have become popular, mainly
due to the efortless forming of groups in social media [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. satisfaction and users disagreement, i.e., the diference
beSequential group recommendations, in turn, provide sug- tween the most and the least satisfied group member.
gestions to groups for a series of recommendation rounds.
      </p>
      <p>
        A fair sequential group recommender should ofer good
results for the current round and also ensure the group
members’ satisfaction over a sequence of
recommendations, i.e., the recommender should observe that: ( ) the
recommended items should be as relevant as possible
to the group members at each round, and ( ) no group
member is dissatisfied after a sequence of rounds.
Standard group recommendation approaches fall short of
achieving both sequential group recommendation
objectives [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ]. Compared to those standard approaches,
specifically designed sequential group recommendation
approaches, which consider the previous
recommenda
      </p>
      <p>
        The SQUIRREL framework [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] ofers sequential group
tion systems, the goal is to maximize the group members’
satisfaction with the proposed data items, measured by
how relevant are the items in the group recommendation
list for each group member. In SQUIRREL, two
alternative reward functions are employed for RL: ( ) a simple
tourism. However, SQUIRREL is not an end-to-end
system; it runs once, for the last round only, with no user
interaction. In this paper, we present SQUIRREL Movies,
an implementation of SQUIRREL, applied in the movies
domain. SQUIRREL Movies ofers a graphical UI that
allows users to interact with the system and receive
recommendations for the current round, while providing
movie information from external sources.
SQUIRREL is generalizable to any domain that
consid© 2023 Copyright for this paper by its authors. Use permitted under Creative Commons License In this section, we provide an overview of SQUIRREL [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ],
      </p>
      <p>We apply SQUIRREL for a sequence of rounds to pro- the group the generated group recommendation list  

.</p>
      <sec id="sec-1-1">
        <title>2.1. SQUIRREL Overview</title>
        <p>Let  denote a set of movies,  a set of users, and  ⊆
 a group of users. For each user  ∈  ,   denotes
an ordered list of recommended movies that have been
generated by a single recommender system at a specific
recommendation round  for  . At round  , SQUIRREL
chooses an appropriate aggregation function based on
the current state of the group, to combine the individual
members’ recommendation lists   into one list 


.
as  ℛ = (
duce  group recommendation lists for a group  , defined
1 , 
2 , ...,</p>
        <p>). At each round, we
calculate each group member’s individual satisfaction score,
i.e., how relevant the items in the group list are for each
member, as well as the aggregated group satisfaction
score. Additionally, we calculate the disagreement
between the group members, i.e., the variance between
their satisfaction scores.</p>
        <p>SQUIRREL can be defined as a Markov decision
process (, A,  , )</p>
        <p>
          , aiming to maximize the accumulative
reward  after each recommendation round  , where:
• S describes the group state, expressed via the
satisfaction scores of the group members. We keep an individual
state for each group member  at each round  , defined
as  

= (, )
, where 
is the overall satisfaction
of user  at round  . Briefly, it describes how relevant
are the data items in the group recommendation list 
compared to the best case scenario for the user  , which


,
is their individual recommendations   .
• A is a set of distinct actions, i.e., diferent aggregation
functions employed by the SQUIRREL model. SQUIRREL
employs 6 aggregation functions (see [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]), ranging from
a simple average to a far more complex SDAA [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].
•   (,  ′
) =   (
+1 =  |
        </p>
        <p>′
to transition from state  to state 
 = ,   = ) is the probability
′ during round  , under

the action  .
•   (,  ′) is the reward gained from transitioning from
state  to state  ′. We define two reward functions. First,
we examine only the overall satisfaction of the group by
averaging the individual satisfaction of all group
members. Second, in addition to the overall satisfaction, we
also consider the disagreement between group member,
defined as the diference in the satisfaction scores
between the most and least satisfied group member.</p>
        <p>The goal of the model is to find a policy  (|)
that
takes action  ∈</p>
        <p>during state  ∈  to maximize the
expected discounted cumulative reward after  rounds:
(1)
where
with 0 ≤  ≤ 1 .</p>
        <p>[()],

=0
() =
∑    (,  ′),</p>
        <p>At the beginning of round  , the group is given to a
single-user recommender system that produces a
recommendation list   for each group member  . These lists
are then given to the SQUIRREL model, where the agent
observes the state of the environment   and selects an
appropriate action   to aggregate the lists   . This results
in the transitioning of the model to the next state  +1 ,
where we update the overall satisfaction of the users and
calculate the reward  +1 . Finally, SQUIRREL returns to</p>
      </sec>
      <sec id="sec-1-2">
        <title>2.2. SQUIRREL Movies Features</title>
        <p>In addition to the features described above and a Web UI,
we have added some new functionalities to SQUIRREL
Movies, such as recording the state of each group at each
recommendation round, retrieving external movie data
from MovieLens using MovieLens id, and providing
userfriendly visual and textual explanations regarding the
group recommendations. We cover only the latter next.</p>
        <p>
          Providing explanations. SQUIRREL Movies
provides both textual and visual (through graphs)
explanations of the recommendations returned both for each
round, as well as across rounds. For example, a user can
change the reward function and get a brief, intuitive
explanation of each aggregation function. In addition to
textual explanations, the user can be presented a line
chart with all the individual group members satisfaction
not only for the current round, but also for the
previous rounds. Further visual explanations include several
bar charts with diferent group fairness measures (e.g.,
MaxMin) [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], justifying the recommendations of
SQUIR
        </p>
        <sec id="sec-1-2-1">
          <title>REL Movies.</title>
          <p>
            Dataset and code. We have utilized the 20M
MovieLens Dataset [
            <xref ref-type="bibr" rid="ref5">5</xref>
            ], containing 20M ratings across 27,3K
movies given by 138,5K users between January 1995
and March 2015 in tabular format (&lt;user, item, rating,
timestamp&gt;), as processed in [
            <xref ref-type="bibr" rid="ref4">4</xref>
            ] to form diverse groups
of 5 users.
          </p>
          <p>The data are available on https://github.
com/mariaStratigi/SQUIRREL and the code of
SQUIRREL Movies is publicly available on https://github.com/</p>
        </sec>
        <sec id="sec-1-2-2">
          <title>Eva-Chris/SQUIRREL-Web-App.</title>
        </sec>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>3. Conclusion</title>
      <p>We have presented SQUIRREL Movies, demonstrating the
adaptation of the SQUIRREL sequential group
recommendations using reinforcement learning in the movies
domain. SQUIRREL Movies provides visual and textual
explanations, justifying its recommendations, and retrieves
movie data from external sources, to help users decide on
(2) the movie to watch next. SQUIRREL Movies is just one
of the many possible domain adaptations of SQUIRREL.</p>
      <p>Acknowledgement. This work has received funding
from the Hellenic Foundation for Research and
Innovation (HFRI) and the General Secretariat for Research and
Technology (GSRT), under grant agreement No 969.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>E.</given-names>
            <surname>Pitoura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stefanidis</surname>
          </string-name>
          , G. Koutrika,
          <article-title>Fairness in rankings and recommendations: an overview</article-title>
          ,
          <source>VLDB J</source>
          .
          <volume>31</volume>
          (
          <year>2022</year>
          )
          <fpage>431</fpage>
          -
          <lpage>458</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Stratigi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Nummenmaa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Pitoura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stefanidis</surname>
          </string-name>
          , Fair sequential group recommendations,
          <source>in: SAC</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>1443</fpage>
          -
          <lpage>1452</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Stratigi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Pitoura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Nummenmaa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stefanidis</surname>
          </string-name>
          ,
          <article-title>Sequential group recommendations based on satisfaction and disagreement scores</article-title>
          ,
          <source>J. Intell. Inf. Syst</source>
          .
          <volume>58</volume>
          (
          <year>2022</year>
          )
          <fpage>227</fpage>
          -
          <lpage>254</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Stratigi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Pitoura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stefanidis</surname>
          </string-name>
          ,
          <article-title>SQUIRREL: A framework for sequential group recommendations through reinforcement learning</article-title>
          ,
          <source>Inf. Syst</source>
          .
          <volume>112</volume>
          (
          <year>2023</year>
          )
          <fpage>102128</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <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 Trans. Interact. Intell. Syst</source>
          .
          <volume>5</volume>
          (
          <year>2016</year>
          )
          <volume>19</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>19</lpage>
          :
          <fpage>19</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>