<!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>Voting Based Group Recommendation: How Users Vote</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Michal Kompan</string-name>
          <email>name.surname@stuba.sk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mária Bieliková</string-name>
          <email>name.surname@stuba.sk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Slovak University of Technology, Inst. of Informatics and Software Engineering</institution>
          ,
          <addr-line>Ilkovicˇova 2, 842 16 Bratislava</addr-line>
          ,
          <country country="SK">Slovakia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>It has been shown that social information as group structure or personality characteristics improve the group recommendation. Sometimes no such information is available, speci cally when ad-hoc groups are constructed. Moreover, often the items' content is not available (or users' preferences are unknown). In this paper we explore the usage of voting based group recommendation and the users preference for such a method settings { we analyze aggregation strategies preferences, sharing preferences and users re-rating consistency.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Group recommendations</kwd>
        <kwd>voting</kwd>
        <kwd>aggregation strategies</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        Group recommendation gets more and more attention in
today's adaptive web-based applications [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Users' social
activity over the Web is increasing and thus new domains
and applications as movie, learning or games are available.
When recommending to the group of users the social
structure and personal characteristics plays important role from
the group satisfaction point of view [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. On the contrary,
sometimes there is not possible to obtain these
characteristics. When the group is constructed ad hoc { from \random"
users it is almost impossible to collect information about the
group structure or users characteristics (usually obtained by
various questionnaires) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>One of the best performing approaches for the group
recommendation, which is suitable for active groups is the
recommendation based on voting of group members. Group
members suggest their preferred items and then the voting
is performed by the group. It is clear that the voting
process, especially when performed online and when the goal is
to reach consensus, can be in uenced and enhanced by
various aspects (e.g., sharing preferences, aggregation strategies,
group size, users' consistency). In order to investigate the
in uence of these speci c aspects we propose a voting
mechanism in the domain of movies.</p>
    </sec>
    <sec id="sec-2">
      <title>2. VOTING BASED RECOMMENDATION</title>
      <p>Proposed approach consist of the construction of user's
ratings matrix, which is created based on users' votes (Items x
Votes). Every user can vote for the items already voted by
other users, or the new item can be added as the suggestion
to the group. Next, the matrix of normalized ratings is
constructed (Min-max normalization) in order to minimize low
or hight ratings in uence to aggregation strategy. Finally,
the total of three representative aggregation strategies
(additive, multiplicative and additive with minimal satisfaction)
are used in order to construct the group recommendation,
which is presented to users:
1. Create user's rating matrix and the normalized rating
matrix respectively.
2. Aggregate votes from group members (users rating
matrix).</p>
      <p>3. Recommend items with highest votes.</p>
      <p>Not only the lack of users' preferences knowledge or su
cient group activity indicate to use the voting based group
recommendation. Often there is no information about the
recommended content available (e.g., movie genre, director),
which are used for the standard similarity search. In the
voting based approach, this information is processed by the
users, thus no content analysis or the lack of new items is
required or present.</p>
    </sec>
    <sec id="sec-3">
      <title>2.1 Evaluation and Results</title>
      <p>Proposed approach was implemented as a simple web-based
application MovieRec and available for the free usage within
the social network Facebook during the experiment. We
expected that { users' ratings are more consistent as when
no sharing preferences are presented. We also believe that
users' ratings are in uenced by the group context { users'
re-ratings (rating previously rated item in new event and
group) are in uenced by the group and event context. The
total of 73 real users within 10 days voted for 902 movies
(obtained from IMDB database), which were self-divided into
the 11 groups and 93 voting events.</p>
      <p>The task presented to the users was to create or to join
some event and try to reach consensus (based on the
voting) on which items should be watched together within the
group. For every created event the users voted for their
candidates to watch. They could create new suggestions
until the event deadline. During the experiment we were
observing the users' behavior based on the sharing preferences
(in the half of events the preferences of other group
members were visible), users' consistency and the performance of
used aggregation strategy. After the event deadline, three
lists of the generated recommendations were presented to
every user of the group (additive, multiplicative and the
additive with minimal satisfaction consideration strategy).
Every user rated for the best recommendation of these three
presented lists.</p>
      <p>Results { aggregation strategies. Our rst question was
which strategy is preferred based on the group size. When
comparing the winning strategy depending on the group size
we discovered that larger groups (more single-users'
preferences have to be aggregated) prefer additive strategy, while
the decreasing trend can be observed when multiplicative
strategy is used (Figure 1). Finally, the additive strategy
with least misery performed the worst. This can be
explained by the fact that least misery prefers votes from the
minority, thus when only one user dislikes an item, this
item will not be recommended. With the group size and
users' satisfaction, the number of such users is increasing,
thus the quality of recommendation is decreasing. Similarly,
when the multiplicative strategy is used, low ratings of few
users can in uence whole recommendation dramatically,
obtained results supports this hypothesis { the additive
strategy within large groups balances the in uence of deviating
individuals and the rest of members.</p>
      <p>Results { sharing preferences. Next, we focused on
inuence of sharing preferences. Users' events were divided
into the two sets { users who saw preferences of their
colleagues, and second set, where no sharing preferences were
displayed. We discovered that the sharing preferences do not
have (or have very small) in uence on the user's ratings. The
standard deviation of these two groups di ers only 0.0212.
Thus, we see that the users in our experiments considered
the preference of others minimally, or were very consistent
in their similar opinions and thus sharing preferences were
redundant.</p>
      <p>In general, the winner, in the most of events is the
additive strategy, followed by the multiplicative and the additive
with minimal satisfaction strategy. This is quite surprising
result, while the minimal satisfaction seems to be not so
desirable (from the majority points of view), especially when
a large group is interacting. Obtained results clearly show
that when a large group is requesting for the
recommendation, the minimal satisfaction from the group point of view
decreases the quality of recommendation. This is supported
by the standard deviation of obtained votes for particular
strategies (Table 1). From the average score point of view,
the additive strategy with least misery outperforms the
multiplicative, thus the preference diversity was probably small
within the group members.</p>
      <p>Results { users' consistency. Finally, we investigated
users' consistency over the various voting and events. We
focused on movies rated by the user in some event and
his/her rating for the same movie in other events. In
order to minimize users' e ort, if the movie was rated by the
user before, we presented this rating as default value (and
the user was able to adjust this rating). The total of 462
such \re-ratings" were given by the users, while only in 71
occurrences the users changed the value of previous rating.
This is an interesting result, which can be partially caused
by the pre- lled ratings. On the other hand, the proportion
of users which were consistent (85%) indicates that users
adjust their ratings to the actual group context minimally
(which is supported by the social psychologist as the
tendency to act consistent in various situations.</p>
    </sec>
    <sec id="sec-4">
      <title>3. CONCLUSIONS</title>
      <p>When there is no additional information about the group
available, the voting strategy seems to be the optimal
solution. Here, the recommendation task is moved to the group
members directly. As we shown the additive and
multiplicative strategy are more preferred by small groups, while on
the other side for larger groups the additive strategy is
preferred. Proposed voting approach revealed that the sharing
preferences have no or minimal in uence to the group
members in adjusting their preferences.</p>
    </sec>
    <sec id="sec-5">
      <title>4. ACKNOWLEDGMENTS</title>
      <p>The authors wish to thank Jan Trebul'a for helping with
implementation of MovieRec. This work was partially
supported by the grants No. VG1/0675/11 and APVV-0208-10.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Kompan</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Bielikova</surname>
          </string-name>
          . Group Recommendation:
          <article-title>Survey and Perspectives</article-title>
          .
          <source>In Computing and Informatics</source>
          ,
          <volume>33</volume>
          (
          <issue>2</issue>
          ):
          <volume>446</volume>
          {
          <fpage>476</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Gartrell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Xing</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Lv</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Beach</surname>
          </string-name>
          , R. Han,
          <string-name>
            <surname>S</surname>
          </string-name>
          . Mishra, and
          <string-name>
            <given-names>K.</given-names>
            <surname>Seada</surname>
          </string-name>
          .
          <article-title>Enhancing group recommendation by incorporating social relationship interactions</article-title>
          .
          <source>In Proc. of the 16th ACM Int. Conf. on Supporting Group Work</source>
          , pages
          <volume>97</volume>
          {
          <fpage>106</fpage>
          . ACM,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Mastho</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Gatt</surname>
          </string-name>
          .
          <article-title>In pursuit of satisfaction and the prevention of embarrassment: A ective state in group recommender systems</article-title>
          .
          <source>UMUAI</source>
          ,
          <volume>16</volume>
          (
          <issue>3-4</issue>
          ):
          <volume>281</volume>
          {
          <fpage>319</fpage>
          ,
          <string-name>
            <surname>Sept</surname>
          </string-name>
          .
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>