<!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>The Demographics of Cool</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Michael D. Ekstrand</string-name>
          <email>michaelekstrand@boisestate.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maria Soledad Pera People</string-name>
          <email>solepera@boisestate.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Information Research Team</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dept. of Computer Science, Boise State University</institution>
          ,
          <addr-line>Boise, Idaho</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <abstract>
        <p>Typical recommender evaluations treat users as an homogeneous unit. However, user subgroups often difer in their tastes, which can result more broadly in diverse recommender needs. Thus, these groups may have diferent degrees of satisfaction with the provided recommendations. We explore the ofline top- N performance of collaborative filtering algorithms across two domains. We find that several strategies achieve higher accuracy for dominant demographic groups, thus increasing the overall performance for the strategy, without providing increased benefits for other users.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>CCS CONCEPTS</title>
      <p>• Information systems → Recommender systems;</p>
    </sec>
    <sec id="sec-2">
      <title>INTRODUCTION</title>
      <p>
        Recommender system evaluation—ofline and online —typically
focuses on the system’s efectiveness, in aggregate over the entire user
population. While individual user characteristics are sometimes
taken into account, as in demographic-informed recommendation,
evaluations typically still aggregate over all users [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In this work,
we connect recent work leveraging user demographics to deepen
understanding of diferent users’ satisfaction with search engines
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], with the work of Bellogin et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] measuring recommenders’
performance for diferent items to examine recommender system
accuracy for users in diferent demographic groups in an ofline
setting. This attention is necessary because, by default, the largest
subgroup of users will dominate overall statistics; if other subgroups
have diferent needs, their satisfaction will carry less weight in the
ifnal analysis. This can result in an incomplete picture of the
performance of the system and and obscure the need to identify how
to better serve specific demographic groups. To the well-known
problems of popularity bias [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and misclassified decoys [
        <xref ref-type="bibr" rid="ref3 ref5">3, 5</xref>
        ] (a
good item recommendation counted as a error given that the user
has yet to interact with the item in available data), we add a third
consideration: demographic bias, where the satisfaction
(approximated in ofline settings by top- N accuracy) of some demographic
groups is weighted more heavily than others. Demographic bias
also has a complex expected interaction with popularity bias: the
most active and numerous users will have a greater impact on
popularity than other users, so popularity bias in evaluation will further
encourage the selection of algorithms that perform well on the
largest subgroup’s tastes.
      </p>
      <p>Our central research question is this: what changes about our
assessment of relative or absolute recommender efectiveness when
we consider performance for diferent subgroups of users– basically
when we consider all subgroups’ satisfaction to be equally
important? Does popularity bias exacerbate demographic bias efects?
How do popularity bias mitigations afect the demographic bias?
2</p>
    </sec>
    <sec id="sec-3">
      <title>INITIAL ANALYSIS</title>
      <p>
        We answer these questions with an ofline analysis using LensKit [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]
1 and two datasets that provide user demographics of some form.
MovieLens-1M2 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] contains 1M 5-star ratings of 3,900 movies by
6,040 users who joined MovieLens through 2000. Each user has
selfreported age, gender, occupation, and zip code. LastFM contains data
of 359,347 users who played 294,015 unique artists. The main record
set consists of 17,559,530 tuples of the form ⟨user , artist , playCount ⟩.
For most users, gender, age, country, and sign-up date are
provided. We employed several classical and widely-used collaborative
ifltering algorithms: (1) Popular (Pop), recommending the most
frequently rated or played items; (2) Item-Item (II), an item-based
collaborative filter using 20 neighbors and cosine similarity; (3)
User-User (UU), a user-based collaborative filter configured to use
30 neighbors and cosine similarity; and (4) FunkSVD (MF), which is
based on gradient descent matrix factorization technique with 40
latent features and 150 training iterations per feature. Each
algorithm is tagged with its variant: ‘-E’ are explicit-feedback
recommenders (applicable only to MovieLens); ‘-B’ are implicit-feedback
recommenders that only consider whether an item was rated or
played, disregarding its rating value or play count; ‘-C’ are
implicitfeedback recommenders that consider the number of times an artist
was played as repeated implicit feedback (LastFM only). We applied
5-fold cross-validation, using two methods: (1) LensKit’s default
strategy and (2) Bellogin’s UAR method [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] for neutralizing
popularity bias; this works like the default, except it picks test sets of items
instead of users. An initial experiment revealed that regardless of
the metric, i.e., Recall, Mean Reciprocal Rank (MRR), and Mean
Average Precision, the algorithms exhibit similar behavior, thus we
report our results using MRR.
      </p>
      <p>Demographic distribution and its impact on evaluation.
Figure 1 shows user gender distribution; with the majority of users
reporting as male. The age distribution reveals some diferences:
the largest block of MovieLens users belong to the [25-35] group,
whereas a plurality of LastFM users belong to the [18-24] group.3
1Code and scripts are available at https://doi.org/10.18122/B2ND8P
2Later MovieLens dataset do not include demographic information.
3For consistency, we binned LastFM users into the same groups used in MovieLens-1M.</p>
      <p>Gender
0.3
0.2
0.1
R0.0
R
M
0.3
0.2
0.1
0.0
DataSet</p>
      <p>LastFM</p>
      <p>ML−1M
