<!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>September</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.1145/3361719</article-id>
      <title-group>
        <article-title>Conference Paper Assignment Problem - A new System for Recommending and Assigning Reviewers to Scientific Articles</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ana Carolina Ribeiro</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>DEI/FEUP - Department of Informatics Engineering, Faculty of Engineering of the University of Porto</institution>
          ,
          <addr-line>R. Dr. Roberto Frias, 4200-465 Porto</addr-line>
          ,
          <country country="PT">Portugal</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>LIACC - Artificial Intelligence and Computer Science Laboratory</institution>
          ,
          <addr-line>R. Dr. Roberto Frias, 4200-465 Porto</addr-line>
          ,
          <country country="PT">Portugal</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <volume>20</volume>
      <issue>2022</issue>
      <fpage>0000</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>The recommendation and assignment of reviewers and articles is an emerging topic in the academic community and is known as the Reviewer Assignment Problem (RAP). This problem can be seen as a version of the well-known Generalized Assignment Problem (GAP), while the Conference Paper Assignment Problem (CPAP) is a specific case of RAP. The thesis proposal presented is centred on CPAP. The main objective of the doctoral thesis proposal is the development and validation of multi-information recommendation systems (extracting information from the content of articles and reviewers) capable of eficiently assigning expert reviewers to scientific articles submitted to a conference.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Reviewer Assignment Problem</kwd>
        <kwd>Conference Paper Assignment Problem</kwd>
        <kwd>Peer-Review System</kwd>
        <kwd>Recommendation System</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The recommendation and assignment of reviewers to articles, generally called in the literature
