<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "http://jats.nlm.nih.gov/publishing/1.0/JATS-journalpublishing1.dtd">
<!--<?xml-stylesheet type="text/xsl" href="article.xsl"?>-->
<article article-type="research-article" dtd-version="1.0" xml:lang="en" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id journal-id-type="issn">1683-1470</journal-id>
<journal-title-group>
<journal-title>Data Science Journal</journal-title>
</journal-title-group>
<issn pub-type="epub">1683-1470</issn>
<publisher>
<publisher-name>Ubiquity Press</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.5334/dsj-2015-016</article-id>
<article-categories>
<subj-group>
<subject>Proceedings paper</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>How to Choose Appropriate Experts for Peer Review: An Intelligent Recommendation Method in a Big Data Context</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Liu</surname>
<given-names>Duanduan</given-names>
</name>
<email>lduanduan@163.com</email>
<xref ref-type="aff" rid="aff-1"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Xu</surname>
<given-names>Wei</given-names>
</name>
<email>weixu@ruc.edu.cn</email>
<xref ref-type="aff" rid="aff-1"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Du</surname>
<given-names>Wei</given-names>
</name>
<email>duwei_0127@163.com</email>
<xref ref-type="aff" rid="aff-1"/>
<xref ref-type="aff" rid="aff-2"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Wang</surname>
<given-names>Fuyin</given-names>
</name>
<email>wangfuyin@ruc.edu.cn</email>
<xref ref-type="aff" rid="aff-1"/>
</contrib>
</contrib-group>
<aff id="aff-1">School of Information, Renmin University of China, Beijing, 100872, China</aff>
<aff id="aff-2">Department of Information Systems, City University of Hong Kong, Kowloon, China</aff>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2015-05-22">
<day>22</day>
<month>05</month>
<year>2015</year>
</pub-date>
<volume>14</volume>
<elocation-id>16</elocation-id>
<permissions>
<copyright-statement>Copyright: &#x00A9; 2015 The Author(s)</copyright-statement>
<copyright-year>2015</copyright-year>
<license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/3.0/">
<license-p>This is an open-access article distributed under the terms of the Creative Commons Attribution 3.0 Unported License (CC-BY 3.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. See <uri xlink:href="http://creativecommons.org/licenses/by/3.0/">http://creativecommons.org/licenses/by/3.0/</uri>.</license-p>
</license>
</permissions>
<self-uri xlink:href="http://www.datascience.codata.org/article/view/dsj-2015-016/"/>
<abstract>
<p>The rapid development of the internet has led to the accumulation of massive amounts of data, and thus we find ourselves entering the age of big data. Obtaining useful information from these big data is a crucial issue. The aim of this article is to solve the problem of recommending experts to provide peer reviews for universities and other scientific research institutions. Our proposed recommendation method has two stages. An information filtering method is first offered to identify proper experts as a candidate set. Then, an aggregation model with various constraints is suggested to recommend appropriate experts for each applicant. The proposed method has been implemented in an online research community, and the results exhibit that the proposed method is more effective than existing ones.</p>
</abstract>
<kwd-group>
<kwd>Experts recommendation</kwd>
<kwd>Text mining</kwd>
<kwd>Integration model</kwd>
<kwd>Big data analysis</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec>
<title>1 Introduction</title>
<p>Talent introduction is very important in the construction of a university faculty; the quality of the talent reflects the academic level of a university as well as, to some extent, its comprehensive strength. Therefore, universities must take effective measures to strictly control the quality of applicants in the process of their talent introduction. In general, universities use peer review to evaluate applicants. That is, they select a certain number of experts, usually three to five, who have similar research areas as the applicant to review their application documents. In this process, the choice of reviewers has a great impact on the assessment of applicants because appropriate reviewers will help universities to select excellent talent. On the other hand, unsuitable reviewers might result in the loss of talent. Therefore, choosing appropriate reviewers becomes a key step in finding the best talent for an institution.</p>
<p>Currently, the most widely used expert selection method is manual. In this process, a university staff first collects applicants&#8217; application documents and personal information and identifies applicants&#8217; features. Then they retrieve a database of experts with high professional levels and try to find those with research areas similar to that of the applicants. Next, they send invitations to the selected experts by phone or e-mail. Finally, they determine whether the applicant is employable or not according to the expert reviewers&#8217; opinions. At present, most colleges and universities use this method to select reviewers. There is no doubt that this is an effective way to select reviewers. However, there are obvious defects in the manual selection method. First, this selection method is time-consuming. The staff needs to retrieve expert databases and find suitable experts with similar research areas. From the list of experts, three to five names are chosen. This consumes a lot of energy and time. In particular, when the number of experts in the expert database is very large, this defect is more obvious. Furthermore, an amount of manpower and resources is needed to maintain and improve the expert database. Second, manual selection has a certain one-sidedness. For example, a staff always searches for relevant experts in terms of the discipline codes provided by the applicant and the experts although only using discipline codes to reflect research areas is not comprehensive. There is much other content that can reflect research areas, such as publications, research projects, and so on. In addition, staffs use title, rewards, and status to weigh the quality of the experts. These indicators only represent a part of their quality, and this method still needs a more comprehensive evaluation standard for the experts&#8217; productivity. Third, in the process of manual expert selection, it is difficult to avoid subjectivity both in the retrieval process and in the weighing process. The manual method also ignores the possible relationships between experts and applicants. For example, if the expert and the applicant have any cooperative relations or other relationships, the expert will not be suitable for reviewing the applicant.</p>
<p>In order to solve the above problems, we propose an intelligent recommendation method to recommend appropriate experts for peer review and developed a recommendation system to realize it. The proposed method has two stages in the recommendation process. In the first stage, we collected as much information as possible about experts and applicants. We obtained most of the information about the experts from an expert database provided by the university and also extracted useful information from research social network websites and the experts&#8217; personal home pages. We obtained information about the applicants from their personal information (e.g., discipline codes, work experience, graduate school) and application documents (e.g., publications, research projects, patents). Then we created an expert profile and an applicant profile representing all their characteristics by using an information filtering method. In the second stage, we designed a recommendation model to recommend appropriate reviewers for each applicant. The recommendation model contains three modules: the relevance module, the connectivity module, and the quality module. An aggregation model was constructed to integrate these modules. Through these two stages, the most suitable list of experts was recommended for each applicant. The proposed recommendation system has been implemented, and a real survey has been taken to verify the effectiveness of the proposed intelligent recommendation method.</p>
<p>The reminder of this article is as follows. Section 2 reviews the related literature on expert recommendation. Section 3 introduces the proposed recommendation method. In Section 4, we implement the recommendation system and verify the results. In Section 5, we conclude the article and indicate future work.</p>
</sec>
<sec>
<title>2 Literature Review</title>
<p>The rapid development of the internet has led to the accumulation of massive amounts of data, and thus we find ourselves entering the age of big data. Meanwhile, we are faced with vast and diverse data from which to find useful information and about which to make good decisions. Obviously, this is a difficult task because of information overload (<xref ref-type="bibr" rid="B1">Aljukhadar, Senecal, &amp; Daoust, 2012</xref>) and information asymmetry (<xref ref-type="bibr" rid="B5">Chen, Liao, Kuo, &amp; Hsieh, 2013</xref>). Therefore, we need an intelligent method to help us deal with these large amounts of data and obtain worthy information. The recommendation service that arises at this historic moment solves this thorny problem. At present, this recommendation service has been applied to various situations, such as finding experts, job recommendations, restaurant searches, route recommendations, and so on. As information technology has become increasingly complete, the recommendation system has become better and better and can be used for more and more functions.</p>
<p>Expert recommendation has been researched widely and deeply by many researchers. Expert recommendation is the task that identifies appropriate experts with profound knowledge and rich experience in a specified expertise area to help users cope with problems. Expert recommendation has many purposes, such as finding experts for consulting (<xref ref-type="bibr" rid="B2">Balog, Azzopardi, &amp; Rijke, 2009</xref>; <xref ref-type="bibr" rid="B8">Fang &amp; Zhai, 2007</xref>), for reviewing research projects (<xref ref-type="bibr" rid="B15">Silva, Guo, Ma, Jiang, &amp; Chen, 2013</xref>), for collaboration (<xref ref-type="bibr" rid="B17">Wang &amp; Blei, 2011</xref>), and so on.</p>
<p>Many research approaches have been proposed for expert recommendation service. Balog el al. (<xref ref-type="bibr" rid="B2">2009</xref>) suggested a language model to seek suitable experts to help users solve problems. Cao, Liu, Bao, &amp; Li (<xref ref-type="bibr" rid="B4">2005</xref>) built a two-stage language model for expert search. Daud, Li, Zhou, &amp; Muhammad (<xref ref-type="bibr" rid="B6">2010</xref>) proposed a time topic model to find experts related to a specific expertise area. Deng, King, &amp; Lyu (<xref ref-type="bibr" rid="B7">2008</xref>) integrated a statistical language model, topic-based model, and hybrid model to achieve better performance in expert ranking. Li, Liu, &amp; Li (<xref ref-type="bibr" rid="B10">2011</xref>) used a fuzzy linguistic method and fuzzy text classification to assist users solving tacit knowledge problems. Fang et al. (<xref ref-type="bibr" rid="B8">2007</xref>) presented a general probabilistic model to solve the expert finding problem. Macdonald &amp; Ounis (<xref ref-type="bibr" rid="B13">2008</xref>) saw the problem of finding experts as a voting problem and proposed a voting model for expert finding. Wang, Jiao, Abrahams, Fan, &amp; Zhang (<xref ref-type="bibr" rid="B18">2013</xref>) proposed a novel algorithm, ExpertRank, which considers document-based relevance and one&#8217;s authority to find experts. Yukawa, Kasahara, Kato, &amp; Kita (<xref ref-type="bibr" rid="B20">2001</xref>) found appropriate experts with a content-based method. Balog &amp; Rijke (<xref ref-type="bibr" rid="B3">2007</xref>) introduced expert profiling and applied it to expert finding. With the emergence of social networks, more and more researchers have begun to add social network analysis to the recommendation studies. Silva et al. (<xref ref-type="bibr" rid="B15">2013</xref>) took social network analysis into consideration for project selection. Xu, Sun, Ma, &amp; Du (<xref ref-type="bibr" rid="B19">2013</xref>) built a connectivity analysis module based on social networking for recommending R&amp;D project opportunities. Liu, Chen, Kao, &amp; Wang (<xref ref-type="bibr" rid="B12">2013</xref>) used link analysis for expert finding in question-answering websites. Fazel-Zarandi, Devlin, Huang, &amp; Contractor (<xref ref-type="bibr" rid="B9">2011</xref>) presented an expert recommendation system using social network analysis. From the above studies, we can see that there are two major types of research methods in expert recommendation service: content-based methods and network-based methods. Content-based methods use text mining technology to find similarities between two targets. There are two types of content-based methods. One is a profile-based method. For example, some researchers have created an expert profile that represents the characteristics of the expert (e.g., area of expertise) to model the expert&#8217;s expertise and calculate the similarity between the expert&#8217;s and the applicant&#8217;s expertise areas. Then they generate an expert ranking according to relevant scores using certain matching algorithms (<xref ref-type="bibr" rid="B10">Li et al., 2011</xref>; <xref ref-type="bibr" rid="B3">Balog et al., 2007</xref>; <xref ref-type="bibr" rid="B12">Liu et al., 2013</xref>; <xref ref-type="bibr" rid="B14">Moreira &amp; Wichert, 2013</xref>). The other type is a document-based method that ranks documents first in the corpus given an expertise area (<xref ref-type="bibr" rid="B18">Wang et al., 2013</xref>). A network-based method makes use of relationships among experts and users to build networks, such as a citation network, collaboration network, and other relationship networks. In real life, individuals usually interact with each other and form various social networks, and analysing these social networks can enhance the recommendation. Furthermore, some researchers use a hybrid method combining a content-based method and a network-based method to achieve better performance (<xref ref-type="bibr" rid="B15">Silva et al., 2013</xref>; <xref ref-type="bibr" rid="B19">Xu et al., 2013</xref>).</p>
<p>Although these methods have various advantages, they still have problems, such as scalability and efficiency in the context of big data where massive amounts of information are involved. Therefore, we employed big data analysis tools to deal with these problems. Furthermore, from the existing literature, we found that most expert recommendation is limited to finding experts in a given expertise area, and there are few studies about recommending experts for individuals. In other words, existing research lacks personalized consideration. In fact, there are many differences among people apart from areas of expertise, such as educational background, social relationships, and so on. There are many discussions in the field of electronic commerce about personalized recommendations, which deal with recommending goods for individuals according to personal preference. However, in the field of expert recommendation, there is still a lot of room for improvement. Certainly, some researchers have noticed this. For example, Fazel-Zarandi et al. (<xref ref-type="bibr" rid="B9">2011</xref>) took users&#8217; motivations into consideration when they built profiles for finding experts. Liu et al. (<xref ref-type="bibr" rid="B12">2013</xref>) considered user authority and reputation in recommending experts. Nevertheless, personalized analysis is still insufficient in the field of expert recommendation.</p>
<p>To solve the problems discussed above, we proposed an intelligent recommendation method to recommend appropriate experts for peer review in the context of big data. The proposed method aims at recommending suitable experts for individuals, with the characteristics of each individual having a great impact on the recommendation results. In our research, we designed an expert recommendation model that considers personalities and includes relevance analysis, connectivity analysis, and quality analysis for expert recommendation.</p>
</sec>
<sec>
<title>3 The Proposed Method</title>
<p>In this paper, we propose an intelligent expert recommendation method and construct a recommendation research framework with two main stages. The first stage includes data collection and profiling, and the second stage contains an expert recommendation framework employing relevance analysis, connectivity analysis, and quality analysis to build a more comprehensive model for expert recommendation. The process and structure of the proposed research framework are shown in Figure <xref ref-type="fig" rid="F1">1</xref>.</p>
<fig id="F1">
<label>Figure 1</label>
<caption>
<p>Architecture of our expert recommendation research framework.</p>
</caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="figures/Fig01_web.jpg"/>
</fig>
<p>In Figure <xref ref-type="fig" rid="F1">1</xref> we can see the process of expert recommendation for each applicant. The proposed research framework has two stages to recommend reviewers for an applicant. In the first stage, we collect the applicant&#8217;s information and the experts&#8217; information by various channels. The applicants fill in their personal information (e.g., expertise area, educational background, work experience) and submit their application documents (e.g., publications, research projects, patents) while the expert information is collected from an expert database provided by universities and from research social network websites. Then, we build expert profiles and an applicant profile using the collected information. In the second stage, we construct a comprehensive expert recommendation model from three aspects: quality, relevance, and connectivity. Finally, we build an aggregation model with various constraints integrating these three indicators. We use the proposed aggregation model to rank all experts and recommend top key experts for each applicant.</p>
<sec>
<title>3.1 Data collection and profiling</title>
<p>In this research, we collected two types of data: expert data and applicant data. For expert data, we used information from an expert database provided by the university. Obviously, just the expert database is not enough for our research because the database needs to be updated in real-time and most universities lack this maintenance work. A recommendation service needs a huge amount of data to get the most accurate results. Thus, we also extracted useful information from research social network websites and personal homepages. With the popularity of social networks, we are able to obtain a great deal of information from them that will make up for the inadequacy of our expert database. Through these channels, we tried to obtain useful information about the experts&#8217; areas of expertise and academic achievements, such as publications, research projects, rewards, titles, and so on. The applicants filled in their personal information (e.g., research area, educational background, work experience) and submitted their application documents (e.g., publications, research projects) by the proposed recommendation system.</p>
<p>After gathering the above information, we built an expert profile and an applicant profile that used relevant information and key attributes to extract areas of expertise. Obviously, the quality of profiling has a great impact on the effectiveness of the expert recommendation. In the expert recommendation context, we focused on how to gather necessary information to build more comprehensive profiles. Vivacqua, Oliveira, and Souza (<xref ref-type="bibr" rid="B16">2009</xref>) stated that profiles can be built from declaration and inference methods that reflect subjective and objective information. In this article, we constructed expert and applicant profiles from both subjective and objective perspectives. In the applicant profile, subjective information refers to those structure keywords that are filled in by the applicant. The objective information can be extracted from submitted application documents, such as publications and research projects that represent the applicant&#8217;s expertise. In the expert profile, subjective information refers to those structure keywords that are self-identified by the expert. The objective information also can be obtained from academic achievements, such as publication and research projects. Furthermore, the objective information can also reflect relationships between experts and applicants through co-authored papers or collaborative research projects. Also, the level of publications and research projects represent the expert&#8217;s expertise level. Therefore, in this research, we collected all the above information and constructed relevant matrices for subsequent model analysis. For example, the keyword-document matrix can be used for a relevance analysis model, the expert-applicant matrix can be used for a connectivity analysis model, and the publication-journal matrix and project-type matrix can be used for a quality analysis model.</p>
</sec>
<sec>
<title>3.2 Expert recommendation framework</title>
<p>The core of this research is the proposed expert recommendation model. After collecting relevant information and profiling, we used the proposed model to deal with the above data and generate a ranking score of experts. Then, experts with high scores were recommended for the applicant. The proposed expert recommendation model has three modules: a relevance analysis model, connectivity analysis model, and quality analysis model. The components of our expert recommendation model are shown in Figure <xref ref-type="fig" rid="F2">2</xref>.</p>
<fig id="F2">
<label>Figure 2</label>
<caption>
<p>The component of our expert recommendation model.</p>
</caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="figures/Fig02_web.jpg"/>
</fig>
<p>As is shown in Figure <xref ref-type="fig" rid="F2">2</xref>, our expert recommendation model deals with expert profiles and applicant profiles in three ways. First, a relevance analysis model is used for measuring the similarity between the experts&#8217; expertise and the applicant&#8217;s expertise and for selecting relevant experts as candidate reviewers. Second, a quality analysis model is used for evaluating the experts&#8217; expertise. Third, a connectivity analysis model excludes those experts who have relationships with the applicant to ensure the fairness of the peer review. In general, the experts remaining after the above two processes can review the applicant, but in fact, the number of candidate reviewers is very large, and therefore, we need to use quality analysis to rank the experts. Finally, an aggregation model integrates these three aspects and tries to find more suitable experts to review the applicant.</p>
<sec>
<title>3.2.1 Relevance analysis model</title>
<p>The relevance analysis model is used for calculating the similarity between expert and applicant. When searching for an expert to be a reviewer to review an applicant, we first need to consider the similarity between the two targets. In this research, we focus on the similarity of areas of expertise. An expert&#8217;s relevance can be divided into two parts: subjective and objective.</p>
<p>Subjective relevance can be measured by a list of structure keywords that are self-identified by experts and applicants. We obtained these standard terms from the expert database and the applicant&#8217;s submission, and constructed two sets to represent the subjective information of expert and applicant.</p>
<p>
<disp-formula id="FD1">
<label>1</label>
<alternatives>
<mml:math id="Eq001-mml">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo><mml:mo>&#x007B;</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>5</mml:mn>
</mml:msub>
<mml:mo>&#x007D;</mml:mo>
</mml:mrow>
</mml:math>
<tex-math id="M1">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  {S_i} = \{ ke{y_1},ke{y_2}, \ldots ,ke{y_5}\}
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e001.gif"/>
</alternatives>
</disp-formula>
</p>
<p>
<disp-formula id="FD2">
<label>2</label>
<alternatives>
<mml:math id="Eq002-mml">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo><mml:mo>&#x007B;</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>5</mml:mn>
</mml:msub>
<mml:mo>&#x007D;</mml:mo>
</mml:mrow>
</mml:math>
<tex-math id="M2">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  {S_j} = \{ ke{y_1},ke{y_2}, \ldots ,ke{y_5}\}
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e002.gif"/>
</alternatives>
</disp-formula>
</p>
<p>where <italic>S<sub>i</sub></italic> denotes the self-identified expertise area set of expert <italic>i</italic> and <italic>S<sub>j</sub></italic> denotes the self-identified research area of applicant <italic>j</italic>. We selected Jaccard similarity (<xref ref-type="bibr" rid="B15">Silva et al., 2013</xref>) to measure the similarity between expert <italic>i</italic> and applicant <italic>j</italic>:</p>
<p>
<disp-formula id="FD3">
<label>3</label>
<alternatives>
<mml:math id="Eq003-mml">
<mml:mrow>
<mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:msub>
<mml:mi>m</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>f</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mfrac>
<mml:mrow>
<mml:mo>&#x0023;</mml:mo><mml:mo>&#x007C;</mml:mo><mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2229;</mml:mo><mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>&#x007C;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x0023;</mml:mo><mml:mo>&#x007C;</mml:mo><mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x222A;</mml:mo><mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>&#x007C;</mml:mo>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<tex-math id="M3">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  Si{m_{ij}}(self) = \frac{{\# |{S_i} \cap {S_j}|}}{{\# |{S_i} \cup {S_j}|}}
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e003.gif"/>
</alternatives>
</disp-formula>
</p>
<p>where #|&#8226;| denotes the number of keywords in each set.</p>
<p>Objective relevance can be measured by the academic achievements of expert and applicant. In this research, we focus on relevance of publications and research projects, which can, to some extent, reveal research areas. The main content of a document, publication, or research project can be represented by a list of keywords and corresponding weights. Traditionally, many calculation methods have used the frequency of the keyword to represent its weight. However, in our research, this weight calculation method is not comprehensive. Unlike a paper or a research project that generally involves only one research area, a person may have different research areas at different times. Our method reflects that papers published at different times may have different themes. Obviously, recently published papers reflect the person&#8217;s recent research area. Therefore, we took the time factor into consideration when we calculated the weight of keywords, the smaller the time interval between publication and the present, the greater the weight. We used a list of keywords and relevant weights to represent a publication as follows:</p>
<p>
<disp-formula id="FD4">
<label>4</label>
<alternatives>
<mml:math id="Eq004-mml">
<mml:mrow>
<mml:mi>P</mml:mi><mml:mi>u</mml:mi><mml:msub>
<mml:mi>b</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo><mml:mo>&#x007B;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>&#x007D;</mml:mo>
</mml:mrow>
</mml:math>
<tex-math id="M4">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  Pu{b_k} = \{ (ke{y_1},{f_{1,k}}),(ke{y_2},{f_{2,k}}), \ldots ,(ke{y_m},{f_{m,k}}), \ldots \}
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e004.gif"/>
</alternatives>
</disp-formula>
</p>
<p>where <italic>Pub<sub>k</sub></italic> denotes publication k and <italic>f<sub>m,k</sub></italic> denotes the frequency of <italic>key<sub>m</sub></italic> in publication k. Then all publications are represented as follows:</p>
<p>
<disp-formula id="FD5">
<label>5</label>
<alternatives>
<mml:math id="Eq005-mml">
<mml:mrow>
<mml:mtext>Pub</mml:mtext><mml:mo>=</mml:mo><mml:mo>&#x007B;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>w</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>&#x007D;</mml:mo>
</mml:mrow>
</mml:math>
<tex-math id="M5">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  {\rm{Pub}} = \{ (ke{y_1},{w_1}),(ke{y_2},{w_2}), \ldots ,(ke{y_m},{w_m}), \ldots \}
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e005.gif"/>
</alternatives>
</disp-formula>
</p>
<p>
<disp-formula id="FD6">
<label>6</label>
<alternatives>
<mml:math id="Eq006-mml">
<mml:mrow>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo><mml:mstyle displaystyle='true'>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>K</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x00D7;</mml:mo><mml:msub>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
<tex-math id="M6">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  {w_m} = \sum\limits_{k = 1}^K {\frac{1}{{{t_k}}} \times {f_{m,k}}}
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e006.gif"/>
</alternatives>
</disp-formula>
</p>
<p>where <italic>w<sub>m</sub></italic> denotes the weight of <italic>key<sub>m</sub></italic> in all publications and <italic>t<sub>k</sub></italic> denotes the time interval between the published time of publication k and current time.</p>
<p>We used the same approach to deal with research projects. We constructed a publication vector and a research project vector for each expert and applicant as follows:</p>
<p>
<disp-formula id="FD7">
<label>7</label>
<alternatives>
<mml:math id="Eq007-mml">
<mml:mrow>
<mml:mi>V</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>&#x2329;</mml:mo> <mml:mrow>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>w</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo>
</mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow>
</mml:mrow>
</mml:math>
<tex-math id="M7">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  Ve{c_i}(pub) = \left\langle {(ke{y_1},{w_1}),(ke{y_2},{w_2}), \ldots ,(ke{y_m},{w_m}), \ldots } \right\rangle
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e007.gif"/>
</alternatives>
</disp-formula>
</p>
<p>
<disp-formula id="FD8">
<label>8</label>
<alternatives>
<mml:math id="Eq008-mml">
<mml:mrow>
<mml:mi>V</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>&#x2329;</mml:mo> <mml:mrow>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>w</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo>
</mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow>
</mml:mrow>
</mml:math>
<tex-math id="M8">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  Ve{c_i}(pro) = \left\langle {(ke{y_1},{w_1}),(ke{y_2},{w_2}), \ldots ,(ke{y_m},{w_m}), \ldots } \right\rangle
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e008.gif"/>
</alternatives>
</disp-formula>
</p>
<p>
<disp-formula id="FD9">
<label>9</label>
<alternatives>
<mml:math id="Eq009-mml">
<mml:mrow>
<mml:mi>V</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>&#x2329;</mml:mo> <mml:mrow>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>w</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo>
</mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow>
</mml:mrow>
</mml:math>
<tex-math id="M9">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  Ve{c_j}(pub) = \left\langle {(ke{y_1},{w_1}),(ke{y_2},{w_2}), \ldots ,(ke{y_m},{w_m}), \ldots } \right\rangle
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e009.gif"/>
</alternatives>
</disp-formula>
</p>
<p>
<disp-formula id="FD10">
<label>10</label>
<alternatives>
<mml:math id="Eq010-mml">
<mml:mrow>
<mml:mi>V</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>&#x2329;</mml:mo> <mml:mrow>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>w</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo><mml:msub>
<mml:mi>w</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo>
</mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow>
</mml:mrow>
</mml:math>
<tex-math id="M10">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  Ve{c_j}(pro) = \left\langle {(ke{y_1},{w_1}),(ke{y_2},{w_2}), \ldots ,(ke{y_m},{w_m}), \ldots } \right\rangle
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e010.gif"/>
</alternatives>
</disp-formula>
</p>
<p>where <italic>Vec<sub>i</sub></italic>(<italic>pub</italic>) and <italic>Vec<sub>i</sub></italic>(<italic>pro</italic>) denote the publication and research vectors of expert <italic>i. Vec<sub>j</sub></italic>(<italic>pub</italic>) and <italic>Vec<sub>j</sub></italic>(<italic>pro</italic>) denote the publication and research vectors of applicant <italic>j. w<sub>m</sub></italic> denotes the weight of <italic>key<sub>m</sub></italic> in a publication or research project. Then, we used the cosine similarity to measure the similarity between expert <italic>i</italic> and applicant <italic>j</italic>.</p><p>
<disp-formula id="FD11">
<label>11</label>
<alternatives>
<mml:math id="Eq011-mml">
<mml:mrow>
<mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:msub>
<mml:mi>m</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mfrac>
<mml:mrow>
<mml:mi>V</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mi>V</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mo stretchy='false'>)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2225;</mml:mo><mml:mi>V</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2225;</mml:mo><mml:mrow><mml:mo>&#x2016;</mml:mo><mml:mrow>
<mml:mi>V</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mo stretchy='false'>)</mml:mo>
</mml:mrow><mml:mo>&#x02016;</mml:mo></mml:mrow>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<tex-math id="M11">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  Si{m_{ij}}(pub) = \frac{{Ve{c_i}(pub) \cdot Ve{c_j}(pub)}}{{\parallel Ve{c_i}(pub)\parallel \left\| {Ve{c_j}(pub)} \right\|}}
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e011.gif"/>
</alternatives>
</disp-formula>
</p>
<p>
<disp-formula id="FD12">
<label>12</label>
<alternatives>
<mml:math id="Eq012-mml">
<mml:mrow>
<mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:msub>
<mml:mi>m</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mfrac>
<mml:mrow>
<mml:mi>V</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mi>V</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2225;</mml:mo><mml:mi>V</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2225;</mml:mo><mml:mrow><mml:mo>&#x2016;</mml:mo><mml:mrow>
<mml:mi>V</mml:mi><mml:mi>e</mml:mi><mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo>
</mml:mrow><mml:mo>&#x02016;</mml:mo></mml:mrow>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<tex-math id="M12">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  Si{m_{ij}}(pro) = \frac{{Ve{c_i}(pro) \cdot Ve{c_j}(pro)}}{{\parallel Ve{c_i}(pro)\parallel \left\| {Ve{c_j}(pro)} \right\|}}
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e012.gif"/>
</alternatives>
</disp-formula>
</p>
<p>where <italic>Sim<sub>ij</sub></italic>(<italic>pub</italic>) denotes the publication similarity between expert <italic>i</italic> and applicant <italic>j</italic> and <italic>Sim<sub>ij</sub></italic>(<italic>pro</italic>) denotes the research similarity between expert <italic>i</italic> and applicant <italic>j</italic>.</p>
<p>Finally, we integrated the subjective relevance and objective relevance and generated an integrated relevance <italic>R<sub>ij</sub></italic> that reflects the similarity between expert i and applicant j.</p>
<p>
<disp-formula id="FD13">
<label>13</label>
<alternatives>
<mml:math id="Eq013-mml">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:msub>
<mml:mi>m</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>f</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:msub>
<mml:mi>m</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:msub>
<mml:mi>m</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo>
</mml:mrow>
</mml:math>
<tex-math id="M13">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  {R_{ij}} = \alpha Si{m_{ij}}(self) + \beta Si{m_{ij}}(pub) + \gamma Si{m_{ij}}(pro)
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e013.gif"/>
</alternatives>
</disp-formula>
</p>
<p>where <italic>&#945;</italic> + <italic>&#946;</italic> + <italic>&#947;</italic> = 1.</p>
</sec>
<sec>
<title>3.2.2 Quality analysis model</title>
<p>The quality analysis model was used for evaluating the experts&#8217; level of expertise. Obviously, experts with higher professional levels are more suitable to review applicants. In this research, we used publications and research projects to evaluate the quality of the experts. We selected three aspects, quantity, quality, and time interval, to calculate the performance of experts on the publication level. The quantity of publications reflects the experts&#8217; contributions in a certain field. Quality contains two factors: citations and the level of the publication&#8217;s journal. In general, impact factor is a commonly used evaluation index for journals. However, in some special fields, although the impact factors are not high, the quality of the journal in this field is high. Thus we use the ratio of the journal impact factor for the greatest impact factor in its field (<xref ref-type="bibr" rid="B11">Li &amp; Watanabe, 2013</xref>). The time interval is the time difference between published time and current time, and it reflects the experts&#8217; activity during this time. Quantity and quality are benefit attributes, and the time interval is a cost attribute. We calculated the performance of experts in publication levels as follows:</p>
<p>
<disp-formula id="FD14">
<label>14</label>
<alternatives>
<mml:math id="Eq014-mml">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle='true'>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>K</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:mo stretchy='false'>(</mml:mo><mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mfrac>
<mml:mrow>
<mml:mi>i</mml:mi><mml:msub>
<mml:mi>f</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi><mml:msub>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mi>max</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mstyle><mml:mo>&#x00D7;</mml:mo><mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<tex-math id="M14">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  {Q_j}(pub) = \sum\limits_{k = 1}^K {({C_k} + 1) \times \frac{{i{f_k}}}{{i{f_{\max }}}}}  \times \frac{1}{{{t_k}}}
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e014.gif"/>
</alternatives>
</disp-formula>
</p>
<p>where <italic>Q<sub>j</sub></italic>(<italic>pub</italic>) denotes the publication quality of expert j. <italic>C<sub>k</sub></italic> denotes the citations of publication k. <italic>if<sub>k</sub></italic> represents the impact factor of the journal publishing publication k, and <italic>if<sub>max</sub></italic> denotes the greatest impact factor of the journal in its field. <italic>t<sub>k</sub></italic> denotes the time interval between the published time and current time. K denotes the quantity of all publication of expert j.</p>
<p>For our research project, we used the project level to reflect the quality of the research project. In general, a research project can be classified into four levels: national (N), ministry (M), provincial (P), and local city (C). Obviously, the national level is better than the others. We defined the research project quality as follows:</p>
<p>
<disp-formula id="FD15">
<label>15</label>
<alternatives>
<mml:math id="Eq015-mml">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle='true'>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn>
</mml:mrow>
<mml:mn>4</mml:mn>
</mml:munderover>
<mml:mrow>
<mml:msubsup>
<mml:mi>w</mml:mi>
<mml:mi>k</mml:mi>
<mml:mi>p</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mstyle><mml:mo>&#x22C5;</mml:mo><mml:msubsup>
<mml:mi>q</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>p</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
<tex-math id="M15">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  {Q_j}(pro) = \sum\limits_{k = 1}^4 {w_k^p}  \cdot q_{kj}^p
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e015.gif"/>
</alternatives>
</disp-formula>
</p>
<p>where <italic>Q<sub>j</sub></italic>(<italic>pro</italic>) denotes the research project quality of expert j. <italic>w<sub>k</sub><sup>p</sup></italic> represents the project level weight. <italic>q<sup>p</sup><sub>kj</sub></italic> represents the quantity of research projects expert j participated in with level <italic>w<sub>k</sub><sup>p</sup></italic> in the past five years.</p>
<p>Finally, we obtained an integrated quality <italic>Q<sub>j</sub></italic> of expert j as follows:</p>
<p>
<disp-formula id="FD16">
<label>16</label>
<alternatives>
<mml:math id="Eq016-mml">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo stretchy='false'>(</mml:mo><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mo stretchy='false'>)</mml:mo>
</mml:mrow>
</mml:math>
<tex-math id="M16">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  {Q_j} = \mu {Q_j}(pub) + (1 - \mu ){Q_j}(pro)
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e016.gif"/>
</alternatives>
</disp-formula>
</p>
</sec>
<sec>
<title>3.2.3 Connectivity analysis model</title>
<p>Researchers form relationships by collaborating with each other, especially in similar areas of expertise where more collaboration opportunities exist than other situations. Obviously, if an expert has a collaborative relationship with an applicant, he or she is not suitable to review the applicant because of a conflict of interest. Therefore, when we are selecting appropriate experts as reviewers, we should exclude experts with conflicts of interest to ensure fairness of the review. In this research, a connectivity analysis model was used for excluding conflicts of interest, and we focused on co-authoring relationships in publications and collaboration in research projects.</p>
<p>To solve the conflict of interest problem, we constructed two matrices: a publication-level matrix and a project-level matrix. We assume that there are m experts and n applicants and thus will get two m &#215; n matrices:</p>
<p>
<disp-formula id="FD17">
<label>17</label>
<alternatives>
<mml:math id="Eq017-mml">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mrow>
<mml:mi>p</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo> <mml:mtable columnalign='left'>
<mml:mtr>
<mml:mtd>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mn>11</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mn>12</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mtext>&#x00A0;&#x00A0;</mml:mtext><mml:mo>&#x2026;</mml:mo><mml:mtext>&#x00A0;&#x00A0;</mml:mtext><mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn><mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mn>21</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mn>22</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mtext>&#x00A0;&#x00A0;</mml:mtext><mml:mo>&#x2026;</mml:mo><mml:mtext>&#x00A0;&#x00A0;</mml:mtext><mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mn>2</mml:mn><mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mtext>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mml:mtext><mml:mo>&#x2026;</mml:mo><mml:mtext>&#x00A0;&#x00A0;</mml:mtext><mml:mo>&#x2026;</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi><mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi><mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mtext>&#x00A0;</mml:mtext><mml:mo>&#x2026;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi><mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mo>]</mml:mo></mml:mrow>
</mml:mrow>
</mml:math>
<tex-math id="M17">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  {M_{pub}} = \left[ \begin{array}{l}
{e_{11}}{e_{12}}{\rm{  }} \ldots {\rm{  }}{e_{1n}}\\
{e_{21}}{e_{22}}{\rm{  }} \ldots {\rm{  }}{e_{2n}}\\
{\rm{       }} \ldots {\rm{  }} \ldots \\
{e_{m1}}{e_{m2}}{\rm{ }} \ldots {\rm{ }}{e_{mn}}
\end{array} \right]
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e017.gif"/>
</alternatives>
</disp-formula>
</p>
<p>
<disp-formula id="FD18">
<label>18</label>
<alternatives>
<mml:math id="Eq018-mml">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mrow>
<mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo> <mml:mtable columnalign='left'>
<mml:mtr>
<mml:mtd>
<mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mrow></mml:mrow>
<mml:mrow>
<mml:mn>11</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mi>p</mml:mi>
</mml:msubsup>
<mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mrow></mml:mrow>
<mml:mrow>
<mml:mn>12</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mi>p</mml:mi>
</mml:msubsup>
<mml:mtext>&#x00A0;&#x00A0;</mml:mtext><mml:mo>&#x2026;</mml:mo><mml:mtext>&#x00A0;&#x00A0;</mml:mtext><mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mrow></mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn><mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mi>p</mml:mi>
</mml:msubsup>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mrow></mml:mrow>
<mml:mrow>
<mml:mn>21</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mi>p</mml:mi>
</mml:msubsup>
<mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mrow></mml:mrow>
<mml:mrow>
<mml:mn>22</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mi>p</mml:mi>
</mml:msubsup>
<mml:mtext>&#x00A0;&#x00A0;</mml:mtext><mml:mo>&#x2026;</mml:mo><mml:mtext>&#x00A0;&#x00A0;</mml:mtext><mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mrow></mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn><mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mi>p</mml:mi>
</mml:msubsup>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mtext>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mml:mtext><mml:mo>&#x2026;</mml:mo><mml:mtext>&#x00A0;&#x00A0;</mml:mtext><mml:mo>&#x2026;</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mrow></mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi><mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mi>p</mml:mi>
</mml:msubsup>
<mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mrow></mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi><mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mi>p</mml:mi>
</mml:msubsup>
<mml:mtext>&#x00A0;</mml:mtext><mml:mo>&#x2026;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mrow></mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi><mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mi>p</mml:mi>
</mml:msubsup>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mo>]</mml:mo></mml:mrow>
</mml:mrow>
</mml:math>
<tex-math id="M18">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  {M_{pro}} = \left[ \begin{array}{l}
e_{_{11}}^pe_{_{12}}^p{\rm{  }} \ldots {\rm{  }}e_{_{1n}}^p\\
e_{_{21}}^pe_{_{22}}^p{\rm{  }} \ldots {\rm{  }}e_{_{2n}}^p\\
{\rm{       }} \ldots {\rm{  }} \ldots \\
e_{_{m1}}^pe_{_{m2}}^p{\rm{ }} \ldots {\rm{ }}e_{_{mn}}^p
\end{array} \right]
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e018.gif"/>
</alternatives>
</disp-formula>
</p>
<p>where <italic>e<sub>ij</sub></italic> in <italic>M<sub>pub</sub></italic> denotes the number of collaborations between expert i and applicant j on the publication-level while <italic>e<sup>p</sup><sub>ij</sub></italic> in <italic>M<sub>pro</sub></italic> denotes the number of collaborations between expert i and applicant j on the research project-level.</p>
<p>Then we defined connectivity <italic>C<sub>ij</sub></italic> as follows:</p>
<p>
<disp-formula id="FD19">
<label>19</label>
<alternatives>
<mml:math id="Eq019-mml">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>1</mml:mn><mml:mo>,</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x003E;</mml:mo><mml:mn>0</mml:mn><mml:mtext>&#x00A0;&#x00A0;&#x00A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mtext>&#x00A0;&#x00A0;&#x00A0;</mml:mtext><mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>p</mml:mi>
</mml:msubsup>
<mml:mo>&#x003E;</mml:mo><mml:mn>0</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>0</mml:mn><mml:mo>,</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mtext>&#x00A0;&#x00A0;&#x00A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mtext>&#x00A0;&#x00A0;&#x00A0;</mml:mtext><mml:msubsup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>p</mml:mi>
</mml:msubsup>
<mml:mo>=</mml:mo><mml:mn>0</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow></mml:mrow>
</mml:mrow>
</mml:math>
<tex-math id="M19">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[{C_{ij}} = \left\{ {\begin{array}{*{20}{c}}
{1,}&amp;{{e_{ij}} > 0{\rm{   }}or{\rm{   }}e_{ij}^p > 0}\\
{0,}&amp;{{e_{ij}} = 0{\rm{   }}or{\rm{   }}e_{ij}^p = 0}
\end{array}} \right.\]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e019.gif"/>
</alternatives>
</disp-formula>
</p>
<p>where <italic>C<sub>ij</sub></italic> denotes the connectivity between expert i and applicant j. From the above formula, we found that if an expert has a collaborative relationship with an applicant, no matter whether in a publication or research project, the expert will lose the opportunity to review the applicant.</p>
</sec>
<sec>
<title>3.2.4 Aggregation model</title>
<p>Through the above three modules we obtained three scores for each expert: relevance score (<italic>R<sub>ij</sub></italic>), quality score (<italic>Q<sub>j</sub></italic>), and connectivity score (<italic>C<sub>ij</sub></italic>). We proposed an aggregation model integrating these aspects to make the score more appropriate and accurate. In this research, we need to recommend experts with high relevance and quality scores. The best situation is that the expert receives high scores in both relevance and quality. If the expert gets a high quality score but a low relevance score, he or she is also not suitable to review the applicant. Meanwhile, we must exclude the expert whose connectivity score is equal to one, which means there is a link between expert and applicant. Therefore, the proposed aggregation model can be denoted as follows:</p>
<p>
<disp-formula id="FD20">
<label>20</label>
<alternatives>
<mml:math id="Eq020-mml">
<mml:mrow>
<mml:mi>S</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:msub>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x00D7;</mml:mo><mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
<tex-math id="M20">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  Scor{e_{ij}} = (1 - {C_{ij}}) \times {R_{ij}} \times {Q_j}
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e020.gif"/>
</alternatives>
</disp-formula>
</p>
<p>where <italic>Score<sub>ij</sub></italic> denotes the comprehensive score of expert j for applicant i. Meanwhile, the connectivity between external experts and applicants should be satisfied if <italic>C<sub>ij</sub></italic> = 0. If the expert&#8217;s connectivity score is equal to one, which means the expert&#8217;s <italic>Score<sub>ij</sub></italic> is equal to zero, the expert will lose the opportunity to review the applicant. The proposed model ranks all experts according to their scores and outputs a list of recommended experts for an applicant.</p>
</sec>
</sec>
</sec>
<sec>
<title>4 Empirical Analyses</title>
<sec>
<title>4.1 Data and method</title>
<p>The proposed intelligent expert recommendation method was implemented to aid universities or other research institutions in selecting excellent talent. In this section, we discuss how we verified the validity and accuracy of the proposed method and compared its performance with other baseline methods.</p>
<p>First we collected expert and applicant information from various sources, such as the expert database provided by the university, research social network websites, personal homepages, and so on. Then we extracted useful information about areas of expertise, publications, and research projects and used this data in the next phase of the experiment. Second, we compared the proposed method with the baseline method to verify the better performance of the proposed method. In our research, we took time factors into consideration and redefined the weight of each keyword when calculating the similarity between expert and applicant while the traditional method views all keywords as having the same weight. In our experiment, the applicant, unlike a paper or a project, may have various research areas during different time periods so the keywords of different periods have different levels of influence and importance for the applicant. Obviously, the shorter the time interval between the time the papers were published and the present, the more the paper represents the applicant&#8217;s research area. The details of the comparative experiment are as follows:</p>
<list list-type="order">
<list-item>
<p>The baseline method: This recommendation method, used widely in research expert recommendation context, combines the relevance, connectivity, and quality perspectives to be the targets. The relevance analysis model views all publications as having the same weight when calculating the similarity between applicant and experts.</p>
</list-item>
<list-item>
<p>The proposed method: This method, based on the baseline method, also uses relevance, connectivity, and quality to recommend appropriate experts for each applicant. The difference is that we take time factors into consideration because unlike a paper or a research project, which generally focuses on one research field, an applicant may have various research areas at different times. Therefore, we added a time factor in the proposed relevance analysis model. We put forward a hypothesis that the smaller the time interval, the more representative the publication, which can reflect the applicant&#8217;s area of expertise. Based on this hypothesis, we redefined the weight of keywords extracted from publications and research projects, by saying the shorter the time interval, the greater the weight.</p>
</list-item>
</list>
<p>In this paper, we built an aggregation model integrating quality, relevance, and connectivity, and in each aspect we also proposed several criteria. These criteria, as we all know, have different weights in each aspect. To solve the multi-criteria weight problem, we adopted an analytic hierarchy process (AHP) approach to set different weights for different indicators.</p>
</sec>
<sec>
<title>4.2 Evaluation metrics</title>
<p>In our research, we recommended a list of appropriate experts as reviewers for each applicant and asked them to rate the recommendation results based on relevance. We used the Average Rating score (AR) and Normalized Discounted Cumulative Gain (NDCG) to weigh the performance of the proposed recommendation method. AR and NDCG were computed for the top one and the top five recommended experts. More particularly, the AR was computed using the ratings from all the users, and it reflects the average rating of all the recommendations. The NDCG is usually used for evaluating a search engine&#8217;s performance, and it is common for gradual judgments. In our work, the AR and NDCG were defined as follows:</p>
<p>
<disp-formula id="FD21">
<label>21</label>
<alternatives>
<mml:math id="Eq021-mml">
<mml:mrow>
<mml:mtext>AR</mml:mtext><mml:mo>=</mml:mo><mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mrow><mml:mo>|</mml:mo> <mml:mi>U</mml:mi> <mml:mo>|</mml:mo></mml:mrow>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle='true'>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mrow><mml:mo>|</mml:mo> <mml:mi>U</mml:mi> <mml:mo>|</mml:mo></mml:mrow>
</mml:mrow>
</mml:munderover>
<mml:mrow>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>N</mml:mi>
</mml:mfrac>
</mml:mrow>
</mml:mstyle><mml:mstyle displaystyle='true'>
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>N</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
<tex-math id="M21">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  {\rm{AR}} = \frac{1}{{\left| U \right|}}\sum\limits_{i = 1}^{\left| U \right|} {\frac{1}{N}} \sum\nolimits_{j = 1}^N {{r_{ij}}}
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e021.gif"/>
</alternatives>
</disp-formula>
</p>
<p>
<disp-formula id="FD22">
<label>22</label>
<alternatives>
<mml:math id="Eq022-mml">
<mml:mrow>
<mml:mi>N</mml:mi><mml:mi>D</mml:mi><mml:mi>C</mml:mi><mml:mi>G</mml:mi><mml:mo>=</mml:mo><mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mo>&#x007C;</mml:mo><mml:mi>U</mml:mi><mml:mo>&#x007C;</mml:mo>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle='true'>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x007C;</mml:mo><mml:mi>U</mml:mi><mml:mo>&#x007C;</mml:mo>
</mml:mrow>
</mml:munderover>
<mml:mi>Z</mml:mi>
</mml:mstyle><mml:mstyle displaystyle='true'>
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>N</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msup>
<mml:mn>2</mml:mn>
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi><mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>log</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
<tex-math id="M22">
    \documentclass[10pt]{article}
    \usepackage{wasysym}
    \usepackage[substack]{amsmath}
    \usepackage{amsfonts}
    \usepackage{amssymb}
    \usepackage{amsbsy}
    \usepackage[mathscr]{eucal}
    \usepackage{mathrsfs}
    \usepackage{pmc}
    \usepackage[Euler]{upgreek}
    \pagestyle{empty}
    \oddsidemargin -1.0in
    \begin{document}
    \[
  NDCG = \frac{1}{{|U|}}\sum\limits_{i = 1}^{|U|} Z \sum\nolimits_{j = 1}^N {\frac{{{2^{{r_{ij}}}} - 1}}{{\log (1 + j)}}}
    \]
    \end{document}
</tex-math>
<graphic xlink:href="eqn/e022.gif"/>
</alternatives>
</disp-formula>
</p>
<p>where |<italic>U</italic>| denotes the number of researchers in our survey, N represents the number of recommended experts and N=1 or 5, <italic>r<sub>ij</sub></italic> denotes the rating of researcher <italic>i</italic> on expert <italic>j</italic>, and Z is a normalization constant that is chosen so that a perfect ranking&#8217;s NDCG value is 1.</p>
</sec>
<sec>
<title>4.3 Results and discussion</title>
<p>We compared the proposed method with the baseline method, and we compared their results based on AR metrics and NDCG metrics. The details of results are shown as follows (Table <xref ref-type="table" rid="T1">1</xref> and Table <xref ref-type="table" rid="T2">2</xref>):</p>
<table-wrap id="T1">
<label>Table 1</label>
<caption>
<p>Performance of two methods in terms of AR.</p>
</caption>
<table>
<tr>
<th align="center"></th>
<th align="center">The proposed method</th>
<th align="center">The baseline method</th>
</tr>
<tr>
<td colspan="3">
<hr/></td>
</tr>
<tr>
<td align="left">Top 1</td>
<td align="right">4.23</td>
<td align="right">4.05</td>
</tr>
<tr>
<td align="left">Top 5</td>
<td align="right">4.68</td>
<td align="right">4.26</td>
</tr>
</table>
</table-wrap>
<table-wrap id="T2">
<label>Table 2</label>
<caption>
<p>Performance of two methods in terms of NDCG.</p>
</caption>
<table>
<tr>
<th align="center"></th>
<th align="center">The proposed method</th>
<th align="center">The baseline method</th>
</tr>
<tr>
<td colspan="3">
<hr/></td>
</tr>
<tr>
<td align="left">Top 1</td>
<td align="right">0.78</td>
<td align="right">0.62</td>
</tr>
<tr>
<td align="left">Top 5</td>
<td align="right">0.84</td>
<td align="right">0.74</td>
</tr>
</table>
</table-wrap>
<p>From the above tables, we discovered that the value of the two metrics using the proposed method was greater than that given by the baseline method. Thus, we can conclude that the performance of the proposed method is better than that of the baseline method. Therefore, the proposed method recommends more appropriate reviewers than the baseline method.</p>
</sec>
</sec>
<sec>
<title>5 Conclusions</title>
<p>In this article, we proposed an intelligent recommendation method in the context of big data to recommend appropriate experts for applicant review. The proposed recommendation method combined a relevance analysis model, connectivity analysis model, and quality analysis model and added a time factor to construct a comprehensive recommendation model. Our method was implemented in an online research community, and the results exhibit that the proposed method is more effective than existing ones.</p>
<p>However, there are still some research problems that need more study. First, although this paper takes some personal aspects into consideration, such as time factors, our analysis of personalization is not large enough. We should find more features of the applicant with which to model the applicant&#8217;s profile. Second, in this paper we only analysed a collaboration network. In fact, there are still other social networks that could impact the recommendation results, such as friend networks and citation networks. We will focus on these points in the future. Third, we used some big data analysis methods in our research, such as collecting data from the internet (e.g., social network websites and personal homepages), dealing with various types of data, building all kinds of calculation models, and so on. However, in the future, we plan to adopt the MapReduce framework and cloud computing to improve efficiency and effectiveness. Of course, we still will expand the scale of the data to improve the accuracy of our expert recommendation system. Finally, the proposed recommendation method can be used in other situations, such as finding a job and research project selection.</p>
</sec>
</body>
<back>
<ack>
<title>6 Acknowledgments</title>
<p>This research work was partly supported by National Natural Science Foundation of China (Grant No.71001103, 91224008, 91324015), Humanities and Social Sciences Foundation of the Ministry of Education (No. 14YJA630075), Beijing Natural Science Foundation (No. 9122013), Beijing Nova Program (No.Z131101000413058), and Program for Excellent Talents in Beijing.</p>
</ack>
<ref-list>
<ref id="B1">
<label>1</label>
<mixed-citation>Aljukhadar, M., Senecal, S., &amp; Daoust, C.E. (2012) Using recommendation agents to cope with information overload. <italic>International Journal of Electronic Commerce 17</italic>(2), pp 41&#8211;70.</mixed-citation>
</ref>
<ref id="B2">
<label>2</label>
<mixed-citation>Balog, K., Azzopardi, L., &amp; de Rijke, M. (2009) A language modeling framework for expert finding. <italic>Information Processing &amp; Management 45</italic>(1), pp 1&#8211;19.</mixed-citation>
</ref>
<ref id="B3">
<label>3</label>
<mixed-citation>Balog, K. &amp; de Rijke, M. (2007) Determining Expert Profiles (With an Application to Expert Finding). <italic>IJCAI 7</italic>, pp 2657&#8211;2662.</mixed-citation>
</ref>
<ref id="B4">
<label>4</label>
<mixed-citation>Cao, Y., Liu, J., Bao, S., &amp; Li, H. (2005) Research on expert search at enterprise track of TREC 2005. In TREC.</mixed-citation>
</ref>
<ref id="B5">
<label>5</label>
<mixed-citation>Chen, T.K., Liao, H.H., Kuo, H.J., &amp; Hsieh, Y.L. (2013) Suppliers&#8217; and customers&#8217; information asymmetry and corporate bond yield spreads. <italic>Journal of Banking &amp; Finance 37</italic>(8), pp 3181&#8211;3191.</mixed-citation>
</ref>
<ref id="B6">
<label>6</label>
<mixed-citation>Daud, A., Li, J., Zhou, L., &amp; Muhammad, F. (2010) Temporal expert finding through generalized time topic modelling. <italic>Knowledge-Based Systems 23</italic>(6), pp 615&#8211;625.</mixed-citation>
</ref>
<ref id="B7">
<label>7</label>
<mixed-citation>Deng, H., King, I., &amp; Lyu, M. R. (2008) Formal models for expert finding on DBLP bibliography data. <italic>The Eighth IEEE International Conference on Data Mining, IEEE</italic>, pp 163&#8211;172.</mixed-citation>
</ref>
<ref id="B8">
<label>8</label>
<mixed-citation>Fang, H. &amp; Zhai, C. (2007) Probabilistic models for expert finding. <italic>Proceedings of the 29th European Conference on IR research</italic>, Springer: Berlin Heidelberg, pp. 418&#8211;430.</mixed-citation>
</ref>
<ref id="B9">
<label>9</label>
<mixed-citation>Fazel-Zarandi, M., Devlin, H.J., Huang, Y., &amp; Contractor, N. (2011) Expert recommendation based on social drivers, social network analysis, and semantic data representation. In <italic>Proceedings of the 2nd International Workshop on Information Heterogeneity and Fusion in Recommender Systems</italic>, ACM, pp 41&#8211;48.</mixed-citation>
</ref>
<ref id="B10">
<label>10</label>
<mixed-citation>Li, M., Liu, L., &amp; Li, C. B. (2011) An approach to expert recommendation based on fuzzy linguistic method and fuzzy text classification in knowledge management systems. <italic>Expert Systems with Applications 38</italic>(7), pp 8586&#8211;8596.</mixed-citation>
</ref>
<ref id="B11">
<label>11</label>
<mixed-citation>Li, X. &amp; Watanabe, T. (2013) Automatic paper-to-reviewer assignment, based on the matching degree of the reviewers. <italic>Procedia Computer Science 22</italic>, pp 633&#8211;642.</mixed-citation>
</ref>
<ref id="B12">
<label>12</label>
<mixed-citation>Liu, D.R., Chen, Y.H., Kao, W.C., &amp; Wang, H.W. (2013) Integrating expert profile, reputation and link analysis for expert finding in question-answering websites. <italic>Information Processing &amp; Management 49</italic>(1), pp 312&#8211;329.</mixed-citation>
</ref>
<ref id="B13">
<label>13</label>
<mixed-citation>Macdonald, C, &amp; Ounis, I. (2008) Voting techniques for expert search. <italic>Knowledge and Information Systems 16</italic>(3), pp 259&#8211;280.</mixed-citation>
</ref>
<ref id="B14">
<label>14</label>
<mixed-citation>Moreira, C. &amp; Wichert, A. (2013) Finding academic experts on a multisensor approach using Shannon&#8217;s entropy. <italic>Expert Systems with Applications 40</italic>(14), pp 5740&#8211;5754.</mixed-citation>
</ref>
<ref id="B15">
<label>15</label>
<mixed-citation>Silva, T., Guo, Z., Ma, J., Jiang, H., &amp; Chen, H. (2013) A social network-empowered research analytics framework for project selection. <italic>Decision Support Systems 55</italic>(4), pp 957&#8211;968.</mixed-citation>
</ref>
<ref id="B16">
<label>16</label>
<mixed-citation>Vivacqua, A.S., Oliveira, J., &amp; De Souza, J.M. (2009) I-ProSE: inferring user profiles in a scientific context. <italic>The Computer Journal 52</italic>(7), pp 789&#8211;798.</mixed-citation>
</ref>
<ref id="B17">
<label>17</label>
<mixed-citation>Wang, C. &amp; Blei, D. M. (2011) Collaborative topic modeling for recommending scientific articles. <italic>Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</italic>, ACM, pp 448&#8211;456.</mixed-citation>
</ref>
<ref id="B18">
<label>18</label>
<mixed-citation>Wang, G. A., Jiao, J., Abrahams, A. S., Fan, W., &amp; Zhang, Z. (2013) ExpertRank: A topic-aware expert finding algorithm for online knowledge communities. <italic>Decision Support Systems 54</italic>(3), pp 1442&#8211;1451.</mixed-citation>
</ref>
<ref id="B19">
<label>19</label>
<mixed-citation>Xu, W., Sun, J., Ma, J., &amp; Du, W. (2013) How to find R&amp;D project opportunities in big data context? &#8211;towards personalized information recommendation services. <italic>The 43rd International Conference on Computers and Industrial Engineering</italic>.</mixed-citation>
</ref>
<ref id="B20">
<label>20</label>
<mixed-citation>Yukawa, T., Kasahara, K., Kato, T., &amp; Kita, T. (2001) An expert recommendation system using concept-based relevance discernment. <italic>Proceedings of the 13th International Conference on Tools with Artificial Intelligence</italic>, IEEE, pp 257&#8211;264.</mixed-citation>
</ref>
</ref-list>
</back>
</article>