<!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>Exploring Choice Overload in Related-Article Recommendations in Digital Libraries</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Felix Beierle</string-name>
          <email>beierle@tu-berlin.de</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Akiko Aizawa</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Joeran Beel</string-name>
          <email>beelg@nii.ac.jp</email>
          <email>joeran.beel@adaptcentre.ie</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National Institute of Informatics (NII) Digital Content and Media Sciences Research Division Tokyo</institution>
          ,
          <country country="JP">Japan</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Service-centric Networking Technische Universitat Berlin / Telekom Innovation Laboratories Berlin</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Trinity College Dublin School of Computer Science and Statistics Intelligent Systems Discipline, Knowledge and Data Engineering Group ADAPT Centre Dublin</institution>
          ,
          <country country="IE">Ireland</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <fpage>51</fpage>
      <lpage>61</lpage>
      <abstract>
        <p>We investigate the problem of choice overload { the di culty of making a decision when faced with many options { when displaying related-article recommendations in digital libraries. So far, research regarding to how many items should be displayed has mostly been done in the elds of media recommendations and search engines. We analyze the number of recommendations in current digital libraries. When browsing fullscreen with a laptop or desktop PC, all display a xed number of recommendations. 72% display three, four, or ve recommendations, none display more than ten. We provide results from an empirical evaluation conducted with GESIS ' digital library Sowiport, with recommendations delivered by recommendations-as-a-service provider Mr. DLib. We use click-through rate as a measure of recommendation e ectiveness based on 3.4 million delivered recommendations. Our results show lower click-through rates for higher numbers of recommendations and twice as many clicked recommendations when displaying ten instead of one related-articles. Our results indicate that users might quickly feel overloaded by choice.</p>
      </abstract>
      <kwd-group>
        <kwd>recommendation</kwd>
        <kwd>recommender system</kwd>
        <kwd>recommendations as a service</kwd>
        <kwd>digital library</kwd>
        <kwd>choice overload</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        More and more information is available online for academic researchers in
digital libraries [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. One way to deal with the ood of information is to utilize
recommender systems that lter information and recommend articles related to
those ones a user liked previously or is currently reading. A major challenge in
recommending a list of related articles is to decide how many related articles
to recommend before a user becomes dissatis ed with the recommender system
due to choice overload.
      </p>
      <p>
        Developing Mr. DLib (Machine-readable Digital Library)4 [
        <xref ref-type="bibr" rid="ref4 ref6">6, 4</xref>
        ], a
recommendations-as-a-service (RaaS) provider, we currently deliver
recommendations to the digital library Sowiport5[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Soon, we will also deliver
recommendations to JabRef6[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Developing such a recommender system for digital
libraries, currently, there are no information to be found about how many
recommendations to deliver and display. Figure 1 shows an example of using Mr.
DLib in Sowiport. While a recommender system can lter for the most relevant
content for the user, the displayed recommended items can still be
overwhelming. Schwartz describes the issue as the "tyranny of choice" [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]: Confronted
with too many options, participants in studies tend to not decide for any option.
4 http://mr-dlib.org
5 http://sowiport.gesis.org
6 http://www.jabref.org
In this paper, we investigate the in uence of the size of the recommendation set
on choice overload in digital libraries. In order to do so, we:
1. Examine how many items other recommender systems in digital libraries
recommend
2. Conduct an empirical evaluation to see how di erent numbers of
recommendations a ect the clicks on related-article recommendations7
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        There have been several studies investigating choice overload with respect to
consumer goods (for example [
        <xref ref-type="bibr" rid="ref1 ref10">1, 10</xref>
        ]). Based on the MovieLens dataset, Bollen
et al. investigated the relationship between item set variety, item set
attractiveness, choice di culty, and choice satisfaction [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. They suggest to diversify
the recommendation set by including some lower quality recommended items
in order to increase perceived recommendation variety and choice satisfaction.
In another study, Willemsen et al. further analyzed the relationship of
diversication, choice di culty, and satisfaction [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Here, the authors also used the
MovieLens dataset.
      </p>
      <p>
        Other related studies looked into the number of search results to be
displayed. Jones et al. conclude that the screen size is a determining factor with
respect to how many search result items users interact with [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], which is
conrmed in a newer study by Kim et al. [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Linden reports that although Google
users claimed to want more search results, tra c dropped with the display of
an increased number of search results [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Google suspected the extra loading
time to be play a role in this. Azzopardi and Zuccon developed a cost model for
browsing search results, taking into account screen size and search results page
size [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. They concluded that displaying 10 results is close to the minimum cost.
Kelly and Azzopardi studied the e ects of displaying di erent sizes of search
result pages [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. In their study, they used three, six, and ten search results.
One of their main ndings is that subjects of the study who were shown ten
search results per page viewed and saved signi cantly more documents, while
more time is spent on earlier search results, if the number of results per page
is less. While Chiravirakul and Payne's study suggests that choice
dissatisfaction happens when there is a lack of time for choosing links [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], the study by
Oulasvirta et al. suggests that it is the search result page size that is causing
choice overload or the "paradox of choice." Oulasvirta et al. conducted a user
study with 24 participants and looked into the user's satisfaction with the results
when displaying six or 24 results. For future work, they suggest also looking into
objective behavior measurements like click-through rates.
      </p>
      <p>
        In our work, we focus on a di erent domain. We will investigate the problem
of choice overload in digital libraries { in contrast to movie recommendations
7 All data relating to this paper is available on http://datasets.mr-dlib.org,
including a table of the delivered and clicked recommendations, the information about
the investigated digital libraries, and the gures presented in this paper.
and search results. The question of how many recommendations to display and
choice overload has not been studied in the domain of digital libraries, to the best
of our knowledge. In a recent literature survey on more than 200 articles about
research paper recommender systems, no one discussed or researched this topic
[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Furthermore, instead of user interviews or small scale studies, we investigate
the real clicks logged in an actively used system. We will explore, to what extend
click-through rates (CTR) re ect the ndings of the cited studies.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Methodology</title>
      <p>In order to investigate choice overload in digital libraries, we rst examine how
many items other recommender systems in digital libraries display. We
investigated 63 digital libraries8 and reference managers with search interfaces9. We
considered recommendations that are being displayed when an item from the
search results is selected. In a few cases, the number of displayed
recommendations of related items was dependent on the size of the browser window. For the
numbers given in the following, we assumed a full screen browser window on a
laptop computer (13" display with 1280x800 resolution).</p>
      <p>In a second step, we conducted an experimental evaluation to investigate how
di erent numbers of recommendations a ect the click rates on related-article
recommendations. Click-through rates are a good way to study the users' actual
behavior when displaying recommended items in real situations. We analyze
data from 3.4 million recommendations. The data was obtained from users of the
academic search engine Sowiport10, which is run by GESIS - Leibniz-Institute for
the Social Sciences 11, which is the largest infrastructure institution for the Social
Sciences in Germany. Sowiport contains about 9.6 million literature references
and 50,000 research projects from 18 di erent databases, mostly relating to
the social and political sciences. Literature references usually cover keywords,
classi cations, author(s), and journal or conference information, and if available:
citations, references, and links to full texts.</p>
      <p>
        Sowiport co-operates with Mr. DLib, an open Web Service to provide
scholarly literature-recommendations-as-a-service (Figure 2). This means that all
computations relating to the recommendations run on Mr. DLibs servers, while
the presentation takes place on Sowiports website. Our recommender system
shows related-article recommendations on each articles detail page in Sowiport
(see Figure 1). Whenever such a detail page is requested by a user, the
recommender system randomly chooses one of four recommendation approaches
to generate recommendations: 1. stereotype recommendations, 2. most
popular recommendations, 3. content-based ltering (CBF), and 4. random
recommendations. We measured the e ectiveness of the recommendation approaches
8 Most of them listed on https://en.wikipedia.org/wiki/List_of_digital_
library_projects
9 See http://datasets.mr-dlib.org for detailed results.
10 Some explanations about Sowiport and Mr. DLib are from [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
11 http://www.gesis.org
with click-through rate (CTR). CTR describes the ratio of delivered to clicked
recommendations. For instance, when 1,000 recommendations were delivered,
and 8.4 of these recommendations were clicked, the average CTR would be
8.4/1,000=0.84%. The assumption is that the higher the CTR, the more e
ective is the recommendation approach. There is some discussion to what extend
CTR is appropriate for measuring recommendation e ectiveness, but overall it
has been demonstrated to be a meaningful and well-suited metric [
        <xref ref-type="bibr" rid="ref13 ref20 ref7">13, 7, 20</xref>
        ]. For
our evaluation, we randomly displayed one to fteen recommendations.
      </p>
      <p>Our expectation is that at rst, by increasing the number of displayed
recommendations, there will be an increase in the CTR. By displaying more and
more recommendations, we expect to reach a maximum in CTR at some point.
After that, when displaying more recommendations, we expect the CTR to drop,
indicating choice overload. Similarly, for the clicks, we would expect to nd a
maximum at a certain number of displayed recommendations. Plotting the CTR
and the average clicks we show this expectation in Figure 3. Here, the CTR, the
orange line, increases with the number of displayed recommendations, reaches
a maximum at four, and decreases afterwards, indicating choice overload. The
clicks, the gray line, reach a maximum at ve displayed recommendations. In
that case, we would decide for four (maximum CTR) or ve (maximum clicks)
recommendations.</p>
      <p>Alternatively, we would have expected results as in Figure 4. Here, the CTR
declines with increasing number of displayed recommendations. The absolute
clicks have a maximum at four. The question then would be: What is better { a
higher CTR or the maximum of absolute clicks? Depending on the answer, we
would choose a recommendation set size of between one and four. As we will show
in the following section, the results are quite di erent from our expectations.
1.00%
0.90%
0.80% 0.60%
0.70% 0.50%
0.60%
TR0.50%
C0.40%
0.30%
0.20%
0.10% 5
0.00%
1</p>
    </sec>
    <sec id="sec-4">
      <title>Results</title>
      <p>Number of Recommendations in Existing Digital Libraries
19 (30%) of the 63 digital libraries displayed recommendations for related items.
Figure 5 shows the distribution of recommendations for those 19 libraries. Most
libraries (72% of those that display recommendations) display three, four, or
ve recommendations, none is displaying more than 10 or less than three. It is
also notable that they all always show a xed number of related-articles, one
could also imagine displaying varying numbers. Looking for related items in
the database, there can be varying scores of relevance. One way of displaying a
varying amount of related-article recommendations would be to take into account
such relevance scores, e.g., giving 10 recommendations if there are 10 highly
28%</p>
      <p>28%
16%
4%</p>
      <p>4%
1
2</p>
      <p>3 4 5 6 7 8
Number of Related-Article Recommenations
8%
9
12%
10
relevant related-articles, and giving only two recommendations, if there are only
two related-articles that have a relevance score above a certain threshold.</p>
      <p>We do not know how the numbers of related articles in the reviewed
recommender systems were chosen by the operators. We assume that they either just
arbitrarily chose the numbers, or did some experiments but did not publish the
results. In the following, by measuring CTRs, we want to investigate and
measure the e ect the number of displayed recommendations has and if the CTR
indicates choice overload for certain numbers of displayed recommendations.
4.2</p>
      <p>Experiment with Varying Number of Recommendations
The solid orange line in Figure 6 shows the CTR by the number of displayed
recommendations. The higher the number of recommendations, the lower the
overall CTR is. The dashed line shows the average absolute number of clicked
recommendations (per 1,000 recommendations). The bigger the recommendation
set size is, the higher the number of absolute clicks is.</p>
      <p>When only one recommendation was displayed, the CTR was 0.84% on
average. This means, when our recommender system delivered 1,000 times one
recommendation each, 8.4 recommendations were clicked. For two displayed
recommendations, the CTR was only 0.49% on average. This means, when our
recommender system delivered 1,000 times two recommendations each (2,000 in
total), 9.8 recommendations were clicked (half clicked on the rst one, half on
the second one). Overall, if one or two recommendations are displayed, does not
make a big di erence in the absolute number of clicks, it only increases by 17%
(8.4 to 9.8). When fteen recommendations were shown, the CTR was at the
minimum of 0.14% on average, while the absolute number of clicks was at the
maximum of 21.4.</p>
      <p>Comparing these results with our expectations given in Section 3, we can
see that the CTR unexpectetly decreases rapidly and has a clear maximum at
0.90%
0.80%
0.70%
one displayed recommendation. Furthermore, contrary to our expectations, the
absolute clicks keep increasing instead of having a maximum value at a few
recommendations. The results show an under-proportional increase in average
clicks on the displayed recommendations. Displaying twice as many
recommendations does not double the clicks. In order for the absolute number of clicked
recommendations (per 1,000) to double from 8.4 (for one displayed
recommendation) to 17, the number of displayed related-articles has to be raised to 10 or
11. When 15 recommendations are displayed, only 2.5 as many recommendations
are clicked compared to displaying a single recommendation. Regarding choice
overload this implies that having more recommendations to choose from does,
in general, only create a small incentive for the user to click on more of the
displayed recommended items. There are some points to consider when interpreting
these results. Many documents in Sowiport only have sparse information, thus
they might not be interesting for the users. Another possible option why the
experimental results are so unclear about the number of recommendations to
give is that the relevance of the recommendations might have been too low, so
that many users did not click further recommendations after clicking the rst
one. In that case, the research should be repeated when we are able to deliver
better recommendations. The session-length is another aspect to consider. For
instance, if one user visits two pages and on gets 15 recommendations on each
page, we assume the CTR will be higher than for a user who looks at 10 pages
and gets 15 recommendations on each page. An additional aspect of sessions is
that so far, we did not lter for recommendations that have already been shown
to a user. So, if a user looks at 15 detail pages and gets 10 related-article
recommendations on each, most likely there will be duplicate recommendations, and
hence the CTR decreases the more recommendations are shown. Another aspect
to consider in the results' interpretation is how users might use Sowiport. If the
user clicks on a recommendation, a new tab is opened. If the recommendation
was good, she might forget about the other open tab { especially if there are
further good recommendations shown in the new tab.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion and Future Work</title>
      <p>The average clicks on displayed recommendations under-proportionally increase
with the number of displayed items. In order for the clicks to double, the size of
the recommendation set has to be increased from one to 10 or 11. These numbers
might imply that the users quickly feel overloaded by choice. The results di er
from our expectations. Just based on these numbers, we could conclude that
we should only display one recommendation because the CTR is highest { or
to keep displaying even more than 15 recommendations until the number of
absolute clicks does not increase anymore. Further research will be necessary to
determine a good number of recommended items to display.</p>
      <p>Our results are based on Sowiport. Further research is necessary to con rm
if our ndings also apply to other digital libraries. We therefore plan to repeat
our research, for instance, with JabRef and the library of the Technical
University of Munich. Future work could also include using other evaluation methods
and metrics than CTR (e.g., a user study, or user ratings, or tracking which
recommended item were actually exported or saved) or making a survey and
asking the operators of the other digital libraries how they decided the number
of displayed recommendations. Furthermore, a question to be discussed is what
recommender systems in digital libraries should try to achieve, e.g., maximizing
CTR, maximizing the number of clicked recommendations, etc.</p>
      <p>Acknowledgments. This work has received funding from project DYNAMIC12
(grant No 01IS12056), which is funded as part of the Software Campus
initiative by the German Federal Ministry of Education and Research (BMBF). This
work was also supported by a fellowship within the FITweltweit programme
of the German Academic Exchange Service (DAAD). This publication also has
emanated from research conducted with the nancial support of Science
Foundation Ireland (SFI) under Grant Number 13/RC/2106. We are further grateful
for the support provided by Sophie Siebert.
12 http://www.dynamic-project.de</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Arunachalam</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Henneberry</surname>
            ,
            <given-names>S.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lusk</surname>
            ,
            <given-names>J.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Norwood</surname>
            ,
            <given-names>F.B.</given-names>
          </string-name>
          :
          <article-title>An Empirical Investigation into the Excessive-Choice E ect</article-title>
          .
          <source>American Journal of Agricultural Economics</source>
          <volume>91</volume>
          (
          <issue>3</issue>
          ),
          <volume>810</volume>
          {825 (Aug
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Azzopardi</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zuccon</surname>
          </string-name>
          , G.:
          <article-title>Two Scrolls or One Click: A Cost Model for Browsing Search Results</article-title>
          . In: Advances in Information Retrieval. pp.
          <volume>696</volume>
          {
          <fpage>702</fpage>
          . Springer, Cham (Mar
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Beel</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dinesh</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mayr</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carevic</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raghvendra</surname>
          </string-name>
          , J.:
          <article-title>Stereotype and MostPopular Recommendations in the Digital Library Sowiport</article-title>
          .
          <source>In: Proceedings of the 15th International Symposium of Information Science (ISI)</source>
          . pp.
          <volume>96</volume>
          {
          <fpage>108</fpage>
          . Verlag Werner Hulsbusch, Gluckstadt,
          <string-name>
            <surname>Germany</surname>
          </string-name>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Beel</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gipp</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aizawa</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Mr. DLib: Recommendations-as-a-Service (RaaS) for Academia (Pre-print)</article-title>
          .
          <source>In: Proceedings of the ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL)</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Beel</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gipp</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Langer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Breitinger</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Research paper recommender systems: A literature survey</article-title>
          .
          <source>International Journal on Digital</source>
          Libraries pp.
          <volume>1</volume>
          {
          <issue>34</issue>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Beel</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gipp</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Langer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Genzmehr</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wilde</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          , Nurnberger, A.,
          <string-name>
            <surname>Pitman</surname>
          </string-name>
          , J.: Introducing Mr.
          <article-title>DLib, a Machine-readable Digital Library</article-title>
          .
          <source>In: Proceedings of the 11th ACM/IEEE Joint Conference on Digital Libraries (JCDL`11)</source>
          . pp.
          <volume>463</volume>
          {
          <fpage>464</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2011</year>
          ), available at http://docear.org
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Beel</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Langer</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>A Comparison of O ine Evaluations, Online Evaluations, and User Studies in the Context of Research-Paper Recommender Systems</article-title>
          .
          <source>In: Research and Advanced Technology for Digital Libraries</source>
          . pp.
          <volume>153</volume>
          {
          <fpage>168</fpage>
          . Springer, Cham (Sep
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Bollen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Knijnenburg</surname>
            ,
            <given-names>B.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Willemsen</surname>
            ,
            <given-names>M.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Graus</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Understanding Choice Overload in Recommender Systems</article-title>
          .
          <source>In: Proceedings of the Fourth ACM Conference on Recommender Systems</source>
          . pp.
          <volume>63</volume>
          {
          <fpage>70</fpage>
          . RecSys '10,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Chiravirakul</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Payne</surname>
            ,
            <given-names>S.J.</given-names>
          </string-name>
          :
          <source>Choice Overload in Search Engine Use? In: Proceedings of the 32nd Annual ACM Conference on Human Factors in Computing Systems</source>
          . pp.
          <volume>1285</volume>
          {
          <fpage>1294</fpage>
          . CHI '14,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Fasolo</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McClelland</surname>
            ,
            <given-names>G.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Todd</surname>
            ,
            <given-names>P.M.</given-names>
          </string-name>
          :
          <article-title>Escaping the tyranny of choice: When fewer attributes make choice easier</article-title>
          .
          <source>Marketing Theory</source>
          <volume>7</volume>
          (
          <issue>1</issue>
          ),
          <volume>13</volume>
          {26 (Mar
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Feyer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Siebert</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gipp</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aizawa</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Beel</surname>
          </string-name>
          , J.:
          <article-title>Integration of the Scienti c Recommender System Mr</article-title>
          .
          <article-title>DLib into the Reference Manager JabRef</article-title>
          .
          <source>In: Proceedings of the 39th European Conference on Information Retrieval (ECIR)</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Hienert</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sawitzki</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mayr</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : Digital Library Research in Action: Supporting Information Retrieval in Sowiport. D-Lib Magazine
          <volume>21</volume>
          (
          <issue>3</issue>
          /4) (
          <year>Mar 2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Joachims</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Granka</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pan</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hembrooke</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gay</surname>
          </string-name>
          , G.:
          <article-title>Accurately Interpreting Clickthrough Data As Implicit Feedback</article-title>
          .
          <source>In: Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          . pp.
          <volume>154</volume>
          {
          <fpage>161</fpage>
          . SIGIR '05,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Jones</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marsden</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mohd-Nasir</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boone</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buchanan</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Improving Web interaction on small displays</article-title>
          .
          <source>Computer Networks</source>
          <volume>31</volume>
          (
          <issue>11</issue>
          {16),
          <volume>1129</volume>
          {1137 (May
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Kelly</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Azzopardi</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>How Many Results Per Page? A Study of SERP Size, Search Behavior and User Experience</article-title>
          .
          <source>In: Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          . pp.
          <volume>183</volume>
          {
          <fpage>192</fpage>
          . SIGIR '15,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Kim</surname>
            , J., Thomas,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sankaranarayana</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gedeon</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yoon</surname>
            ,
            <given-names>H.J.</given-names>
          </string-name>
          :
          <article-title>Eye-Tracking Analysis of User Behavior and Performance in Web Search on Large and Small Screens</article-title>
          .
          <source>Journal of the Association for Information Science and Technology</source>
          <volume>66</volume>
          (
          <issue>3</issue>
          ),
          <volume>526</volume>
          {544 (Mar
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Linden</surname>
          </string-name>
          , G.:
          <article-title>Marissa Mayer at Web 2.0</article-title>
          . http://glinden.blogspot.com/
          <year>2006</year>
          /11/ marissa-mayer
          <string-name>
            <surname>-</surname>
          </string-name>
          at-web-
          <volume>20</volume>
          .html (
          <year>Nov 2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Noorden</surname>
            ,
            <given-names>R.V.</given-names>
          </string-name>
          :
          <article-title>Global scienti c output doubles every nine years</article-title>
          .
          <source>Nature Blog</source>
          , http://blogs.nature.com/news/2014/05/ global-scientific
          <article-title>-output-doubles-every-nine-years</article-title>
          .
          <source>html</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Schwartz</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>The tyranny of choice</article-title>
          .
          <source>Scienti c American</source>
          <volume>290</volume>
          (
          <issue>4</issue>
          ),
          <volume>70</volume>
          {
          <fpage>75</fpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Schwarzer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schubotz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meuschke</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Breitinger</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Markl</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gipp</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Evaluating Link-based Recommendations for Wikipedia</article-title>
          .
          <source>In: 2016 IEEE/ACM Joint Conference on Digital Libraries (JCDL)</source>
          . pp.
          <volume>191</volume>
          {
          <issue>200</issue>
          (Jun
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Willemsen</surname>
            ,
            <given-names>M.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Graus</surname>
            ,
            <given-names>M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Knijnenburg</surname>
            ,
            <given-names>B.P.</given-names>
          </string-name>
          :
          <article-title>Understanding the role of latent feature diversi cation on choice di culty and satisfaction</article-title>
          .
          <source>User Modeling and UserAdapted Interaction</source>
          <volume>26</volume>
          (
          <issue>4</issue>
          ),
          <volume>347</volume>
          {389 (Oct
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>