<!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>
      <journal-title-group>
        <journal-title>B. Metzler);
schenkel@uni-trier.de (R. Schenkel)</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Trust me, I am an Expert: Predicting the Credibility of Experts for Statements</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Markus Nilles</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lorik Dumani</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Björn Metzler</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ralf Schenkel</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Trier University</institution>
          ,
          <addr-line>Behringstraße 21, D-54286 Trier</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>Nowadays, information on any topic can be researched on the Internet. However, in addition to reputable news sources, there is also a great deal of fake news that is disseminated, e.g., via social media or in established newspapers. Thus, the veracity must be assessed for each piece of information. People, parties, and organizations want to push through their interests and sometimes do not hesitate to spread fake news. For some time now, one popular means has been to quote (supposed) experts in a field. For example, -due to his authority- Albert Einstein is often quoted by believers in God although he was primarily concerned with physics while his quotes on God are taken out of context. In this paper, we define a new task of expert suitability prediction and evaluate methods to assess the credibility of a person with reference to a statement and its context and compare it to state-of-the-art approaches applying transformer-based embeddings. In an R4 cycle in CBR this approach could be used for the ranking. In this pilot study, we restrict our experiments to researchers, which allows us to derive their expertise from their publications. Furthermore, we make a manually labeled dataset consisting of 1,700 (statement,expert) pairs where suitable experts were tediously searched out together with valuable context information (such as convincing text parts of the experts' contexts towards a statement) publicly available to stimulate further research in this very important, but up to now underrepresented area of fake news detection.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Fake News</kwd>
        <kwd>Expert Validation</kwd>
        <kwd>Claim Validation</kwd>
        <kwd>Argumentation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The Internet ofers countless opportunities to consume information, and social media such as
Facebook and Twitter increase the likelihood of contact with news [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. However, the
consumption of news is not always consciously selected, but users come across suggested articles because
they have been shared by their contacts, for example. Random access to news causes the number
of report sources to increase. At the same time, the potential for encountering misinformation
or disinformation increases as well. Misinformation describes unintentionally misinterpreted
information which is thus spread due to a lack of knowledge. In contrast, disinformation
consists of news reports created with the intention of spreading false information. This makes
it particularly important to recognize fake news, which includes both misinformation and
disinformation, and thus distinguish it from true facts. Misleading information has far-reaching
consequences and the global economic damage is estimated at 78 billion US dollars annually [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
This afects politics and industries as the finance and the advertising sector. Especially with
complex topics such as corona viruses, it is dificult to distinguish a serious report from false
news not only for laymen.
      </p>
      <p>
        Due to its efectiveness, a frequently used tactic to strengthen the message of own views is to
quote scientists on topics that are not the core area of their research. An infamous example
is Albert Einstein, who is often quoted by believers in God, although Einstein was primarily
concerned with physics and his quotes on God are taken out of context [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. In other words,
people misuse the authority of an expert in order to increase the trustworthiness of another
matter, while the expert’s expertise is rather to be found somewhere else. Regarding this
problem, it is not even important whether the experts are aware that they have been used for a
statement of another field, or whether they do this themselves. Accordingly, due to the ever
increasing and faster dissemination of information it is important to have a system that checks
whether the person making a statement or being cited for a statement also has the expertise
with regard to the topic of the statement to believe it and not only a lot of authority.
      </p>
      <p>To tackle this issue, this paper presents a pilot study for validating the suitability of experts
towards statements. To the best of our knowledge, there is no prior work addressing this. Since
it is harsh and controversial in practice to generalize when a person is an expert in a field, we
restrict our experiments to researchers only, since (1) we can derive their expertise from their
publications and (2) the expertise of scientists with experience in a field is usually not disputed;
the extension of the application to non-scientists is then part of the future work. Certainly,
people who neither conduct research on a topic nor have published on it can also be experts on
a number of subjects but they are usually not consulted as experts on controversial matters to
increase trust such as energy supply or behavior in the event of military action. Thus, in this
paper we pursue to answer the question whether somebody would believe a supposed expert if
they made a certain statement. However, to find out whether the expert in question actually
made the statement is not part of this work. In CBR, this approach could be used as ranking
component in the R4 cycle.</p>
      <p>We make the following contributions:
(i) We define the new task of assessing researchers’ expertise regarding controversial
statements.
(ii) We provide a dataset containing 1,700 manually labeled (statement,expert) pairs along
with important contextual information to push this research forward.1
(iii) We investigate the performance with state-of-the-art machine-learning approaches to
make predictions about researchers’ expertise towards statements.</p>
      <p>Next, we address related work in Section 2. In Section 3 we define the task of assessing
researchers’ expertise regarding controversial statements and introduce the dataset. Then, we
present our methods and report the results of our evaluation in Section 4. We conclude the
paper and give an outlook to future work in Section 6.
1The dataset is available at the following link: https://doi.org/10.5281/zenodo.6586678</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>Due to the increasing prevalence of fake news, the research area of fact checking is becoming
more and more prominent in NLP. However, to the best of our knowledge, no one has validated
expert statements and particularly not by examining scientific publications of researchers.
Hence, we briefly survey the state-of-the-art in (1) research in general, (2) evidence-based
research studies, as our approach might be used to identify resources to fact check claims, (3)
credibility prediction studies, and (4) data fusion and worker expertise in crowdsourcing, as our
method has some similarities to them.</p>
      <p>
        Fake News detection in general In their meta-analysis, Thorne et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] summarize the
current state of research of automatic fact-checking and divide claim validation into verification
and fact-checking. Basically, there are two concepts of how the facts of claims are verified. While
some approaches perform verification using knowledge bases [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], e.g. by using WordNet [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ],
others use Natural Language Inference [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] to check short sentences. The tool ClaimBuster [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]
determines how check worthy each sentence of a given input is and finds similar statements in
a database to assess its truthfulness. While some works rely solely on the sentence [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], others
consider additional metadata such as speaker profiles [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ] or linguistic features [
        <xref ref-type="bibr" rid="ref12 ref13 ref14 ref15 ref16">12, 13, 14, 15,
16</xref>
        ]. Other works address the trustworthiness of websites by evaluating the graph connections
and ignore the content [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
      </p>
      <sec id="sec-2-1">
        <title>Evidence-Based Research Studies and Credibility Prediction Studies Fields that are</title>
        <p>related to our paper to a certain degree are, to the best of our knowledge, evidence-based
research studies and credibility prediction studies.</p>
        <p>
          Those works consider social networks such as Twitter and measure, e.g., user influence [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ].
The work by Canini et al. [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] is closest to ours, as it ranks social network users according to
their credibility on a topic by combining the analysis of the link structure of social networks
with topic models of the content of messages to identify and evaluate topically relevant and
credible sources of information in social networks. They define credibility as the combination
of expertise and trust, and expertise as the support of other professionals [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ]. Note that
in our paper, this support of researchers is achieved through the acceptance of papers in a
peer-reviewed process at a conference.
        </p>
        <p>
          Source Credibility in Data Fusion and Worker Expertise in Crowdsourcing Other
related fields are source credibility in data fusion and worker expertise in crowdsourcing. In the
ifeld of data fusion, the goal is to combine data from multiple sources to achieve a more accurate
overall picture than if only one data source is considered. For the calculation of the overall
picture, it is important to know the credibility of the individual sources and to include them in
the calculation [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]. MacDonald et al. [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] modeled expert ranking as a voting problem. In the
ranking, the documents voted for the expert candidates and the score of each candidate was
calculated using various data fusion techniques, e.g. Reciprocal Rank. Also in crowdsourcing
systems such as Amazon Mechanical Turk, in which people from diferent fields collaborate
with each other, it is important to determine the expertise of the people in advance in order to
determine the best qualified person for the task [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ].
combine
all combinations
        </p>
        <p>of contexts
min</p>
        <p>focused
min</p>
        <p>all
focused
all</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Task Definition and Dataset</title>
      <p>As indicated in Section 1, we aim to estimate a potential expert’s domain knowledge with
respect to a statement using the context of both the statement and the potential expert. In this
section, we first define the new task, then we discuss the dataset we created for this purpose.
Note that this construction requires two components: the first consists of statements with their
context. The second consists of potential experts and their expertise on these statements.
Task Definition Given a statement  with context (), as well as an expert  with context
(). The task is to determine whether  is a credible expert given their context (), if making</p>
      <p>Social innovation keep care affordable
Social innovation prevents use of more expensive forms of
care through better coordination between supply and demand.</p>
      <p>Social innovation reduces care demands and costs by better</p>
      <p>matching supply and demand.</p>
      <p>Social innovation leads to fewer layers of management</p>
      <p>enabling organizations to become cheaper.</p>
      <p>Social innovation leads to lower absenteeism costs because
satisfied employees are less sick.</p>
      <p>Social innovation provides more fun at work
Social innovation gives employees responsibility and they
want to wear.</p>
      <p>...</p>
      <p>Finance</p>
      <p>What are
arguments for and
against social
innovation?
Pro</p>
      <p>Con
Job satisfaction
or being cited for the statement  in context (). As we restrict our work to researchers, the
context () will be represented by ’s publications as well as the research interests of . As
in this study we aim to show that our approach is feasible and also to reduce complexity and
to anticipate performance reasons, in this paper the expertise of each expert is represented by
exactly one of their publications; an extension to all publications will be left for future work.2
Figure 1 depicts the type of context information we will use for the remainder of the paper. More
precisely, we will investigate in all combinations of contexts for both experts and statements.
The contexts are split into min, focused, and all. Here, min represents the minimum that could
be required as context. The set focused expands the set min with further context that is available,
at least for a longer period immutable, and realistic to be used in an application. The last set
all contains even more context with the goal to examine its impact (1) either with information
where the methods to determine are still being researched as in the case with the context of the
statement and (2) with data that is rather related to the authority of a researcher as in the case
of an expert’s publication.</p>
      <sec id="sec-3-1">
        <title>Finding Suitable Statements for our Dataset We built upon the dataset from Dumani et</title>
        <p>
          al. [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ] as a source of statements. It consists of 49 argument graphs having 2,186 arguments with
binary stances as well as 133 diferent frames associated with them. This dataset was originally
introduced to cluster arguments to diferent granularities such as their stances, their frames, or
their quintessence. Figure 2 shows an example of such a graph that is taken from that paper.
        </p>
        <p>We chose this dataset for several reasons: first, it covers various (Dutch) national as well
as international political issues such as the environment or pensions, on which people might
want to listen to expert opinions. Second, since the dataset consists of argument graphs, the
root of each graph describes the core question, while each of the other nodes contains further
2We argue that this is not a drawback since in this case an expert would be classified as suitable as long as at least
one of their papers fits.
example from dataset
Infection Prevention
About this card: This Argumentation Card
provides an overview of arguments for or against
the implementation of infection prevention
measures in all forms of residential care in the
elderly. Healthcare professionals have laid down
. . .</p>
        <p>What arguments do nursing homes use for and
against implementing infection prevention
measures?
In front of
Feasibility
Infection prevention prevents unnecessary work
Caring for sick people takes extra time and is a
drain on the daily routine.
partial information such as the stance, the frame, or a cluster (with a short summary with the
quintessence) of the statement. As we aim to incorporate diferent contexts to each statement
in order to evaluate the estimation of expertise, this dataset allows us to do that conveniently.
Starting with this dataset, we randomly picked 200 statements with their context information to
proceed from there. To avoid bias, we constrained that no statement would be included in this
sample if there was already another one with the same stance, the same frame, and consequently
the same quintessence. An example of a statement with its context is shown in Table 1.
Enriching the Dataset with Suitable Experts W.r.t. these 200 statements, three members of
our team searched on Google Scholar for two ideal experts for each statement, i.e. researchers
who had published papers that are very related to the content of the statements. We decided to
use Google Scholar as our expert source as it is the largest scientific literature database of
authors and their publications including diferent disciplines that we are aware of. It includes
not only diferent disciplines, but also diferent source documents such as professional articles,
theses, dissertations, books, abstracts, or court opinions.</p>
        <p>The exact task was to find experts for these statements who would be believed if they were
cited to substantiate them. In this context, we asked the annotators to find two experts from
diferent papers for each statement, i.e., the expert of paper 1 was not allowed to be a co-author
of paper 2 and vice versa.</p>
        <p>One annotator proposed experts for statements, and the other two either approved them or
replaced them with others that were in turn reviewed by the others. The annotators developed
text snippets based on the statements to retrieve suitable experts when typing them into Google
Scholar.</p>
        <p>In finding the best variation of search snippets, they were allowed to be creative and enter
words that do not appear in the sentence. The decision whether an expert was a good match or
not depended on several characteristics, such as the title of their publications, their abstracts,
and their research interests which are indicated by the scientist .3</p>
        <p>From the 200 statements, a total of 340 experts could be determined for 170 statements. The
remaining could not be associated with any experts at all, as they are not suitable for verification,
e.g. because the statements are far too general, or even far too specific about regional problems.</p>
        <p>
          W.r.t. the example in Table 1, the statement “Caring for sick people takes extra time and is a
drain on the daily routine.” was changed to the search snippet “daily efects of caring for sick
people” for which Google Scholar, finds, i.a., the paper titled “ Diferences in impact of long
term caregiving for mentally ill older adults on the daily life of informal caregivers: a qualitative
study” [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]. In this case, the annotators listed the part “Caregivers themselves are often aged, and
although caregiving implies an impact on daily life that exceeds the boundaries of usual informal
care” of the abstract to be the persuasive part to believe in the expert’s knowledge towards that
statement.
        </p>
        <p>Rating of Random Scientists to the Statements Based on these 170 statements and the 340
experts, we randomly picked eight additional experts from this expert pool for each statement,
yielding a total of 1,360 additional (statement,expert) pairs. Two annotators independently
inspected the researchers’ Google Scholar profiles for these pairs and, based on the research
interests, as well as their paper titles and abstracts, assigned the labels 0, 1, and 2, indicating
whether the researcher is a suitable expert to make the statement. A third annotator also
assigned a label if the ratings of the first two difered. This happened 532 times which shows
the dificulty of this task caused by the subjectivity of the annotators.</p>
        <p>The task was to assume that someone refers for statement  to expert . Then, the annotators
should indicate on the basis of the ’s research whether they would be convinced while neglecting
the truth content of , i.e., they just concentrated on the topics of  and the expertise of .</p>
        <p>The label 0 was assigned if the expert did not match the statement at all. This could be, e.g.,
if the expert is a psychologist, but the statement deals with processors. In contrast to that, the
label 2 was assigned if the expert is a perfect fit for the statement. The label 1 was assigned
to experts who fit partially. This decision is slightly more dificult to assign because this is
more subjective. The annotators were instructed to assign e.g. an economist the score 1, if the
statement has something to do with economics. Here we made the assumption that they must
have learned the same in their basic studies and are therefore reasonably familiar with each
other’s subjects. However, obviously, this assumption may not always be correct.</p>
        <p>Altogether, we received 3,252 (=2 · 1,360 + 532) assessments for the 1,360 statements. Label 0
was assigned a total of 2,192 times, label 1 a total of 909 times, and label 2 another 151 times.</p>
        <p>
          We measured the robustness of the annotations using Krippendorf’s  . Measuring the
assessments of the first two annotators resulted in an inter-annotator agreement (IAA) of 0.262
(interval metric). This IAA improved to 0.411 by adding the third annotator. According to
Landies and Koch [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ], values between 0.4 and 0.6 represent a moderate agreement.
        </p>
        <p>This value is quite low and indicates the dificulty for this task from a completely diferent
point of view, namely the subjectivity in evaluating expertise. We argue that the annotations
3Note that in addition to the expert itself, we include both the search snippets and the text snippets that convinced
the annotator in our dataset.
are nevertheless better than a first glance would suggest as the third annotator knew that the
two annotators had previously given unequal annotations, and the latter therefore weighed
particularly carefully what to assign.</p>
        <p>Final dataset Finally, our dataset consists of a total of 1,700 labeled (statement,expert) pairs,
where 340 were labeled with a score of 2 because the associated experts were manually picked
for these statements. For the remaining 1,360 pairs, we used majority voting of the three
annotators for the final label. Especially in light of the improved IAA, this seemed reasonable.
W.r.t. the 1,360 pairs, 997 were assigned with label 0, another 309 were assigned with label 1,
and 54 were assigned with label 2.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Methods</title>
      <p>With the last section introducing a dataset suitable for learning and evaluating the prediction of
researcher’s expertise, in this section we now present and evaluate methods for accomplishing
this.</p>
      <p>We examine three approaches: Our main approach bases on a transformer-based and
finetuned cross-encoder model. In particular, as we want to measure the performance of diferent
contexts (see Section 3), we consider all 9 (=3 · 3) combinations of the subsets {min, focused, all}×
{min, focused, all} of contextual information as shown in Figure 1 and explained in Section 3.</p>
      <p>The next approach serves as baseline and makes use of the state-of-the-art BERT where the
resulting embeddings are classified by several, i.e., seven standard classifiers such as a support
vector machine or gradient boosting.</p>
      <p>
        The last approach serves as a comparison and makes use of a classical and very successful
IR approach, namely BM25F [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ], which is an extension of the famous BM25 method with
document structure and anchor text.
      </p>
      <p>
        Classifiers based on Cross-Encoders Due to the great success of transformer-based
embedding methods, which have brought about great positive impact in the field of NLP, it is
appropriate to use a state-of-the-art model for predicting the expertise of researchers with
respect to statements. After weighing the advantages and disadvantages of the various
frameworks and approaches, our main approach consists of a cross-encoder [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ]. Note that unlike
bi-encoders, which produce a separate embedding for each text input and then use, for
example, the cosine similarity of vectors to measure their similarity, cross-encoders generate an
embedding for two simultaneously introduced texts. In our case, one text input consists of the
expert’s information and its context, and the other text content consists of the statement and its
context. Cross-encoders usually perform better than bi-encoders, but have the disadvantage
that they can only be used on predefined sets. However, since the set of potential experts is
usually manageable and only needs to be updated at longer intervals, we weighed that it is
reasonable to apply this approach.
      </p>
      <p>In our experiments, we created 10 folds for this purpose and evaluated them via
crossvalidation. We employed the python framework sentence-transformers and utilized the
model “roberta-large”. More precisely, we fine-tuned this model for each combination and
each (train,test) fold for 3 epochs always with a batch size of 16. We refer to this method using
the cross-encoder with CERoBERTa.</p>
      <sec id="sec-4-1">
        <title>Baseline utilizing BERT and Standard Classifiers As a baseline, we trained several</title>
        <p>
          standard classifiers. As input, the classifiers received embeddings created with the pre-trained
Sentence-BERT model [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ] “all-roberta-large-v1”. To create the input for the classifiers,
we computed an embedding vector for the expert’s context and an embedding vector for
a statement and its context and concatenated them. We applied the Python library
scikitlearn [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ] for initializing and training the classifiers. We utilized the following algorithms
in their default configuration for classification: Multi-layer Perceptron ( MLPRoBERTa), Nearest
Neighbor (KNN RoBERTa), Gaussian Naive Bayes (GNBRoBERTa), Gradient Boosting (GBRoBERTa),
Random Forest (RF RoBERTa), Support Vector Machine (SVMRoBERTa) and Logistic Regression
(LRRoBERTa).
        </p>
        <p>BM25F This approach serves as comparison. The intuition behind this is the assumption that
the experts’ knowledge represented by their textual publications could have textual overlap to
a statement or its context. In order to implement the approach with BM25F, we first indexed all
experts together with their context information (as shown in Figure 1) using the Java framework
Apache Lucene. The goal here is to enter a statement and get a list of potentially matching
experts. The main diference between BM25 and BM25F is that the latter allows us to add more
ifelds than just one to the query. 4</p>
        <p>We therefore added the fields from the statement’s context, which are shown in Figure 1, to
the queries. For example, with the combination min × min, we have a total of four search fields,
since we look for both the statement and the query in the research interests and the titles. When
querying the statement, the result is a list of ten experts with scores that are above Apache
Lucene’s internal and default threshold, but do not yet correspond to our labels 1 (partial
expert) and 2 (full expert) and thus have to be converted. 5 In order to get the maximum out,
we use wildcards for this prediction, i.e., the correct prediction 1 or 2 is automatically assigned
to the expert if BM25F lists the researcher in its list. Using this oracle, we are able to detect the
upper bound of this approach with more clarity. We coin this method OracleBM25F.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Evaluation</title>
      <p>
        We measured the performance with precision, recall, F1, and accuracy. Therefore, we computed
these mean average values in a 10 fold cross validation for each context combination. More
precisely, the precision is calculated by the fraction of the experts that were predicted as 1
or 2 for which the prediction was correct. Further, the recall is computed by the fraction of
the experts labeled as 1 or 2 for which the prediction was correct.6 To better interpret these
values, we also included a method called Zero in the evaluation that always predicts 0 because
4In the Java framework Apache Lucene this is done by using the class BlendedQuery [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ].
5Note that Apache Lucene allows to vary the number of maximum results but our experiments with the values 5,
10, 50, and unlimited had no impact at the final results.
6Since BM25F can be seen as an oracle, we mapped the values 1 and 2 to a single value to boost its performance.
this makes up the largest class in our dataset, allowing us to better interpret the results of the
evaluation.
      </p>
      <p>Table 2 shows the performance of the examined methods. Note, that we excluded all from the
expert combinations in the method OracleBM25F as it does not make any sense for textual string
matching, e.g., to search for the number of citations of a researcher. The values are sorted in
descending order according to the F1 score, since the accuracy alone can be misleading. Going
by the accuracy, we get the best performance by always predicting 0 (see method Zero with
accuracy 0.764). However, in this case we also obtain 0 for the precision, the recall, and the
F1-score.</p>
      <p>The second best accuracy is 0.76 and is obtained with our classifier CERoBERTa with the contexts
focused for statement and all for the expert. The accuracy value is almost equal to that of Zero
but the other scores in the table show that CERoBERTa is much more useful as its F1 score (0.627)
is also the highest, revealing that this approach also provides reasonable results for partially
and full experts and not only for non-experts. We also see that while CERoBERTa seems to be a
precision-oriented approach (0.783) OracleBM25F tends to be a recall-oriented method (0.721).
W.r.t. the baseline we only show the classifiers with their best performing context combinations.
Following the table, the method MLPRoBERTa produces the second best performance with the
contexts min, respectively, when using the 1 score. While the recall of MLPRoBERTa (0.551)
performs comparably well to the best method CERoBERTa(0.526), CERoBERTaachieves the better
precision (0.783 instead of 0.625) and thus the better 1-score (0.627 instead of 0.584).</p>
      <p>
        We can infer from the table that OracleBM25F performs better the more context we feed into
it. Note, that the good performance of OracleBM25F probably results from the fact that it works
partly as an oracle. Actually, it performs very poorly when it is not fed with all statement’s
context information. The rankings also suggest that the baseline is more sensitive to the context
of the statement. CERoBERTa performs best when providing focused context information of the
statement and all context information of the expert. However, these numbers should be treated
with caution, because the performance was boosted by adding publication-independent features
such as the ℎ-index. Considering only the textual content of the publication, all × focused
produces the best and most realistic result when applying cross-encoders. Almost all standard
classifiers perform best when the context focused is chosen for the statement. Too much
information probably has a negative efect here. Regarding the context of the expert, it is a bit
more mixed. In particular, it is noticeable that the second best method in the table, MLPRoBERTa,
performs best only with minimal input in each case. We suspect that the context in the statement
loses its impact due to long background information in focused. In the future, we consider using
automatic summarization methods like T5 [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ] or keyword extractors like Yake [
        <xref ref-type="bibr" rid="ref33 ref34 ref35">33, 34, 35</xref>
        ] to
avoid this issue. Also, we would like to investigate how the performance behaves when trying
new combinations, such as  ∖   ∪ .
      </p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion and Future Work</title>
      <p>Citing putative researchers to strengthen own viewpoints is a widely used means of Fake News.
In this paper, we defined the task of assessing a person’s expertise towards a statement and
showed successfully that we can predict whether a researcher is a partially or fully suitable
expert to be cited to believe a statement by fine-tuning a state-of-the-art transformer model.
We make the dataset consisting of 1,700 labeled (statement,expert) pairs together with valuable
information to train search engines publicly available for further research towards this new
task.</p>
      <p>As this evaluation can be seen as kick-of, there is obviously room for improvement. For
example, in our study we restricted the dataset to researchers that already published in the
ifeld of the statement’s topic. Further research needs to expand this to other people who can be
experts that have not published papers in the fields of the statements’ topics but deal with them
such as journalists or politicians. In addition to that, we always measured a researcher’s expertise
by representing them as the content of exactly one publication (and its context). Naturally,
future work needs to incorporate multiple publications of a researcher, e.g. to examine whether
other similar works are suficient to predict a researcher’s expertise.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>This work has been funded by the Deutsche Forschungsgemeinschaft (DFG) within the projects
ReCAP and ReCAP-II, Grant Number 375342983 - 2018-2024, as part of the Priority Program
“Robust Argumentation Machines (RATIO)” (SPP-1999).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Scharkow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Mangold</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Stier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Breuer</surname>
          </string-name>
          ,
          <article-title>How social network sites and other online intermediaries increase exposure to news</article-title>
          ,
          <source>Proceedings of the National Academy of Sciences</source>
          <volume>117</volume>
          (
          <year>2020</year>
          )
          <fpage>2761</fpage>
          -
          <lpage>2763</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>U.</surname>
          </string-name>
          of Baltimore, University of baltimore: “
          <article-title>fake news” has a real cost - and it's in the billions</article-title>
          (
          <volume>22</volume>
          .
          <fpage>11</fpage>
          .
          <year>2019</year>
          ),
          <year>2019</year>
          . URL: https://www.ubalt.edu/news/news-releases.
          <source>cfm?id=3425.</source>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Stachel</surname>
          </string-name>
          ,
          <string-name>
            <surname>Einstein from'B'to'Z'</surname>
          </string-name>
          , volume
          <volume>9</volume>
          ,
          <string-name>
            <surname>Springer</surname>
            <given-names>Science</given-names>
          </string-name>
          &amp; Business
          <string-name>
            <surname>Media</surname>
          </string-name>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Thorne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vlachos</surname>
          </string-name>
          , Automated fact checking:
          <article-title>Task formulations, methods and future directions</article-title>
          , in: E. M.
          <string-name>
            <surname>Bender</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Derczynski</surname>
          </string-name>
          , P. Isabelle (Eds.),
          <source>Proceedings of the 27th International Conference on Computational Linguistics</source>
          ,
          <string-name>
            <surname>COLING</surname>
          </string-name>
          <year>2018</year>
          ,
          <string-name>
            <given-names>Santa</given-names>
            <surname>Fe</surname>
          </string-name>
          , New Mexico, USA,
          <year>August</year>
          20-
          <issue>26</issue>
          ,
          <year>2018</year>
          , Association for Computational Linguistics,
          <year>2018</year>
          , pp.
          <fpage>3346</fpage>
          -
          <lpage>3359</lpage>
          . URL: https://www.aclweb.org/anthology/C18-1283/.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>H.</given-names>
            <surname>Ji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Grishman</surname>
          </string-name>
          ,
          <article-title>Knowledge base population: Successful approaches and challenges</article-title>
          , in: D.
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Matsumoto</surname>
          </string-name>
          , R. Mihalcea (Eds.),
          <article-title>The 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies</article-title>
          ,
          <source>Proceedings of the Conference</source>
          ,
          <volume>19</volume>
          -
          <fpage>24</fpage>
          June,
          <year>2011</year>
          , Portland, Oregon, USA, The Association for Computer Linguistics,
          <year>2011</year>
          , pp.
          <fpage>1148</fpage>
          -
          <lpage>1158</lpage>
          . URL: https://www.aclweb.org/anthology/P11-1115/.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>G.</given-names>
            <surname>Angeli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <article-title>Naturalli: Natural logic inference for common sense reasoning</article-title>
          , in: A.
          <string-name>
            <surname>Moschitti</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Pang</surname>
          </string-name>
          , W. Daelemans (Eds.),
          <source>Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing, EMNLP 2014, October 25-29</source>
          ,
          <year>2014</year>
          , Doha,
          <string-name>
            <surname>Qatar,</surname>
          </string-name>
          <article-title>A meeting of SIGDAT, a Special Interest Group of the ACL</article-title>
          , ACL,
          <year>2014</year>
          , pp.
          <fpage>534</fpage>
          -
          <lpage>545</lpage>
          . URL: https://doi.org/10.3115/v1/d14-
          <fpage>1059</fpage>
          . doi:
          <volume>10</volume>
          .3115/v1/d14-
          <fpage>1059</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>I.</given-names>
            <surname>Dagan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Dolan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Magnini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Roth</surname>
          </string-name>
          ,
          <article-title>Recognizing textual entailment: Rational, evaluation and approaches - erratum</article-title>
          ,
          <source>Nat. Lang. Eng</source>
          .
          <volume>16</volume>
          (
          <year>2010</year>
          )
          <article-title>105</article-title>
          . URL: https://doi.org/10. 1017/S1351324909990234. doi:
          <volume>10</volume>
          .1017/S1351324909990234.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N.</given-names>
            <surname>Hassan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Arslan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Caraballo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jimenez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gawsane</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hasan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Joseph</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kulkarni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Nayak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sable</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Tremayne</surname>
          </string-name>
          ,
          <article-title>Claimbuster: The first-ever end-to-end fact-checking system</article-title>
          ,
          <source>Proc. VLDB Endow</source>
          .
          <volume>10</volume>
          (
          <year>2017</year>
          )
          <fpage>1945</fpage>
          -
          <lpage>1948</lpage>
          . URL: http: //www.vldb.org/pvldb/vol10/p1945-li.
          <source>pdf. doi:10.14778/3137765</source>
          .3137815.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>H.</given-names>
            <surname>Rashkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. Y.</given-names>
            <surname>Jang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Volkova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <article-title>Truth of varying shades: Analyzing language in fake news and political fact-checking</article-title>
          ,
          <source>in: Proceedings of the 2017 conference on empirical methods in natural language processing</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>2931</fpage>
          -
          <lpage>2937</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>W. Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>"liar, liar pants on fire": A new benchmark dataset for fake news detection</article-title>
          , in: R. Barzilay, M. Kan (Eds.),
          <article-title>Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics</article-title>
          ,
          <string-name>
            <surname>ACL</surname>
          </string-name>
          <year>2017</year>
          , Vancouver, Canada,
          <source>July 30 - August 4</source>
          , Volume
          <volume>2</volume>
          :
          <string-name>
            <given-names>Short</given-names>
            <surname>Papers</surname>
          </string-name>
          ,
          <source>Association for Computational Linguistics</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>422</fpage>
          -
          <lpage>426</lpage>
          . URL: https: //doi.org/10.18653/v1/
          <fpage>P17</fpage>
          -2067. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>P17</fpage>
          -2067.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Long</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Xiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <article-title>Fake news detection through multi-perspective speaker profiles</article-title>
          , in: G. Kondrak, T. Watanabe (Eds.),
          <source>Proceedings of the Eighth International Joint Conference on Natural Language Processing, IJCNLP</source>
          <year>2017</year>
          , Taipei, Taiwan,
          <source>November 27 - December 1</source>
          ,
          <year>2017</year>
          , Volume
          <volume>2</volume>
          :
          <string-name>
            <given-names>Short</given-names>
            <surname>Papers</surname>
          </string-name>
          ,
          <source>Asian Federation of Natural Language Processing</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>252</fpage>
          -
          <lpage>256</lpage>
          . URL: https://www.aclweb.org/anthology/I17-2043/.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. K.</given-names>
            <surname>Burgoon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. F.</given-names>
            <surname>Nunamaker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Twitchell</surname>
          </string-name>
          ,
          <article-title>Automating linguistics-based cues for detecting deception in text-based asynchronous computer-mediated communications</article-title>
          ,
          <source>Group decision and negotiation 13</source>
          (
          <year>2004</year>
          )
          <fpage>81</fpage>
          -
          <lpage>106</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Cardie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Hancock</surname>
          </string-name>
          ,
          <article-title>Finding deceptive opinion spam by any stretch of the imagination</article-title>
          , in: D.
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Matsumoto</surname>
          </string-name>
          , R. Mihalcea (Eds.),
          <article-title>The 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies</article-title>
          ,
          <source>Proceedings of the Conference</source>
          ,
          <volume>19</volume>
          -
          <fpage>24</fpage>
          June,
          <year>2011</year>
          , Portland, Oregon, USA, The Association for Computer Linguistics,
          <year>2011</year>
          , pp.
          <fpage>309</fpage>
          -
          <lpage>319</lpage>
          . URL: https://www.aclweb.org/anthology/P11-1032/.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>R.</given-names>
            <surname>Mihalcea</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Strapparava</surname>
          </string-name>
          ,
          <article-title>The lie detector: Explorations in the automatic recognition of deceptive language</article-title>
          ,
          <source>in: ACL</source>
          <year>2009</year>
          ,
          <article-title>Proceedings of the 47th Annual Meeting of the Association for Computational Linguistics and the 4th</article-title>
          <source>International Joint Conference on Natural Language Processing of the AFNLP, 2-7 August</source>
          <year>2009</year>
          , Singapore, Short Papers, The Association for Computer Linguistics,
          <year>2009</year>
          , pp.
          <fpage>309</fpage>
          -
          <lpage>312</lpage>
          . URL: https://www.aclweb. org/anthology/P09-2078/.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Cardie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Hancock</surname>
          </string-name>
          ,
          <article-title>Negative deceptive opinion spam</article-title>
          , in: L.
          <string-name>
            <surname>Vanderwende</surname>
          </string-name>
          , H. D. III, K. Kirchhof (Eds.),
          <source>Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, Proceedings, June</source>
          <volume>9</volume>
          -14,
          <year>2013</year>
          , Westin Peachtree Plaza Hotel, Atlanta, Georgia, USA, The Association for Computational Linguistics,
          <year>2013</year>
          , pp.
          <fpage>497</fpage>
          -
          <lpage>501</lpage>
          . URL: https://www.aclweb.org/anthology/N13-1053/.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>S.</given-names>
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Banerjee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <article-title>Syntactic stylometry for deception detection, in: The 50th Annual Meeting of the Association for Computational Linguistics</article-title>
          ,
          <source>Proceedings of the Conference, July 8-14</source>
          ,
          <year>2012</year>
          ,
          <string-name>
            <given-names>Jeju</given-names>
            <surname>Island</surname>
          </string-name>
          , Korea - Volume
          <volume>2</volume>
          :
          <string-name>
            <surname>Short</surname>
            <given-names>Papers</given-names>
          </string-name>
          , The Association for Computer Linguistics,
          <year>2012</year>
          , pp.
          <fpage>171</fpage>
          -
          <lpage>175</lpage>
          . URL: https://www.aclweb.org/anthology/ P12-2034/.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Gyöngyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Garcia-Molina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. O.</given-names>
            <surname>Pedersen</surname>
          </string-name>
          ,
          <article-title>Combating web spam with trustrank, in: M. A</article-title>
          .
          <string-name>
            <surname>Nascimento</surname>
            ,
            <given-names>M. T.</given-names>
          </string-name>
          <string-name>
            <surname>Özsu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Kossmann</surname>
            ,
            <given-names>R. J.</given-names>
          </string-name>
          <string-name>
            <surname>Miller</surname>
            ,
            <given-names>J. A.</given-names>
          </string-name>
          <string-name>
            <surname>Blakeley</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <article-title>B</article-title>
          .
          <string-name>
            <surname>Schiefer</surname>
          </string-name>
          (Eds.),
          <source>(e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB</source>
          <year>2004</year>
          , Toronto, Canada,
          <source>August 31 - September 3</source>
          <year>2004</year>
          , Morgan Kaufmann,
          <year>2004</year>
          , pp.
          <fpage>576</fpage>
          -
          <lpage>587</lpage>
          . URL: http://www.vldb.org/conf/2004/RS15P3.PDF. doi:
          <volume>10</volume>
          .1016/B978-012088469-8.
          <fpage>50052</fpage>
          -
          <lpage>8</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M.</given-names>
            <surname>Cha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Haddadi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Benevenuto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Gummadi</surname>
          </string-name>
          ,
          <article-title>Measuring user influence in twitter: The million follower fallacy</article-title>
          ,
          <source>in: Proceedings of the international AAAI conference on web and social media</source>
          , volume
          <volume>4</volume>
          ,
          <year>2010</year>
          , pp.
          <fpage>10</fpage>
          -
          <lpage>17</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>K. R.</given-names>
            <surname>Canini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Suh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Pirolli</surname>
          </string-name>
          ,
          <article-title>Finding credible information sources in social networks based on content and social structure</article-title>
          , in: PASSAT/SocialCom 2011, Privacy, Security,
          <source>Risk and Trust (PASSAT)</source>
          ,
          <source>2011 IEEE Third International Conference on and 2011 IEEE Third International Conference on Social Computing (SocialCom)</source>
          , Boston, MA, USA,
          <fpage>9</fpage>
          -
          <lpage>11</lpage>
          Oct.,
          <year>2011</year>
          , IEEE Computer Society,
          <year>2011</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          . URL: https://doi.org/10.1109/PASSAT/ SocialCom.
          <year>2011</year>
          .
          <volume>91</volume>
          . doi:
          <volume>10</volume>
          .1109/PASSAT/SocialCom.
          <year>2011</year>
          .
          <volume>91</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>K. A.</given-names>
            <surname>Ericsson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. R.</given-names>
            <surname>Hofman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kozbelt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <source>The Cambridge handbook of expertise and expert performance</source>
          , Cambridge University Press,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>E. J.</given-names>
            <surname>Wright</surname>
          </string-name>
          ,
          <string-name>
            <surname>K. B. Laskey</surname>
          </string-name>
          ,
          <article-title>Credibility models for multi-source fusion</article-title>
          ,
          <source>in: 9th International Conference on Information Fusion, FUSION</source>
          <year>2006</year>
          , Florence, Italy,
          <source>July 10-13</source>
          ,
          <year>2006</year>
          , IEEE,
          <year>2006</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          . URL: https://doi.org/10.1109/ICIF.
          <year>2006</year>
          .
          <volume>301693</volume>
          . doi:
          <volume>10</volume>
          .1109/ICIF.
          <year>2006</year>
          .
          <volume>301693</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>C.</given-names>
            <surname>Macdonald</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Ounis</surname>
          </string-name>
          ,
          <article-title>Voting for candidates: adapting data fusion techniques for an expert search task</article-title>
          , in: P. S.
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>V. J.</given-names>
          </string-name>
          <string-name>
            <surname>Tsotras</surname>
            ,
            <given-names>E. A.</given-names>
          </string-name>
          <string-name>
            <surname>Fox</surname>
          </string-name>
          , B. Liu (Eds.),
          <source>Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management</source>
          , Arlington, Virginia, USA, November 6-
          <issue>11</issue>
          ,
          <year>2006</year>
          , ACM,
          <year>2006</year>
          , pp.
          <fpage>387</fpage>
          -
          <lpage>396</lpage>
          . URL: https: //doi.org/10.1145/1183614.1183671. doi:
          <volume>10</volume>
          .1145/1183614.1183671.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>D.</given-names>
            <surname>Schall</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Skopik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dustdar</surname>
          </string-name>
          ,
          <article-title>Expert discovery and interactions in mixed service-oriented systems</article-title>
          ,
          <source>IEEE Trans. Serv. Comput</source>
          .
          <volume>5</volume>
          (
          <year>2012</year>
          )
          <fpage>233</fpage>
          -
          <lpage>245</lpage>
          . URL: https://doi.org/10.1109/TSC.
          <year>2011</year>
          .
          <article-title>2</article-title>
          . doi:
          <volume>10</volume>
          .1109/TSC.
          <year>2011</year>
          .
          <volume>2</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>L.</given-names>
            <surname>Dumani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Wiesenfeldt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Schenkel</surname>
          </string-name>
          ,
          <article-title>Fine and coarse granular argument classification before clustering</article-title>
          , in: G. Demartini, G. Zuccon,
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Culpepper</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Huang</surname>
          </string-name>
          , H. Tong (Eds.),
          <source>CIKM '21: The 30th ACM International Conference on Information and Knowledge Management</source>
          , Virtual Event, Queensland, Australia, November 1 -
          <issue>5</issue>
          ,
          <year>2021</year>
          , ACM,
          <year>2021</year>
          , pp.
          <fpage>422</fpage>
          -
          <lpage>432</lpage>
          . URL: https://doi.org/10.1145/3459637.3482431. doi:
          <volume>10</volume>
          .1145/3459637.3482431.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>M. I.</given-names>
            <surname>Zegwaard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Aartsen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. H.</given-names>
            <surname>Grypdonck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cuijpers</surname>
          </string-name>
          ,
          <article-title>Diferences in impact of long term caregiving for mentally ill older adults on the daily life of informal caregivers: a qualitative study</article-title>
          ,
          <source>BMC psychiatry 13</source>
          (
          <year>2013</year>
          )
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Landis</surname>
          </string-name>
          ,
          <string-name>
            <surname>G. G. Koch,</surname>
          </string-name>
          <article-title>The measurement of observer agreement for categorical data, biometrics (</article-title>
          <year>1977</year>
          )
          <fpage>159</fpage>
          -
          <lpage>174</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Robertson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zaragoza</surname>
          </string-name>
          ,
          <article-title>The probabilistic relevance framework: BM25 and beyond</article-title>
          ,
          <source>Found. Trends Inf. Retr</source>
          .
          <volume>3</volume>
          (
          <year>2009</year>
          )
          <fpage>333</fpage>
          -
          <lpage>389</lpage>
          . URL: https://doi.org/10.1561/1500000019. doi:
          <volume>10</volume>
          . 1561/1500000019.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>Sentence-bert: Sentence embeddings using siamese bert-networks</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics</source>
          ,
          <year>2019</year>
          . URL: https://arxiv.org/abs/
          <year>1908</year>
          .10084.
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>Sentence-bert: Sentence embeddings using siamese bert-networks, in: K. Inui</article-title>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Ng</surname>
          </string-name>
          ,
          <string-name>
            <surname>X.</surname>
          </string-name>
          Wan (Eds.),
          <source>Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing, EMNLP-IJCNLP</source>
          <year>2019</year>
          ,
          <string-name>
            <given-names>Hong</given-names>
            <surname>Kong</surname>
          </string-name>
          , China, November 3-
          <issue>7</issue>
          ,
          <year>2019</year>
          , Association for Computational Linguistics,
          <year>2019</year>
          , pp.
          <fpage>3980</fpage>
          -
          <lpage>3990</lpage>
          . URL: https: //doi.org/10.18653/v1/
          <fpage>D19</fpage>
          -1410. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>D19</fpage>
          -1410.
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>F.</given-names>
            <surname>Pedregosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Varoquaux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gramfort</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Michel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Thirion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Grisel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Blondel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Prettenhofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Weiss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Dubourg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Vanderplas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Passos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cournapeau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brucher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Perrot</surname>
          </string-name>
          , E. Duchesnay,
          <article-title>Scikit-learn: Machine learning in Python</article-title>
          ,
          <source>Journal of Machine Learning Research</source>
          <volume>12</volume>
          (
          <year>2011</year>
          )
          <fpage>2825</fpage>
          -
          <lpage>2830</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>D.</given-names>
            <surname>Turnbull</surname>
          </string-name>
          ,
          <article-title>Bm25f in lucene with blendedtermquery</article-title>
          ,
          <year>2016</year>
          . URL: https: //opensourceconnections.com/blog/2016/10/19/bm25f-in-lucene/.
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>C.</given-names>
            <surname>Rafel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Matena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <article-title>Exploring the limits of transfer learning with a unified text-to-text transformer</article-title>
          ,
          <source>J. Mach. Learn. Res</source>
          .
          <volume>21</volume>
          (
          <year>2020</year>
          )
          <volume>140</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>140</lpage>
          :
          <fpage>67</fpage>
          . URL: http://jmlr.org/papers/v21/
          <fpage>20</fpage>
          -
          <lpage>074</lpage>
          .html.
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>R.</given-names>
            <surname>Campos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Mangaravite</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pasquali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Jorge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Nunes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jatowt</surname>
          </string-name>
          ,
          <article-title>Yake! collectionindependent automatic keyword extractor</article-title>
          , in: G. Pasi,
          <string-name>
            <given-names>B.</given-names>
            <surname>Piwowarski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Azzopardi</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Hanbury (Eds.),
          <source>Advances in Information Retrieval</source>
          , Springer International Publishing, Cham,
          <year>2018</year>
          , pp.
          <fpage>806</fpage>
          -
          <lpage>810</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>R.</given-names>
            <surname>Campos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Mangaravite</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pasquali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jorge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Nunes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jatowt</surname>
          </string-name>
          ,
          <article-title>Yake! keyword extraction from single documents using multiple local features</article-title>
          ,
          <source>Information Sciences 509</source>
          (
          <year>2020</year>
          )
          <fpage>257</fpage>
          -
          <lpage>289</lpage>
          . URL: https://www.sciencedirect.com/science/article/pii/ S0020025519308588. doi:https://doi.org/10.1016/j.ins.
          <year>2019</year>
          .
          <volume>09</volume>
          .013.
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>R.</given-names>
            <surname>Campos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Mangaravite</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pasquali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Jorge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Nunes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jatowt</surname>
          </string-name>
          ,
          <article-title>A text feature based automatic keyword extraction method for single documents</article-title>
          , in: G. Pasi,
          <string-name>
            <given-names>B.</given-names>
            <surname>Piwowarski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Azzopardi</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Hanbury (Eds.),
          <source>Advances in Information Retrieval</source>
          , Springer International Publishing, Cham,
          <year>2018</year>
          , pp.
          <fpage>684</fpage>
          -
          <lpage>691</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>