sLaF
t
M
M
L
−
1
M
Standard Results. Figure 2 shows the MRR achieved by each
algorithm, grouped by demographic group. For each demographic
characteristic, All is the accuracy achieved by averaging across
all users, and Bucketed is the result of first averaging within each
demographic group, and then averaging the groups’ results (thus
giving each group equal weight, instead of each user). The results
across subgroups are broadly similar for both data sets, though the
All analysis tracks most closely with the dominant group.
However, if a decision is to be made based on “performs best", then the
small diferences become non-trivial, as they will afect the final
decisions. One example case emerges from our analysis: on LastFM,
II performs better using play counts (“-C”) for some age groups,
while the “-B” variant is more efective for other age groups.</p>
      <p>While we cannot conclude, based on this ongoing study, which is
the right decision, our preliminary analysis demonstrates the need
for further exploration from a demographic perspective.</p>
      <p>Al Bucketed F M NA</p>
      <p>
        Popularity Bias Mitigating Results. We also seek to
understand how demographic bias interacts with mitigation techniques
for other issues, such as popularity bias. To that end, we performed
a version of our analysis using Bellogin’s UAR technique [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. We
see (in Figure 3) that several of the smaller user groups have
substantially higher accuracy measures than larger groups, particularly
on age. An analysis using this method would find that the
recommender is delivering better recommendations to these groups.
      </p>
      <p>
        The diferences obtained using UAR or traditional evaluations
show that mitigating popularity bias comes with the cost of
significantly changing the distribution of measured accuracy across user
subgroups. (Analysis using 1R [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] did not produce results
significantly diferent from Figure 2.) Which evaluation strategy better
reflects actual user experience is still up for debate.
      </p>
    </sec>
    <sec id="sec-4">
      <title>3 DISCUSSION AND FUTURE WORK</title>
      <p>Our analysis showed that, unsurprisingly, a number of
recommendation strategies achieve moderately higher accuracy metric values
for dominant demographic groups. This can cause an algorithm’s
performance to increase without delivering benefit to smaller
subgroups of the user population. In other words, the perceived
satisfaction with a recommender may not be the same for the “cool”
users—in the dominant group—as it is for those in smaller groups.</p>
      <p>Demographic bias in accuracy metric results also has a complex
interaction with mitigation strategies for other ofline evaluation
ailments such as popularity bias. A uniform item strategy results in
disproportionately higher accuracy values for users in some smaller
subgroups. Further work is needed to understand which paradigm
maps most closely to actual user experience or response.</p>
      <p>Our findings highlight the need for careful and multi-faceted
consideration of recommender system behavior across a range of
both users and items. As prior work has found that recommenders
are not equally good at recommending for all items, we find that
recommenders are not equally good for all users in predictable
and socially-relevant ways. While the full social and business
ramifications of our findings have yet to be explored, we encourage
researchers and practitioners to pay attention to which users receive
how much benefit from a particular recommender.</p>
    </sec>
    <sec id="sec-5">
      <title>ACKNOWLEDGMENTS</title>
      <p>We thank Ion Madrazo for helping with analysis, and the People
and Information Research Team (PIReT) for their support.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bellogin</surname>
          </string-name>
          .
          <article-title>Performance prediction and evaluation in Recommender Systems: an Information Retrieval perspective</article-title>
          .
          <source>PhD thesis</source>
          , UAM,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bellogin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Castells</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and I.</given-names>
            <surname>Cantador</surname>
          </string-name>
          .
          <article-title>Precision-oriented evaluation of recommender systems: an algorithmic comparison</article-title>
          .
          <source>In Proc. ACM RecSys '11</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>P.</given-names>
            <surname>Cremonesi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Koren</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Turrin</surname>
          </string-name>
          .
          <article-title>Performance of recommender algorithms on top-n recommendation tasks</article-title>
          .
          <source>In ACM RecSys</source>
          , pages
          <fpage>39</fpage>
          -
          <lpage>46</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M. D.</given-names>
            <surname>Ekstrand</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ludwig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Konstan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Riedl</surname>
          </string-name>
          .
          <article-title>Rethinking the recommender research ecosystem: reproducibility, openness, and lenskit</article-title>
          .
          <source>In Proc. ACM RecSys '11</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M. D.</given-names>
            <surname>Ekstrand</surname>
          </string-name>
          and
          <string-name>
            <given-names>V.</given-names>
            <surname>Mahant</surname>
          </string-name>
          .
          <article-title>Sturgeon and the cool kids: Problems with Top-N recommender evaluation</article-title>
          .
          <source>In Proc. FLAIRS 30</source>
          . AAAI Press, 22 May
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Harper</surname>
          </string-name>
          and
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Konstan</surname>
          </string-name>
          .
          <article-title>The movielens datasets: History and context</article-title>
          .
          <source>Trans. Interact</source>
          . Intel. Sys.,
          <volume>5</volume>
          (
          <issue>4</issue>
          ):
          <fpage>19</fpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>R.</given-names>
            <surname>Mehrotra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Anderson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Diaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wallach</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Yilmaz</surname>
          </string-name>
          .
          <article-title>Auditing search engines for diferential satisfaction across demographics</article-title>
          .
          <source>In Proc. WWW '17 Companion</source>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>G.</given-names>
            <surname>Shani</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Gunawardana</surname>
          </string-name>
          .
          <article-title>Evaluating recommendation systems</article-title>
          .
          <source>In Recommender systems handbook</source>
          , pages
          <fpage>257</fpage>
          -
          <lpage>297</lpage>
          . Springer,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>