a Reviewer Assignment Problem (RAP), has become an essential topic in the academic world.
RAP can be seen as a version of the Generalized Assignment Problem (GAP), and Conference
Paper Assignment Problem (CPAP) is a specific case of RAP [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>In most cases, articles should be assigned to reviewers according to the following conditions:
(i) Each manuscript should be assigned to a certain number of reviewers, ai, defined by the
team responsible for assigning the reviewers; (ii) as far as possible, each article should be
assigned to reviewers who are experts in the field. A specific limit T can be defined to identify
the qualification of the reviewers; (iii) each reviewer should be assigned to, at most, a certain
number of articles, bj, defined by the team responsible for assigning the reviewers; (iv) each
reviewer should be assigned to approximately the same number of articles, to balance their
workload.</p>
      <p>Given a set  = {1, ..., | |} of manuscripts and a set  = {1, ..., ||} of reviewers, 
denote the matching degree of manuscript i for reviewer j, where i belongs a P and j belongs a R.
A binary variable  , whose value is 1 if manuscript i is assigned to reviewer j and 0 otherwise,
RAP is formulated by the Following Integer Programming formulation:</p>
      <p>Subject to
 :  ∑︁ ∑︁</p>
      <p>∈ ∈
∑︁  = .
∈
∑︁  ≤  .</p>
      <p>∈
 ∈
{︁⌊︁  ⌋︁}︁ .</p>
      <p>= 0, 1.</p>
      <p>The objective function (equation 1) maximizes the total matching degree of the assignment.
Constraints (equation 2) and (equation 3) ensure that conditions (i) and (ii) are satisfied,
respectively. Constraint (equation 4) along with (equation 5) prevent a reviewer from being assigned to
a manuscript whenever  is smaller than the given threshold T. Constraint (equation 6)instead
of (equation 4) is brought into the mathematical model to ensure that at least one reviewer
whose matching degree for manuscript i is greater than or equal to T.</p>
      <p>∈ {  } ≥ 
.</p>
      <p>
        The peer-review system is considered the main mechanism for quality control of scientific
publications [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], with the potential to contribute to the rigour of the work published in the
academic community [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The challenging task of the peer-review process is to recommend
and assign suitable reviewers whose interests and research profiles fit appropriately in the
submissions [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Often these tasks are still done manually by editors or conference organizers.
However, there are obvious flaws in the method of selecting and manually assigning reviewers
to articles. Firstly, this is a time-consuming process. The committee of conferences or journals
needs to retrieve databases from expert researchers and find the most suitable ones for each
submitted article.
      </p>
      <p>Second, it is common to recommend expert researchers in the same research area as the
article to be reviewed. However, there are many other indicators that should be considered
when selecting reviewers, for example, publications, research projects, and patents. Also, teams
that select reviewers use titles, rewards, and status to assess the quality of the experts. Third, the
process of manually selecting and assigning reviewers to articles ignores possible relationships
between reviewers and authors. Finally, since it is necessary to manage a large amount of
(1)
(2)
(3)
(4)
(5)
(6)
information about the reviewers and the articles submitted according to human and subjective
criteria, bias may occur in the recommendation and assignment of researchers.</p>
      <p>According to the problems presented above, there is a need to apply intelligent technologies
capable of analyzing data, extracting valuable information from documents and unstructured
texts, and thus automatically recommending and assigning the most appropriate researchers
to scientific articles. This doctoral study aims to solve the CPAP through the development of
a system capable of recommending the most appropriate and expert reviewers and eficiently
assigning them to scientific articles, according to the established constraints.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Motivations</title>
      <p>The development of automatic and eficient mechanisms for recommending experts has a high
economic value. These mechanisms allow the increase in productivity, which transposes into
ifnding experts in a valuable search time and increasing eficiency, ensuring the highest possible
level of correspondence between their profile and task.</p>
      <p>In the scientific world, these expert recommendation mechanisms provide the added value of
inferring and identifying research teams and working groups, especially between researchers
from diferent institutions; discovering emerging talents with low visibility; supporting students,
allowing them to identify the best supervisors and co-supervisors of master or doctoral degrees.</p>
      <p>Also, it is essential to keep the quality standard of science high. The review of scientific
articles in scientific conferences and journals, and scientific projects is one of the best-known
tasks for expert researchers. The recommendation and assignment of the most suitable experts
to the articles are based on human and subjective criteria, which can generate wrong decisions,
such as the rejection of excellent scientific work or a potentially successful project proposal.
These decisions can have significant and adverse efects on the quality of the scientific standard,
namely, the quality of published studies, researchers’ careers, and the reputation of conferences
and journals.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Objectives</title>
      <p>The present PhD study aims to develop a Recommendation System (RS) based on constraint
programming solvers applied to the CPAP case. A more detailed description of the objectives is
as follows:
1. Development of a data collection system capable of collecting relevant input information
from researchers who are candidates for reviewers and from scientific articles.
2. Development of an Information Extraction system combining deep neural networks and
advanced NLP techniques in extracting the semantic representation of scientific articles’
content and reviewers’ information gathered.
3. Development of an expert RS capable of extracting the expertise level of re-viewers and
ifnding the ranking of expert reviewers in a given research topic (s)/area(s).
4. Search, compare and select available open-source next-generation constraint
programming technology solvers and other recent optimization approaches to deliver the best
trade-of between eficiency and ease of integration and customization.
5. Integration of the constraint programming-based constraint-solving module in the
developed RS.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Research Questions</title>
      <p>According to the previous context, motivation and objectives, some research questions arise,
namely:
1. How can the CPAP be formulated as a constraint programming problem?
2. What is the efect of deep neural networks combined with natural language processing
techniques in extracting the semantic representation from the content of scientific articles?
3. Do CP solvers frameworks allow handling reviewers’ constraints in the context of
assigning articles more eficiently when compared to other current solving approaches?
4. Do CP solvers frameworks improve the balance between eficiency and ease of integration
and customization compared to diferent methods?</p>
    </sec>
    <sec id="sec-5">
      <title>5. Related Work</title>
      <p>RAP has two main phases – 1) finding/recommending expert reviewers and 2) assigning
reviewers to submitted manuscripts. These problems are diferent and therefore require diferent
approaches. In phase 1), the main objective is to compute the article-reviewer similarity factors
depending on the method (implicit or explicit) chosen to describe the articles and the
competencies of the reviewers. While in phase 2) the main objective is the efective assignment/allocation
of expert reviewers to scientific articles.</p>
      <p>
        According to the literature, diferent approaches can be applied in phase one, namely:
