<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Evolvable Semantic Platform for Facilitating Knowledge Exchange</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Nikolay Karpov</string-name>
          <email>nkarpov@hse.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Eduard Babkin</string-name>
          <email>eababkin@hse.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alexander Demidovskij</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National Research University Higher School of Economics</institution>
          ,
          <addr-line>25/12 Bolshaja Pecherskaja str., Nizhny Novgorod 603155</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The authors propose new formal foundations and design approach to develop an evolving semantic platform for finding experts relevant to events arising in the open environment of modern economical clusters. This work offers a new implementation of probabilistic latent topic modeling method with two linked indicators (categories and experts) to mach expertise. In order to show feasibility of the solution a distributed and service-oriented software prototype of the web-based semantic platform was developed. Solution provides results with high precision scores and evolves in accordance with changes over time. Fusing together ontology-aided expertise matching and service-oriented software design suitable for developing evolvable semantic applications our approach facilitates effective and efficient knowledge exchange. That prototype called EXPERTIZE was evaluated for a particular case of experts finding in the university clusters.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The environment of a modern enterprise is rapidly changing under the
influence of a number of factors: socio-cultural, economical, political, technological
and other. In this situation, inter-organizational exchange of expertise and
professional knowledge plays an important role for sustainable operation of
innovation enterprises. The emerging and successful growth of new forms of
interorganizational cooperation known as regional, innovative or university clusters in
national economies is becoming a significant phenomenon of the modern
worldwide socio-economical system [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Many researchers try to improve the learning
performance of clusters. For instance, in a study by [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], the authors analyze the
structures and relationship characteristics of major innovation clusters, and how
the structural aspects and learning openness of these networks influence the
performance of organizations in clusters. A study by [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] investigates the quantitative
relationship between knowledge sharing, innovation and performance. Explicit
knowledge sharing is considered to have more significant effects on innovation
speed and financial performance, while tacit knowledge sharing has more
significant effects on innovation quality and operational performance.
      </p>
      <p>A university undoubtedly should be a catalyst for exchanging expertise and
professional knowledge. Critical problems and major strategic choices should
be commented on, discussed and exposed to multiple stakeholders including
industry mass-media and society.</p>
      <p>We believe that advanced methods of automated and automatic knowledge
management belong to critical scientific foundations of modernizing the paradigm
of information and knowledge exchange. A specifically designed combination of
automated text processing and ontology-based knowledge engineering may
improve the quality of information analysis and reduce the university’s response
time.</p>
      <p>The paper contributes to the solution of the specified problem providing a
systematic analysis of the expert retrieval task using topic modeling. We offer
a new application of probabilistic topic models and suggest a service-oriented
design of an evolvable semantic platform for finding university experts relevant
to events arising in the economical clusters. In our research, evolvability of the
semantic platform means that the expert retrieval solution adapts to changes of
experts’ interests and events in the open environment over time.</p>
      <p>The novel application of the topic modeling approach consists in matching
events with the semantics of two indicators: experts and categories using the
Bayesian formula. There is two-fold linking between the indicators: first by
semantics of the textual content, second by explicit tagging. This allows the user
to speed up the process of expert finding by filtering by category. As a result, the
proposed two-indicator approach provides university employees with the most
recent and critical information about events, based on document analysis and
the matching algorithm.</p>
      <p>This paper is structured as follows. The second section contains a short
overview of knowledge structures used in search and recommender systems.
In Section 3, we describe a novel way of using probabilistic topic models for
ontology-aided expertise matching. In Section 4, we provide a detailed software
design of a system called EXPERTIZE, which uses probabilistic topic
modeling for the expert finding task. Section 5 contains the results of the evaluation
performed. Conclusions and a discussion of the implications of this work are
provided in Section 6.
2
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Related works</title>
      <sec id="sec-2-1">
        <title>Semantic modeling</title>
        <p>
          Considering the rapid growth of information generated by users of the Internet,
it is essential to make connections in such a way that it is possible for everyone
to gain the relevant information. It is the problem of constructing a semantic
web. A set of core principles of the semantic web were developed in [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. The idea
of the semantic web is that the knowledge sharing process has to be effective,
so that the community can get benefits from better integration. Some useful
suggestions about the reuse of knowledge patterns were made by [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
        </p>
        <p>
          The inter-organizational knowledge management has also been recognized
as a critical factor for an organization to remain competitive. This idea was
reflected in the Media Information Logistics project (Media-ILOG). The goal of
the Media-ILOG [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] was to improve the information flow inside a local newspaper
JonkopingsPosten.
        </p>
        <p>
          Another inter-organizational semantic application was proposed by [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. The
recent proposal included a specialization of the generic paradigm of ontological
engineering, specific types of machine-readable RDF ontologies and an
application of the temporal look at information relevant for team formation. In the
software prototype InfoPort, aimed at solving the research team formation
problem, the authors proposed to translate a user-specified query to a corresponding
SPARQL query, which was then evaluated against a specific set of RDF
repositories. The query result consisted of relevant categories of scientific classification
taxonomies and keywords. The search algorithm of the InfoPort system retrieved
everyone who was labeled with this query.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Expert finding</title>
        <p>
          Some systems that cover several aspects of expert finding have already been
developed. Initially, there were manual systems like SpuD [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], Sage People Finder
[
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. Two of the earliest intellectual platforms dedicated to this problem were
MITRE [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] and Panoptic by [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. Nowadays, systems are much more complicated
and precise; some examples are ArnetMiner [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], INDURE, Microsoft Academic
Search [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], K-net[
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], and SmallBlue [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
        </p>
        <p>
          The problem of finding the relevant and high-quality piece of advice is an
extremely vital question nowadays. This search is about finding people who
have relevant experience, or who are referred to as experts. There are more
specific tasks derived from expertise retrieval: enterprise document search, learning
to rank, entity retrieval, etc. As far as expert finding is concerned, we
usually consider following approaches: profile-based, citation graph-based, textual
contents-based, based on voting, and the hybrid one. The fundamental principle
of the most approaches was systematized by Balog et al., [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. Textual contents
approach is widely discussed in the scientific world and deserves much more
attention than it is currently paid. The core ideas of the modern document-based
approach are described in the study of Fang and Zhai [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. These scientists
applied it to a language-based framework in an attempt to develop a better expert
finding solution. However, the hybride approach is considered to outperform the
profile-based and document-based ones [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ].
        </p>
        <p>
          As it is crucial to compare the different approaches to the expert finding
task, some test collections have been developed. The most commonly used one
is from the Enterprise Track at the Text Retrieval Conference (TREC
20052008)[
          <xref ref-type="bibr" rid="ref17">17</xref>
          ],[
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ], [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] and corresponding benchmarks. This dataset consists
of a collection of web pages and mainly textual features could be extracted.
DBLP Computer Science Bibliography Dataset, contains the authors’
publication records, is very rich on citation links (which enable the exploration of graph
structures) and contains the publications’ titles and abstracts [21].
        </p>
        <p>Rich heterogeneous information derived from the textual contents, from the
graph structure of the citation patterns for the community of experts, and from
profile information about the academic experts can be combine multiple
estimators of expertise based on a multisensor data fusion framework together with the
Dempster-Shafer theory of evidence and Shannon’s entrop [22]. However, there
are still some obstacles such as using specific components in various methods,
training requirements and others, which make the process of comparing these
approaches extremely difficult.
2.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>Topic modeling</title>
        <p>It is impossible to exaggerate the importance of topic modeling as the basic
approach in the expert finding tasks. Initially, the Latent Dirichlet Allocation
(LDA) was introduced by [23] as an extension of the Probabilistic Latent
Semantic Analysis (pLSA) that includes prior distributions on the generation of topics
and words. The topic mixture weights are not individually calculated for each
document, but are treated as a k-parameter hidden random variable, where k is
the number of topics. These variables that represent the word-topic and topic
document distribution is a Dirichlet ones. Later, the idea of author-modeling
was broadly developed by a range of leading scholars: [24] etc.</p>
        <p>Academic knowledge discovery was also studied by [25], where the authors
applied the group level topic modeling based on the LDA for the expert finding
task.</p>
        <p>The topic modeling approach has also been applied to analyzing any type of
media resources. For instance, [26] proposed a complete system that retrieved
experts from microblog platforms and ranked them according to their relevance.
More importantly, a new Microblog LDA was presented, and according to the
published results, it outperforms LDA for this specific task. In a study by [27],
a new Trend-Sensitive LDA model was built for retrieving temporal trends in
Twitter. Interestingly, there is also a study presenting a music recommender
system [28] using Probabilistic Topic Modeling. There are also some papers on
recommender systems for e-commerce, e.g. [29]. They proposed a dual approach:
to recommend goods to clients and recommend item descriptions to sellers.</p>
        <p>
          Based on LDA topic modeling,[
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] developed an approach to solving the
expert finding task, which outperforms the previous results on the TREC
200506 benchmarks. The indirect definition of several topics can build a more detailed
and precise picture of personal expertise, so it can make the expert retrieval
process more effective. The main principle was that using the LDA, it is possible
to extract latent topics from a given text, and then one can find the distribution
of possible expertise among all authors. This method seems to be a considerable
milestone in solving the expert finding task.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Software Design of EXPERTISE</title>
      <p>The described method for expert finding was implemented in a system for
matching between relevant university experts and actual information events arising in
the open environment of the economical cluster. This system was called
EXPERTIZE. The following services comprise the high-level design of the system
(Figure 1):
1. Web Crawler;
2. Data Modeler;
3. Data Store;
4. Graphical User Interface (GUI);
5. Matcher.</p>
      <p>
        EXPERTIZE actively uses our InfoPort Service [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. This semantic service
provides information about more than three hundred employees of the Higher
School of Economics (NRU HSE)1 branch in Nizhny Novgorod in the form of
a formal ontology. The InfoPort data is represented in RDF triples. The triples
include hierarchical information as it originally is in the source. The first level is
an alphabetically ordered list of a group of academics, the second is an academic
with his/her personal interests and papers, and the third is papers with their
features.
      </p>
      <p>The components of the EXPERTIZE system can be divided into Online and
Offline services. Both interact with the InfoPort via the native REST interface.
The Offline service works within the period of a month to update information
regularly. The Online service works on demand, when a user activates it via the
web interface.
1 http://www.hse.ru/en/</p>
      <p>The offline processing begins with a crawler Service by a scheduler. The
Crawler makes a request via the REST-interface to the InfoPort Store Service to
get a list URI (Uniform Resource Identifiers) for papers. As soon as each paper
is available online, the Crawler gets it by the URI and extracts its features
from a page using an XML parser. The features of a paper include the authors,
title, abstract, free keywords, and scientific categories based on the ontology.
This information is collected in the Data Store with the help of a MySQL2 base
as a temporary raw data. The Crawler Service is implemented in the Python3
programming language using the Lxml4 library for HTML processing (Figure
3).</p>
      <p>The preprocessing in the Data Modeler service includes the following steps:
– getting temporary raw data;
– tokenizing the text;
– lemmatizing the tokens;
– indexing the words using the dictionary of lemmas;
– filtering out the words that are too frequent (stop words) or too rare (used
only once);
– indexing the authors and scientific categories;
– forming the bag of words using the lemmas, authors and categories;
– building the LDA model with a given number of topics K.</p>
      <p>The online processing is performed on demand, when a user opens the Web
GUI. The web interface activates the RSS Newsfeed, which gets and displays 10
last news posts from the RSS feed and an empty textbox. A user can choose
one of the 10 news posts or paste the text into the textbox manually. When a
user specifies an input query, the GUI transfers it to the Matcher. In turn, this
component performs an online semantic search. A semantic representation of
the event is matched with semantic representations of scientific categories and
experts by applying the formula (8) and (9) and selecting top 5 of the units.
Then, the Matcher component returns the 10 URIs to the GUI. To provide user
2 http://www.mysql.com
3 http://www.python.org
4 http://lxml.de
friendly output of the search result, the GUI component makes a request to the
Infoport Service. It gets features of the selected units: the expert’s full name,
photo URL, and position.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Evaluation</title>
      <p>We used information about more than three hundred experts from the Higher
School of Economics (NRU HSE)5 branch in Nizhny Novgorod, as it was
mentioned above. The number of texts created by the experts and used to build the
LDA model is 4132, all written in the Russian language.</p>
      <p>The expert matching algorithm was evaluated using mean average precision
of top k extracted most probable experts and categories. As input, we used
our own test set that consists of 250 texts in Russian on the following topics:
linguistics, law, politics, economics, management, mathematics and informatics.
For each text, EXPERTIZE recommended the 10 experts and 10 categories with
highest probabilities. The probability score calculated using formulas (6) with
equiprobable and not equiprobable distribution of P (Ti). For equiprobable case
the probability was constant. For not equiprobable case the probability was
estimated as follow:
5 http://www.hse.ru/en/</p>
      <p>P^(Ti) =</p>
      <p>Ti
sumi(Ti)
(1)
Ti is a number of documents in collection where term i exists, sumi(Ti) is a total
number of documents.</p>
      <p>Let be a set of correct terms (experts, categories) and be a set of terms among
the top k terms with highest probability. Then precision, and mean average
precision (MAP) at k are calculated as follows, respectively:</p>
      <p>P recision(k) = jR \ R^kj
^
jRkj</p>
      <p>M AP (k) = k1 ik=1P (i)</p>
      <p>The quality of a similarity measure is assessed with the following statistics
P recision(i); i = 1; 10, and M AP (10). Table 1 shows the performance of the
EXPERTIZE platform for experts and categories separately. Mean average
precision for top 10 experts is 0.57. It is higher than the results achieved in English
TREC 2006 and 2005 datasets. At the same time, not equiprobable formula
shows higher results then equiprobable ones. We explain this by the fact that
our dataset had a lower number of documents and it’s distribution is non-uniform
over different categories and experts.</p>
      <p>To sum up, the experiment shows that the proposed approach makes accurate
recommendations based on the text under consideration, which makes it a useful
tool for expert finding and revealing latent topics.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>Topic modeling is successfully used to enhance search and recommendation in
enterprise software [30]. Our EXPERTIZE platform applies topic modeling to
online expert recommendation using the university community as the expert
pool. We realize and evaluate an algorithm for matching events with a semantic
of two indicators: experts and categories using Bayesian formula. Two linked
indicators for expert retrieval with high precision allows easy search of the relevant
person. As a source of categories and keywords two taxonomies are used together
as a machine-readable ontology of scientific areas. The first part of this ontology
is the international UNESCO nomenclature for fields of science and technology.
The second part of the ontology was developed by our research team based on
the Russian scientific classification called e-library.</p>
      <p>The EXPERTIZE platform is organized as an evolvable and service-oriented
application. It provides results with high precision scores and evolves in
accordance with changes over time. In our research, evolvability of the semantic
platform means that the expert retrieval solution adapts to changes of experts’
interests and events in the open environment. We believe that the results of our
study have a high potential in our global fast-changing world.</p>
      <p>In the future, information used to retrieve relevant experts could be taken
from more than one sensor and multiple estimators can be combined as proposed
by Moreira &amp; Wichert [22]. We believe that information derived from textual
content could also be improved by exploiting state-of-the-art topic modeling
instead of the LDA, but it should be evaluated on the benchmarks first.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgment</title>
      <p>The reported study was funded by RFBR according to the research Project No.
16-06-00184 A.
21. Z. Yang, J. Tang, B. Wang, J. Guo, J. Li, and S. Chen, “Expert2bole: From
expert finding to bole search,” in Proceedings of the ACM SIGKDD International
Conference on Knowledge Discovery and Data Mining,(KDD’09), 2009, pp. 1–4.
22. C. Moreira and A. Wichert, “Finding academic experts on a multisensor approach
using Shannon’s entropy,” Expert Systems with Applications, vol. 40, no. 14, pp.
5740–5754, 2013.
23. D. M. Blei, A. Y. Ng, and M. I. Jordan, “Latent Dirichlet Allocation,” Journal of
Machine Learning Research, no. 3, pp. 993–1022, 2003. [Online]. Available: http:
//jmlr.org/papers/volume3/blei03a/blei03a.pdf
24. T. L. Griffiths and M. Steyvers, “Finding scientific topics,” Proceedings of the
National academy of Sciences of the United States of America, vol. 101, no. Suppl 1,
pp. 5228–5235, 2004.
25. A. Daud and F. Muhammad, “Group topic modeling for academic knowledge
discovery,” Applied Intelligence, vol. 36, no. 4, pp. 870–886, 2012.
26. S. Xianlei, Z. Chunhong, and J. Yang, “Finding Domain Experts in Microblogs,”
2014.
27. M.-C. Yang and H.-C. Rim, “Identifying Interesting Twitter Contents Using Topical
Analysis,” Expert Syst. Appl., vol. 41, no. 9, pp. 4330–4336, Jul. 2014. [Online].</p>
      <p>Available: http://dx.doi.org/10.1016/j.eswa.2013.12.051
28. Z. Hyung, K. Lee, and K. Lee, “Music recommendation using text analysis on song
requests to radio stations,” Expert Systems with Applications, vol. 41, no. 5, pp.
2608–2618, 2014.
29. K. Christidis and G. Mentzas, “A topic-based recommender system for electronic
marketplace platforms,” Expert Systems with Applications, vol. 40, no. 11, pp.
4370–4379, 2013.
30. K. Christidis, G. Mentzas, and D. Apostolou, “Using latent topics to enhance search
and recommendation in Enterprise Social Software,” Expert Systems with
Applications, vol. 39, no. 10, pp. 9297–9307, 2012.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>B.</given-names>
            <surname>Asheim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cooke</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Martin</surname>
          </string-name>
          , “
          <article-title>Clusters and regional development: Critical reflections</article-title>
          and explorations,” Economic Geography, vol.
          <volume>84</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>109</fpage>
          -
          <lpage>112</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>J.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Hyun</surname>
          </string-name>
          , and M.-S. Cha, “
          <article-title>The effects of network characteristics on performance of innovation clusters,” Expert Systems with Applications</article-title>
          , vol.
          <volume>40</volume>
          , no.
          <issue>11</issue>
          , pp.
          <fpage>4511</fpage>
          -
          <lpage>4518</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.</given-names>
            <surname>Wang</surname>
          </string-name>
          , “
          <article-title>Knowledge sharing, innovation and firm performance,” Expert Systems with Applications</article-title>
          , vol.
          <volume>39</volume>
          , no.
          <issue>10</issue>
          , pp.
          <fpage>8899</fpage>
          -
          <lpage>8908</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>A.</given-names>
            <surname>Ohgren</surname>
          </string-name>
          and
          <string-name>
            <given-names>K.</given-names>
            <surname>Sandkuhl</surname>
          </string-name>
          , “
          <article-title>Towards a methodology for ontology development in small and medium-sized enterprises</article-title>
          .”
          <source>in IADIS AC</source>
          ,
          <year>2005</year>
          , pp.
          <fpage>369</fpage>
          -
          <lpage>376</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>K.</given-names>
            <surname>Hammar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Lin</surname>
          </string-name>
          , and
          <string-name>
            <given-names>V.</given-names>
            <surname>Tarasov</surname>
          </string-name>
          , “
          <article-title>Information Reuse and Interoperability with Ontology Patterns and Linked Data,”</article-title>
          <source>in Business Information Systems Workshops</source>
          . Springer,
          <year>2010</year>
          , pp.
          <fpage>168</fpage>
          -
          <lpage>179</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>K.</given-names>
            <surname>Sandkuhl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ohgren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Smirnov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shilov</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Kashevnik</surname>
          </string-name>
          , “
          <article-title>Ontology construction in practice: Experiences and recommendations from industrial cases</article-title>
          ,
          <source>” in 9th International Conference on Enterprise Information Systems</source>
          ,
          <volume>12</volume>
          -
          <fpage>16</fpage>
          ,
          <year>June 2007</year>
          , Funchal, Madeira-Portugal,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>E.</given-names>
            <surname>Babkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Karpov</surname>
          </string-name>
          , and
          <string-name>
            <given-names>O.</given-names>
            <surname>Kozyrev</surname>
          </string-name>
          , “
          <article-title>Towards Creating an Evolvable Semantic Platform for Formation of Research Teams,” in Perspectives in Business Informatics Research, ser</article-title>
          .
          <source>Lecture Notes in Business Information Processing</source>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kobyliński</surname>
          </string-name>
          and
          <string-name>
            <surname>A</surname>
          </string-name>
          . Sobczak, Eds. Springer Berlin Heidelberg, Jan.
          <year>2013</year>
          , no.
          <issue>158</issue>
          , pp.
          <fpage>200</fpage>
          -
          <lpage>213</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8. I.
          <article-title>Becerra-Fernandez, “Searching for experts on the Web: A review of contemporary expertise locator systems</article-title>
          ,
          <source>” ACM Transactions on Internet Technology (TOIT)</source>
          , vol.
          <volume>6</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>333</fpage>
          -
          <lpage>355</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>D.</given-names>
            <surname>Mattox</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. T.</given-names>
            <surname>Maybury</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Morey</surname>
          </string-name>
          , “
          <article-title>Enterprise expert and knowledge discovery</article-title>
          .”
          <source>in HCI (2)</source>
          ,
          <year>1999</year>
          , pp.
          <fpage>303</fpage>
          -
          <lpage>307</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>N.</given-names>
            <surname>Craswell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hawking</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.-M. Vercoustre</surname>
            , and
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Wilkins</surname>
          </string-name>
          , “P@
          <article-title>noptic expert: Searching for experts not just for documents,” in Ausweb Poster Proceedings</article-title>
          , Queensland, Australia,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>D.</given-names>
            <surname>Kempe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kleinberg</surname>
          </string-name>
          , and v. Tardos, “
          <article-title>Maximizing the spread of influence through a social network,” in Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining</article-title>
          .
          <source>ACM</source>
          ,
          <year>2003</year>
          , pp.
          <fpage>137</fpage>
          -
          <lpage>146</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>K.</given-names>
            <surname>Balog</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Fang</surname>
          </string-name>
          , M. de Rijke,
          <string-name>
            <given-names>P.</given-names>
            <surname>Serdyukov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Si</surname>
          </string-name>
          et al.,
          <source>“Expertise Retrieval,” Foundations and Trends in Information Retrieval</source>
          , vol.
          <volume>6</volume>
          , no.
          <issue>2-3</issue>
          , pp.
          <fpage>127</fpage>
          -
          <lpage>256</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>N. S.</given-names>
            <surname>Shami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. C.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cosley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Xia</surname>
          </string-name>
          , and G. Gay, “
          <article-title>That's what friends are for: facilitating'who knows what'across group boundaries,” in Proceedings of the 2007 international ACM conference on Supporting group work</article-title>
          .
          <source>ACM</source>
          ,
          <year>2007</year>
          , pp.
          <fpage>379</fpage>
          -
          <lpage>382</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>K.</given-names>
            <surname>Ehrlich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.-Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          , and V. Griffiths-Fisher, “
          <article-title>Searching for experts in the enterprise: combining text and social network analysis,” in Proceedings of the 2007 international ACM conference on Supporting group work</article-title>
          .
          <source>ACM</source>
          ,
          <year>2007</year>
          , pp.
          <fpage>117</fpage>
          -
          <lpage>126</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>H.</given-names>
            <surname>Fang</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          , “
          <article-title>Probabilistic models for expert finding</article-title>
          ,” in Advances in Information Retrieval. Springer,
          <year>2007</year>
          , pp.
          <fpage>418</fpage>
          -
          <lpage>430</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>S.</given-names>
            <surname>Momtazi</surname>
          </string-name>
          and
          <string-name>
            <given-names>F.</given-names>
            <surname>Naumann</surname>
          </string-name>
          , “
          <article-title>Topic modeling for expert finding using latent Dirichlet allocation</article-title>
          ,”
          <source>Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery</source>
          , vol.
          <volume>3</volume>
          , no.
          <issue>5</issue>
          , pp.
          <fpage>346</fpage>
          -
          <lpage>353</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>N.</given-names>
            <surname>Craswell</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. P. de Vries</surname>
            ,
            <given-names>and I. Soboroff</given-names>
          </string-name>
          , “
          <article-title>Overview of the TREC 2005 Enterprise Track</article-title>
          .” in Trec, vol.
          <volume>5</volume>
          ,
          <issue>2005</issue>
          , pp.
          <fpage>199</fpage>
          -
          <lpage>205</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18. I.
          <string-name>
            <surname>Soboroff</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. P. de Vries</surname>
            , and
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Craswell</surname>
          </string-name>
          , “
          <article-title>Overview of the TREC 2006 Enterprise Track</article-title>
          .” in Trec,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <given-names>P.</given-names>
            <surname>Bailey</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. P. De Vries</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Craswell</surname>
            ,
            <given-names>and I. Soboroff</given-names>
          </string-name>
          , “
          <article-title>Overview of the TREC 2007 Enterprise Track</article-title>
          .”
          <string-name>
            <surname>in</surname>
            <given-names>TREC</given-names>
          </string-name>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <given-names>K.</given-names>
            <surname>Balog</surname>
          </string-name>
          , P. Thomas,
          <string-name>
            <given-names>N.</given-names>
            <surname>Craswell</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Soboroff</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bailey</surname>
          </string-name>
          , and
          <string-name>
            <surname>A. P. De Vries</surname>
          </string-name>
          , “
          <article-title>Overview of the TREC 2008 enterprise track</article-title>
          ,
          <source>” DTIC Document, Tech. Rep.</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>