<!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>BIBLME RecSys: Harnessing Bibliometric Measures for a Scholarly Paper Recommender System</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Anas Ollagnier</string-name>
          <email>anais.ollagnier@univ-amu.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sebastien Fournier</string-name>
          <email>sebastien.fournier@univ-amu.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Patrice Bellot</string-name>
          <email>patrice.bellot@univ-amu.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Aix Marseille Univ, Toulon University</institution>
          ,
          <addr-line>CNRS, LIS, Marseille</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>34</fpage>
      <lpage>45</lpage>
      <abstract>
        <p>The iterative continuum of scienti c production generates a need for ltering and speci c crossing of ideas and papers. In this paper, we present BIBLME RecSys software which is dedicated to the analysis of bibliographical references extracted from scienti c collections of papers. Our goal is to provide users with paper suggestions guided by the papers they are reading and by the references they contain. To do so, we propose a new approach based on a new bibliometric measure. We propose to determine the impact, the inner representativeness, of each bibliographical reference according to their occurrences in the paper the user is reading. By means of this approach, we suggest central references of the author's paper. As a result, we obtain papers that are related to the paper selected by the user according to the in uence of references on it. We evaluate the recommendation in the context of a digital library dedicated to humanities and social sciences.</p>
      </abstract>
      <kwd-group>
        <kwd>Recommender systems</kwd>
        <kwd>Text mining</kwd>
        <kwd>Digital libraries</kwd>
        <kwd>Bibliographic information</kwd>
        <kwd>Bibliometrics</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        There are 114 million of scholarly papers archived on the Web [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. While
certainly advantageous, researchers have unprecedented level of access which creates
a problem of \information overload" [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. To help generate relevant suggestions
for researchers, scholarly paper recommenders emerged over the last decade to
ease nding publications. In this research eld, content-based ltering (CBF)
algorithms are the predominant approaches [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. In most CBF systems dedicated
to textual applications (e.g., scholarly papers), item descriptions are represented
by textual features such as plain words, phrases, or n-grams. However, these
systems encounter di culties caused by complications that originate from natural
language ambiguity. In the context of digital libraries, references are a major
source of links. Indeed, bibliographical references are an important part of the
academic writing and allow to convey various information relating to the author's
research elds. In this paper, we propose a scholarly paper recommender system
which suggests related papers to the user's paper is reading. To do that, we were
interested in textual features through the identi cation of references extracted
from the body of the text and the footnotes. By this way unlike traditional CBF
approaches in which items are recommend to users by determining their
similarities (inherent characteristics) with other items, we propose to determine an
active user's interests from the content analysis of the article selected.
      </p>
      <p>
        Leveraging information extracted from bibliographical reference analysis and
from quantitative measurements, we propose a centrality indicator which
allows to evaluating bibliographical references' importance of the user's paper is
reading. Based on the ndings that certain textual features, such as citation
frequency and citation location might allow to predict references' importance [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ],
we construct this indicator from factors which use information on the authors'
citation behavior. By means of this approach, citations are used in the same way
as words were used in CBF algorithm in order to weighted each reference
according to its level of centrality. By this way, our centrality indicator can re ect
the strength of references' in uence and so potential relevant readings.
Reference analysis is integrated in the BILBO1 [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] system, the software we have been
developing for some years in the context of OpenEdition that is a large digital
library dedicated to Humanities and Social Sciences (HSS).
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        In the context of digital librairies and publishers' portals, recommender system
have been introduced in order to provide relevant related literature. In 1998,
Giles et al. introduced the rst scholarly recommender system as part of the
CiteSeer project [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Since several methods have been proposed and at least
216 papers relating to scholarly paper recommendation approaches were
published [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Two types of algorithms are typically used in recommender systems:
collaborative ltering (CF) and content-based ltering (CBF). CF algorithms
recommend items to users based on the ratings of other users (with similar
interest). In CBF algorithms, the user's interest is inferred from the items that the
user interacted with. Items' representation consist in a content model in which
features are typically word-based.
      </p>
      <p>
        Several digital libraries have deployed recommender systems such as
TechLens+ [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], BibTip [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] and CiteUlike [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Each system uses di erent kind of data:
TechLens+ uses citation data and usage data, BibTip rests upon the observation
of user patterns and the statistical evaluation of the usage data, and CiteULike
is based on users' bookmark items. These systems are essentially based on CBF
algorithms. Most of the proposed approaches operate either by clustering similar
items or by pro ling users' behaviour (user-based collaborative ltering) or by
combining the two (hybrid recommenders) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. In recent works, Asabere et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
introduced a folksonomy-based paper recommendation algorithm which
recommends papers issued by active participants, to other Group Pro le Participants
at the same conference based on preference similarity of their research interests.
1 https://github.com/OpenEdition/bilbo
Philip et al. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] proposed a CBF approach based on TF-IDF weighing scheme
and cosine similarity measure.
      </p>
      <p>
        Currently, it is not possible to identify the most e ective recommendation
approaches [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. So according to our dataset, we have oriented our work on a
CBF approach. The majority of these approaches are based on plain terms
extracted from papers, n-grams or topics based on LDA. Certain researches have
used non-textual features such as writing style, layout information, and XML
tags. Concerning the use of citations, [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] have proposed the CC-IDF method
in which citations are used in the same way as words-based features were used
and weighted the citations with the standard TF-IDF measure. Inspired by this
work, we propose a system in which the user's interests are inferred from
citations extracted from the current paper that the user interact with in order to
provide related papers.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Proposed Method</title>
      <p>
        Our method starts with our former bibliographical references detection system
dedicated to scholarly papers [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] which is integrated in the BILBO system.
Based on this software the names of the authors, the titles, the year of publication
and some meaningful elements of information are extracted from both the full
texts and the reference sections. From bibliographical references annotated and
extracted by our system, we build our scholarly recommender system entitled
BIBLME RecSys. It consists of four steps:
Step 1: Retrieve references both in the body of the text (ref ) and in the reference
section (Pref );
Step 2: Check matches between each ref corresponding to the same paper Pref ;
Step 3: Compute for each Pref a centrality indicator derived from the evaluation
criteria based on objective quantitative measurements;
Step 4: Rank each Pref according to its centrality indicator and recommend papers
with the high scores.
      </p>
      <p>As we show in Fig. 1, each candidate paper to recommend (Prefi ) is
represented by a centrality indicator (cIndic(Prefi )) which corresponds to
quantitative measures used in Step 3. This indicator allows to highlight papers which are
mainly employed by the authors in their paper. In this approach, a key
innovative step is to model a paper of interest from factors based on authors' citation
behaviours. The rst factor corresponding to the f reqF actor(refi; Prefi )
function computes references refi which occur in the given paper. The second factor
corresponding to the granuF actor(refi; refj ) function calculates for each Prefi
how corresponding references in the text are used by the author in his paper.
This factor has two levels of granularity ( ne granularity/coarse granularity)
which we detail in Section 3.2. From these factors, we determine central papers
of the author's paper. By this way, we leverage the bibliographical references in
order to shape a user's interests.</p>
      <p>In Step 1, sets of references extracted both from the body of the text and
from the reference section are constructed. Then in Step 2, we manage with these
sets in order to determine which references correspond to the same paper from
matching functions (matchF unc(refi; refj )). These functions based on a strict
matching and a fuzzy matching allow to compare two bibliographical references
extracted from the body of the text or from the reference section. Then for each
reference whose matching functions are ful lled, quantitative measures based on
the frequency factor of usage and the granularity factors are computed. Lastly,
candidate papers to recommend are ranked according to their centrality indicator
which represents a linear combination of the quantitative measures. With this
system, users can set the value assigned to each factor. According to the score
assigned to each factor, users can obtain informations about author's citation
behaviours. For example, if the coarse granularity factor is set at a high value,
references which occur throughout the paper will be highlighted.
3.1</p>
      <p>Matching Functions
The purpose of the matching functions (matchF unc(refi; refj ) in Fig. 1) is to
gather the references corresponding to a given paper. These functions allow to
compute the frequency factor and the granularity factors presented in section 3.2.
Two functions are necessary: a strict matching function and a fuzzy matching
function. The strict matching function checks whether there is an exact
matching between the content of the bibliographic elds found in a string and the
content of the same elds found in an another reference, even if the elds are
not the same. The fuzzy matching function allows to estimate the matching
degree between references whose content of the bibliographic elds is substantially
di erent. Consider R as a set of references such as refi and refj 2 R.</p>
      <p>De nition 1. (The strict matching function) This function checks whether
bibliographic elds of the refi reference (i 2 [1::n]) and the refj reference
(j 2 [1::m]) match. refi is tokenized in (wki) and refj is tokenized in (wkj),
with k = min(len(refi); len(refj )).</p>
      <p>matchingstrict(refi; refj ) =
(1 if [w1i w2i::wki] = [w1j w2j::wkj]</p>
      <p>0</p>
      <p>De nition 2. (The fuzzy matching function) sim( ; ) corresponds to
the Levenshtein distance. refers to the vector (w1i..wki) of tokens in refi and
corresponds to the vector (w1j..wj ) of tokens extracted from refj , with k =
k
min(len(refi); len(refj )). ! speci es a similarity threshold.</p>
      <p>matchingsimilarity(refi; refj ) =
(1 if sim( ; ) &gt; !
0
(1)
(2)
3.2</p>
      <p>BIBLME RecSys Factors
BIBLME RecSys factors are based on the observations related to the
construction of scienti c discourse and especially authors' citation behaviours. They are
computed using quantitative measures such as the frequency and the distribution
granularity of each reference in the body of the text.</p>
      <p>The Frequency Factor is computed from the number of references
corresponding to the same paper even if their structures are di erent. The hypothesis
emitted from this factor is: the impact of the reference will be considered more
important if it is cited several times in the paper. Algorithm 1 describes the
processing chain used to compute the frequency factor.</p>
      <p>
        Consider R as the set of references refj (j 2 [1::m]) extracted from the body
of the text and R0 as the set of references P refi (i 2 [1::n]) extracted from the
the reference section. We only perform these matches because we consider the
reference section as a list in which occurs each reference extracted from the text.
The biblM eF actors array stores the results in order to compute the centrality
indicator. In this case, its size is equal to the size of R0. Each biblM eF actors
index corresponds to the position index of references P refi from R0. Then,
for each reference in the body of the text refj from R, matching functions
matchingstrict(P refi; refj ) and matchingsimilarity(P refi; refj ) are applied with
references from R0. If the conditions are veri ed, biblM eF actors[i] is incremented
according to the parameter value assigned to .
Algorithm 1 Computing the frequency factor
1: for i of 0 to (length of biblM eF actors) do
2: biblM eF actors[i] 0
3: end for
4: for i of 0 to (length of R0) do
5: for j of 0 to (length of R) do
6: if matchingstrict(refj; P refi) = 1 or matchingsimilarity(refj; P refi) = 1 then
7: biblM eF actors[i] biblM eF actors[i] +
8: end if
9: end for
10: end for
The Granularity Factors are computed by taking into account di erent levels
of distribution granularity, namely, the ne granularity and the coarse
granularity. The purpose of these factors is to distinguish how the references are used
by the authors in their paper. To do that, an additional score is computed for
each references extracted from the reference section if corresponding references
in the body of the text ful ll distribution conditions. Based on the ndings that
references' importance increase proportionally with numbers of mentions and
more detailed discussion of the cited document [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], we propose to construct the
granularity factors according to the following assumptions:
{ more citations of a reference occur throughout the paper more the author is
in uenced by this work;
{ on the contrary, the concentration of citations within low textual density
areas tends to strengthen author's arguments on speci c aspects of his
researches.
      </p>
      <p>The ne granularity is computed from references in the body of the text
referring to the same paper in the same paragraph and the number of words
between each one of these references. Then, a score is assigned if the number of
words between these references is less than the average of the distances between
the references corresponding to the same paper. The ne granularity function is
as follows:</p>
      <p>Granularityfine(refi; refj ) =
(1 if aj
0
bi &lt; AvgRef
(3)</p>
      <p>Where refi and refj are references extracted from an ordered subset referring
to the same document d in the same paragraph P . aj is the refj start position
in the paragraph P and bi is the refi end position in the paragraph P . AvgRef
is the average of all the averages of distances in words between references within
a document d in a paragraph P .</p>
      <p>The coarse granularity is measured from references in the body of the text
corresponding to the same paper throughout a given paper. To do that, we count
the number of paragraphs which separate each of these references. Then, a score
is assigned if the number of paragraphs between these references is less than
the average of distances. The coarse granularity function can be calculated as
follows:</p>
      <p>Granularitycoarse(refi; refj ) =
(1 if index(Q)
0
index(P ) &lt; AvgR0ef
(4)</p>
      <p>Where index() is a function which gives the index of a given paragraph. P
and Q two paragraphs and refi and refj are references extracted from an
ordered subset referring to the same document d. AvgR0ef is the average of all the
averages of distances between paragraphs that separate two references to the
same document d.</p>
      <p>Algorithm 2 describes the processing chain used to compute the granularity
factors.</p>
      <p>Algorithm 2 Computing the granularity factors</p>
      <p>For each couple (refi; refj ) of references from the set R, we apply matching
functions matchingstrict(refi; refj ) and matchingsimilarity(refi; refj ). If
conditions are ful lled, the measurement of granularity factors granularityfine(refi; refj )
and granularitycoarse(refi; refj ) is performed. For each granularity function if
their respective average of distances are veri ed, biblM eF actors[i] is incremented
according to the parameter value assigned to or .
4</p>
    </sec>
    <sec id="sec-4">
      <title>Context of the Experiments</title>
      <p>To evaluate BIBLME RecSys, we compare the candidate papers proposed by
the OpenEdition's search engine which is designed to search for documents on
OpenEdition portal. In the literature, we were unable to nd open
recommendation systems based on bibliometric measurements with which to compare to
BIBLME RecSys's suggestions. So, we used the OpenEdition search engine called
Search OpenEdition which is based on Apache Lucene retrieval model.
Candidate papers are extracted, for a given query, by a Boolean lter which identify
papers containing the requested terms. Then, papers are ranked according to
BM25 similarity. As for standard search engines, Search OpenEdition allows
different querying modes which apply facets or lters. As part of our work, Search
OpenEdition was queried without specifying search elds related to document
characteristics and Boolean operators. However, the advanced search mode was
used with the application of a lter which only query OpenEdition Journals
platform2 in order to deal with the same data that BIBLME RecSys uses.
Concerning the queries submitted they are written with the name of the rst author
and the full title of given papers which correspond to the main elds available
in the references extracted from the text.</p>
      <p>The candidate papers to recommend is constructed from 12 papers3 extracted
from various elds in HSS such as languages, anthropology, ethnology,
communication, law and culture, health, economy and development, education,
agriculture, and the environment. In order to estimate the impact of this approach
and to avoid the possibility of bias product by the BILBO software, we
manually annotated citations and references of these papers. In order to allow an
evaluation of the candidate papers extracted from BIBLME RecSys and Search
OpenEdition, a platform4 has been developed.</p>
      <p>From this platform, users have access to the list of papers with their abstracts.
For each paper two lists of ve recommended papers are proposed for both
systems. Only rst ve recommended papers were displayed for each system in
order to avoid an evaluation too tedious. Users can choose the list containing the
more relevant recommended papers and re ne their evaluation by giving a rating
from 0 to 5 (0 means that the recommended paper is o topic and 5 means that
the recommended paper is in agreement with the topic of the current paper).
The majority of the recommended papers have a clickable link to obtain the
original version of the paper or an abstract. A "Suggestion" eld is available in
order to allow users to express an opinion or remarks on suggestions.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Experimental Results</title>
      <p>From the platform presented previously, an analysis on the basis of the user
feedback is performed. Through this study, we show the relevance of
recommended papers according to the system selected by the users. The results have
been recorded after one month. The OpenEdition employees were the main
participants in this evaluation. These participants come from varying cultural and
2 http://journals.openedition.org/
3 Due to the task complexity for the participants, we only have selected a little sample
of papers.
4 http://grapheval.openeditionlab.org/
disciplinary backgrounds such as software engineering, sales and partnerships,
nance, legal and public policy, marketing and communications, user services.
Over this time frame, we counted 31 participants with an average of 2.3 items
assessed per person.</p>
      <p>Concerning the prede ned settings for BIBLME RecSys, each centrality
indicator is computed from the frequency factor and the granularity factors. The
same parameter value is applied for each factor in order to obtain the sum of the
coe cients equal to 1. Table 1 shows the obtained results for each proposed
paper. The values correspond to the number of users which selected the suggestions
provided by BIBLME RecSys or Search OpenEdition.
Angevin - The Magdalenian lithic industry from
the openair site of la Corne-de-Rollay (Couleuvre,
Allier): production standards andproduction lines
variability
7
8
5
6
4
2
3
4
1
1
2
2
5
0
0
0
4
1
0
0
5
0
2
0</p>
      <p>Result analyses. Users have selected 45 times BIBLME RecSys 's
suggestions as the most relevant while Search OpenEdition's suggestions have been
selected 17 times. However, performances vary depending on the papers. Users
have selected BIBLME RecSys 's suggestions as the most e ective for 8 proposed
papers while the others obtain almost similar performances. The user feedback
provided with the "Suggestion" eld shows that the systems propose relevant
suggestions. The main di erence between the systems concerns the topic covered.
Indeed, inspecting the recommended paper topics shows that BIBLME RecSys
provides suggestions closest to the targeted paper topics. Unlike Search
OpenEdition that tends to provide suggestions in terms of related themes. Let's take the
example of the paper "Su sm and Tradition" which is focused on the in uence
of the intellectual Rene Guenon on European Su Islam. BIBLME RecSys
provides suggestions whose the main topics are Su sm and/or Rene Guenon which
are central topics to explaining content of the targeted paper. Unlike Search
OpenEdition proposes suggestions based on the religious object topic. From this
analysis, we can observe that BIBLME RecSys 's suggestions are more closely
linked to the targeted paper topic. Conversely, those of Search OpenEdition are
on more generic scienti c aspects. Obviously, results are contrasted. An another
example, the paper "From star system to people" which is focused on
marketing strategies produced through the "star system". Given the candidate paper
topics, BIBLME RecSys provides suggestions about the economic exploitation
of notoriety and Search OpenEdition proposes suggestions based on the topic of
the "celebrity culture". In this case, each system provides suggestions with at
least one central topic related to the targeted paper. Despite this, these examples
indicate how our approach can characterize user's interests by proposing papers
based on important topics of the targeted paper.</p>
      <p>Limitations. The user feedback has revealed di erent behaviours from each
system. Indeed, our approach provides suggestions more closely related to the
targeted paper topics than Search OpenEdition. The suggestions proposed by
BIBLME RecSys are extracted directly from the text which explain close topic
links. Sometimes it was di cult for users to evaluate recommended papers due
to the topic complexity. Thus, the main limitations concern users' satisfaction.
In this experiment, we focused on topic links between recommended papers and
targeted papers. However, in the context of scholarly recommender system it is
important to assess the scienti c content of recommended papers. In this
experiment, we can observe that users are able to evaluate the topic links although they
are not specialists on proposed paper's topics. Papers not su ciently evaluated,
such as "Karst : from palaeogeographic archives to environmental indicators",
re ect the needs of a speci c expertise.</p>
      <p>Finally, leveraging our centrality indicator, BIBLME RecSys is able to suggest
central papers of the author's paper and therefore relevant readings according
to the proposed paper. This is then re ected in the user choices which tend to
select BIBLME RecSys 's suggestions. We believe that our approach is e ective
in characterizing candidate papers to recommend in order to obtain much higher
recommendation relevance in the context of scholarly recommender system.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>We have explored an approach based on the content analysis of the paper the
user is reading. From bibliographical reference analysis and and objective
quantitative measurements we proposed a centrality indicator. This indicator allows
to evaluate bibliographical references' importance of the paper that the user
interacted with. In this approach, we represent a candidate paper from the
number of its mentions and how its citations are used by the authors. From these
information, we determined central papers of the authors and therefore relevant
readings. Our results showed that, in discovery of potential relevant readings,
BIBLME RecSys 's suggestions are more closely linked to the targeted paper
topic.</p>
      <p>
        We believe that our approach can be applied more generally in the context of
digital libraries. Harnessing bibliographical references in the full-text can be used
wherever scienti c domains. Moreover, this indicator is based on authors' citation
behaviours speci c to the targeted paper unlike recent works in bibliometrics [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
The use of a such indicator can highlight, for a given paper, the in uence of
references on the author's paper. This indicator may be used for the scienti c
activity evaluation and scienti c networks evaluation currently practiced in the
bibliometric eld. This indicator allows to harness information about central
papers used by authors and potentially the most in uential on their research.
      </p>
      <p>
        To discover much more relevant papers, in future work, we plan to use graph
data model for our data in order to exploit recommendation algorithms by graph
analysis. By this modelling, we intent to involve external resources based on the
same topics but also to consider the centrality indicator as edges. Moreover, we
plan to determine relations between references and their proximity [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], and so
propose references between two articles (citing-cited) based on their a liation
to a particular scienti c domain, similar author collectives and their in uence on
each other. Our future work direction also aims to examine the degree of users'
satisfaction regarding the OpenEdition Journals through library user surveys.
      </p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgment</title>
      <p>This research was supported by ANR program Investissements d'Avenir EquipEx
DILOH (ANR-11-EQPX-0013).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Asabere</surname>
            ,
            <given-names>N. Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xia</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meng</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
          </string-name>
          , H.:
          <article-title>Scholarly paper recommendation based on social awareness and folksonomy</article-title>
          .
          <source>International Journal of Parallel, Emergent and Distributed Systems</source>
          , vol.
          <volume>30</volume>
          no.
          <issue>3</issue>
          , pp.
          <fpage>211</fpage>
          -
          <lpage>232</lpage>
          , (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Baeza-Yates</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ribeiro-Neto</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Modern information retrieval: The Concepts and Technology behind Search</article-title>
          . ACM Press, New York, (
          <year>1999</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>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>: paper recommender systems: a literature survey</article-title>
          .
          <source>International Journal on Digital Libraries</source>
          , vol.
          <volume>17</volume>
          no.
          <issue>4</issue>
          , pp.
          <volume>305</volume>
          {
          <fpage>338</fpage>
          , (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Belter</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>"Bibliometric indicators: opportunities and limits"</article-title>
          ,
          <source>Journal of the Medical Library Association</source>
          , vol.
          <volume>103</volume>
          no.
          <issue>4</issue>
          ,
          <string-name>
            <given-names>Medical</given-names>
            <surname>Library</surname>
          </string-name>
          Association, pp.
          <fpage>219</fpage>
          , (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Bogers</surname>
          </string-name>
          , T., Van den Bosch, A.:
          <article-title>Recommending scienti c articles using citeulike</article-title>
          .
          <source>In: the 2008 ACM conference on Recommender systems</source>
          , pp.
          <volume>287</volume>
          {
          <issue>290</issue>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Bollacker</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lawrence</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giles</surname>
          </string-name>
          , L.:
          <article-title>CiteSeer: An autonomous web agent for automatic retrieval and identi cation of interesting publications</article-title>
          .
          <source>In: Proc. of the 2nd Int. Conf</source>
          . Autonomous agents, pp.
          <volume>116</volume>
          {
          <issue>123</issue>
          , vol.
          <volume>41</volume>
          no.
          <issue>1</issue>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Haruna</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ismail</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Damiasih</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutopo</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Herawan</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>A collaborative approach for research paper recommender system</article-title>
          .
          <source>PloS one</source>
          , vol.
          <volume>12</volume>
          no.
          <issue>10</issue>
          , (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Hristakeva</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kershaw</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rossetti</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Knoth</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pettit</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vargas</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jack</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Building recommender systems for scholarly information</article-title>
          .
          <source>In: 1st International Workshop on Scholarly Web Mining (SWM)</source>
          ,
          <source>International Conference on Web Search and Data Mining</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Khabsa</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giles</surname>
            ,
            <given-names>C. L.</given-names>
          </string-name>
          :
          <article-title>The number of scholarly documents on the public web</article-title>
          .
          <source>PloS one</source>
          , vol.
          <volume>9</volume>
          no.
          <issue>5</issue>
          , pp.
          <fpage>e93949</fpage>
          , (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>Y.-M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bellot</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Faath</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dacos</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Automatic annotation of bibliographical references in digital humanities books, articles and blogs</article-title>
          .
          <source>In: Proc. of the 4th ACM workshop on Online books, complementary social media and crowdsourcing</source>
          , pp.
          <volume>41</volume>
          {
          <issue>48</issue>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Knoth</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Anastasiou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Charalampous</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cancellieri</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pearce</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pontika</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bayer</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>Towards e ective research recommender systems for repositories</article-title>
          .
          <source>In: Proc. of Open Repositories</source>
          , Open Repositories, (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Mnnich</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Spiering</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Adding value to the library catalog by implementing a recommendation system</article-title>
          .
          <string-name>
            <surname>D-Lib</surname>
            <given-names>Magazine</given-names>
          </string-name>
          ,
          <volume>14</volume>
          .5/6, pp.
          <volume>1082</volume>
          {
          <fpage>9873</fpage>
          , (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Nascimento</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Laender</surname>
            ,
            <given-names>A. H.</given-names>
          </string-name>
          , da
          <string-name>
            <surname>Silva</surname>
            ,
            <given-names>A. S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gonalves</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          :
          <article-title>A source independent framework for research paper recommendation</article-title>
          .
          <source>In : Proc. of the 11th annual international ACM/IEEE joint conference on Digital libraries</source>
          , pp.
          <volume>297</volume>
          {
          <issue>306</issue>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Lops</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Gemmis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semeraro</surname>
          </string-name>
          , G.:
          <article-title>Content-based recommender systems: State of the art and trends</article-title>
          .
          <source>Recommender systems handbook</source>
          , pp.
          <volume>73</volume>
          {
          <issue>105</issue>
          , Springer, (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Ollagnier</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fournier</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bellot</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>A Supervised Approach for Detecting Allusive Bibliographical References in Scholarly Publications</article-title>
          .
          <source>In : ACM WIMS Conference on Web Intelligence, Mining and Semantics (WIMS)</source>
          , Nmes, France, pp.
          <volume>36</volume>
          {
          <fpage>39</fpage>
          , (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Pazzani</surname>
            ,
            <given-names>M. J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Billsus</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Content-based recommendation systems</article-title>
          .
          <source>In: The adaptive web</source>
          , pp.
          <volume>325</volume>
          {
          <issue>341</issue>
          , Springer, Berlin, Heidelberg. (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Philip</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shola</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ovye</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Application of content-based approach in research paper recommendation system for a digital library</article-title>
          .
          <source>International Journal of Advanced Computer Science and Applications</source>
          <volume>5</volume>
          .10 (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Su</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khoshgoftaar</surname>
            ,
            <given-names>T. M.:</given-names>
          </string-name>
          <article-title>A survey of collaborative ltering techniques</article-title>
          .
          <source>Advances in arti cial intelligence</source>
          , pp.
          <fpage>4</fpage>
          , (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , Safer.,
          <string-name>
            <surname>M. A.</surname>
          </string-name>
          :
          <article-title>Author-rated importance of cited references in biology and psychology publications</article-title>
          .
          <source>Journal of Documentation</source>
          , vol.
          <volume>62</volume>
          no.
          <issue>2</issue>
          , pp.
          <volume>246</volume>
          {
          <fpage>272</fpage>
          , (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Torres</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mcnee</surname>
            ,
            <given-names>S. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Abel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Konstan</surname>
            ,
            <given-names>J. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Riedl</surname>
          </string-name>
          , J.:
          <article-title>Enhancing digital libraries with TechLens</article-title>
          .
          <source>In : Proc. of the 2004 Joint ACM/IEEE Conference on. IEEE</source>
          , pp.
          <volume>228</volume>
          {
          <fpage>236</fpage>
          , (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Tran</surname>
            ,
            <given-names>H. D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cabanac</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hubert</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Expert suggestion for conference program committees</article-title>
          .
          <source>In : 11th International Conference on Research Challenges in Information Science (RCIS)</source>
          , pp.
          <volume>221</volume>
          {
          <issue>232</issue>
          ,
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          , (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wei</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Zhang,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Zhang</surname>
          </string-name>
          , L.:
          <article-title>CARES: a ranking-oriented CADAL recommender system</article-title>
          .
          <source>In : Proc. of the 9th ACM/IEEE-CS joint conference on Digital libraries</source>
          , pp.
          <volume>203</volume>
          {
          <issue>212</issue>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>