decision support systems [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] recommendation systems [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and machine learning-oriented
approaches [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], [10]. In phase two, we can find studies developed with optimization approaches
based on heuristics and meta-heuristics [11], [12], fuzzy approaches [13], answer set
programming [14], and others.
      </p>
      <p>
        Finding expert reviewers (phase 1) generally requires the development of relevant tasks such
as collecting data on the reviewers and, sometimes, on the authors of submitted articles; the
construction of the profiles of reviewers and articles submit-ted and, finally, the computation of
the similarity between reviewers and authors. The approaches based on DSSs and RSs have
several similarities in their processes. For example, the development of the reviewers’ profile
and articles submitted through specific measures (quality, relevance, authority, diversity, among
others) have been shown to achieve good results in recommending reviewers [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], [15]; The
information retrieval process is also common in the approaches, relevant and includes the
classification of publications, the author’s disambiguation (for example, rule-based algorithms,
clustering-based algorithms), the extraction of relevant information (for example, LDA algorithm,
Doc2Vec model, TF-IDF), among others; finally, in the similarity calculation between reviewers
and articles, the similarity of cosine ordered weighted averaging aggregation function and
Kullback-Leibler di-vergence are the most commonly used techniques and with better results.
      </p>
      <p>The problem of assigning/allocating reviewers to submitted articles (phase 2) presents several
types of approaches tested by researchers. The approaches based on heuristic and metaheuristic
algorithms have a strong presence in researchers’ studies [11], [16]. Also, greedy and genetic
algorithms are the best known and selected by researchers to try to solve the attribution problem.
Other approaches, such as the fuzzy approach [17], ASP [14] or integer linear programming,
also aroused the interest of researchers and showed good results.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Approach</title>
      <p>The defined approach proposes the construction of knowledge about the expertise of researchers
and the recommendation and assignment of the most appropriate expert reviewers for scientific
papers. The proposed system comprises four modules:
1. Data Collection Module – The main purpose of this module is to collect data from
multiple data sources (open databases and Web) to create a database with information
about researchers (afiliations, co-authors, citations, number of publications, awards,
among others) and scientific articles (metadata).
2. Information Extraction Module – The main objective of this module is to extract relevant
information from the data, transforming it into more significant representations of its
semantic content and, consequently, easier to analyse. This module combines advanced
NLP techniques and deep neural networks for the extraction of semantic and contextual
information from the collected data.
3. RS of Experts Module – This module focuses on the recommendation of reviewers’ experts
in a given research topic/area. The relevant information extracted in the previous module
allows the construction of reviewers’ profiles (based on quality, reputation, and expertise)
and scientific articles (based on metadata and key insights). Subsequently, the objectives
of RS are to extract the behavioural model of experts, compute the expertise level of each
reviewer and, finally, present the ranking of experts.
4. Assignment Module – In this module, the main objectives are the definition of the
constraints of the assignment of reviewers to scientific articles and the implementation of
a sophisticated optimization approach (constraint programming) to enforce the adequacy
of the recommended reviewers to the input constraints and requirements.</p>
    </sec>
    <sec id="sec-7">
      <title>7. Evaluation</title>
      <p>The system validation starts with the comparison of the results obtained in this study with
the results found in the literature of approaches used by other researchers to solve the RAP.
Furthermore, we intend to validate the system in a real environment, namely, at a scientific
conference. At this stage, we want to compare the results of the recommendation and attribution
of our system with the results of the conference system. In addition, we intend to assess the
satisfaction of reviewers through a survey.</p>
    </sec>
    <sec id="sec-8">
      <title>8. Contributions</title>
      <p>The main expected contributions of this PhD study are:
1. Development of an RS to be integrated into a constraint resolution module based on
sophisticated constraint programming and optimization approaches to handle constraints
more eficiently when compared to other current constraint resolution approaches.
2. Study the efect of using Deep Neural Networks in extracting semantic representation of
scientific papers’ content and researchers’ contents for the recommendation task.</p>
    </sec>
    <sec id="sec-9">
      <title>9. Acknowledgments</title>
      <p>This work was financially supported by: Base Funding -UIDB/00027/2020 of the Artificial
Intelligence and Computer Science Laboratory – LIACC - funded by national funds through
the FCT/MCTES (PIDDAC). The first author is supported by FCT (Portuguese Foundation for
Science and Technology) under grant PD/BD/2020.04698.BD.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Zhang,</surname>
          </string-name>
          <article-title>Reviewer assignment algorithms for peer review automation: A survey</article-title>
          ,
          <source>Information Processing &amp; Management</source>
          <volume>59</volume>
          (
          <year>2022</year>
          )
          <article-title>103028</article-title>
          . URL: https:// www.sciencedirect.com/science/article/pii/S0306457322001388. doi:https://doi.org/ 10.1016/j.ipm.
          <year>2022</year>
          .
          <volume>103028</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>L.</given-names>
            <surname>Bornmann</surname>
          </string-name>
          , Scientific peer review,
          <source>Annual Rev. Info. Sci &amp;amp; Technol</source>
          .
          <volume>45</volume>
          (
          <year>2011</year>
          )
          <fpage>197</fpage>
          -
          <lpage>245</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>R. H.</given-names>
            <surname>Fletcher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. W.</given-names>
            <surname>Fletcher</surname>
          </string-name>
          ,
          <article-title>4 : The efectiveness of journal peer review</article-title>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Goldsmith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. H.</given-names>
            <surname>Sloan</surname>
          </string-name>
          ,
          <article-title>The ai conference paper assignment problem</article-title>
          ,
          <source>in: AAAI Conference on Artificial Intelligence</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>D. T.</given-names>
            <surname>Hoang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. T.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Collins</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hwang</surname>
          </string-name>
          ,
          <article-title>Decision support system for solving reviewer assignment problem</article-title>
          ,
          <source>Cybernetics and Systems</source>
          <volume>52</volume>
          (
          <year>2021</year>
          )
          <fpage>379</fpage>
          -
          <lpage>397</lpage>
          . URL: https: //doi.org/10.1080/01969722.
          <year>2020</year>
          .
          <volume>1871227</volume>
          . doi:
          <volume>10</volume>
          .1080/01969722.
          <year>2020</year>
          .
          <volume>1871227</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <article-title>[6] A proactive decision support system for reviewer recommendation in academia</article-title>
          ,
          <source>Expert Systems with Applications</source>
          <volume>169</volume>
          (
          <year>2021</year>
          )
          <article-title>114331</article-title>
          . doi:https://doi.org/10.1016/j.eswa.
          <year>2020</year>
          .
          <volume>114331</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>C. K.</given-names>
            <surname>Kreutz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Schenkel</surname>
          </string-name>
          ,
          <article-title>Revaside: Assignment of suitable reviewer sets for publications from fixed candidate pools, iiWAS2021, Association for Computing Machinery</article-title>
          , New York, NY, USA,
          <year>2022</year>
          , p.
          <fpage>57</fpage>
          -
          <lpage>68</lpage>
          . URL: https://doi.org/10.1145/3487664.3487673. doi:
          <volume>10</volume>
          .1145/ 3487664.3487673.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <article-title>Beyond accuracy: A feature crossing method for chinese thesis reviewer recommendation</article-title>
          ,
          <source>in: 2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>1151</fpage>
          -
          <lpage>1158</lpage>
          . doi:
          <volume>10</volume>
          .1109/SMC52423.
          <year>2021</year>
          .
          <volume>9658668</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>L.</given-names>
            <surname>Cagliero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Garza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pasini</surname>
          </string-name>
          , E. Baralis,
          <article-title>Additional reviewer assignment by means of weighted association rules</article-title>
          ,
          <source>IEEE Transactions on Emerging Topics in Computing</source>
          <volume>9</volume>
          (
          <year>2021</year>
          )
          <fpage>329</fpage>
          -
          <lpage>341</lpage>
          . doi:
          <volume>10</volume>
          .1109/TETC.
          <year>2018</year>
          .
          <volume>2861214</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>