<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>ARXIV.</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.48550/ARXIV</article-id>
      <title-group>
        <article-title>Using vector representations for matching tasks to skills</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Miriam Amin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jan-Peter Bergmann</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yuri Campbell</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Fraunhofer Center for International Management and Knowledge Economy (IMW)</institution>
          ,
          <addr-line>Neumarkt 9-19, 04109 Leipzig</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>1908</year>
      </pub-date>
      <volume>10084</volume>
      <fpage>18</fpage>
      <lpage>23</lpage>
      <abstract>
        <p>Science, Technology and Innovation (ST&amp;I) companies as well as large research organizations are repeatedly facing the problem of matching an emerging task with the appropriate skill that is present somewhere in an organizational unit. Many organizations already have skill or competence taxonomies that can be useful in this regard. In this working paper, we present our experiments on automatically recommending suitable skills from the internal skill taxonomy of the Fraunhofer Society research organization to incoming research requests in order to support human decision making processes. We applied three diferent vector-based approaches for this end, one based on language models, one on word embeddings and one on a simple one-hot-encoding of keywords. Our results show that the language-model-based approach outperforms the other methods and is able to recommend skills to research requests with an MAP of 0.82. These first findings pave the way for further improvements of our method and for the transfer to other related problems.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Recommender Systems</kwd>
        <kwd>Knowledge Management</kwd>
        <kwd>Skill Taxonomy</kwd>
        <kwd>Competence Taxonomy</kwd>
        <kwd>Task-Skill Matching</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <sec id="sec-1-1">
        <title>Research request</title>
        <p>We are searching for a solution to link a smart
metering system of high-resolution electricity,
gas and heat data with our intelligent cloud
solution. In the cloud, we want to
automatically process the data using machine
learning to check for consistency and
completeness and to enable load forecasts and cost
optimization. We are also looking for the
joint development of innovative business
models.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Methods</title>
      <p>
        In order to support the matching between research
re2.1. Data and Preprocessing quests and in-house skills in large organizations, we
propose a vector-based approach, which draws from recent
The Fraunhofer Society combines a wide variety of spe- Transfer Learning advances in Natural Language
Processcialized institutes under one umbrella. To handle this ing. Firstly, we represent the skills in the taxonomy with
variety of skills contained in the diferent institutions, a vector model. Then, with the same vector
representhe Fraunhofer Society developed an overview of its al- tation approach, we transform the requests and project
ready existing competences as well as prospective ones. them into the same vector space. Finally, every research
It is planned that employees will be able to subscribe request acts as a query for which we retrieve matching
to the skills and topics that interest them, i.e. skills are documents. In this Information Retrieval setting, we
renot automatically assigned to employees. Based on their turn the − closest skill-vectors to a specific query vector
individual selections, employees can then receive rele- as matches for that request.
vant messages and notifications about incoming research In this framework, we test three distinct approaches to
requests. These skills are hierarchically structured in a create useful vector representations for the task at hand.
taxonomy with a tree-like structure with four levels: the They are Keyword-Binarizer (KB), Keyword-Embedding
root, the first level: scientific disciplines, the second level: (KE) and Language Model (LM). In the KB approach,
their research fields, and finally, the skills are the leaves we extract keywords using the keyword extraction
alin this skill-tree. gorithm YAKE! [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] from the text description of skills
      </p>
      <p>The entire dataset includes approximately 1.000 skills and requests, then a binary vector is constructed in an
that are either written in German, English or mixed En- one-hot-encoding manner for all skills and requests. It
glish and German. Moreover, disciplines and research is important to note here that YAKE! extracts keywords
ifelds as well have similar language composition in their as well as keyphrases (the combination of two or more
description. That means, even when a leaf is described in words). From now on in the text, we will refer to both as
the English language, as Machine Learning, its research keywords only.
ifeld Künstliche Intelligenz can be written in German, and In the KE vector model, the texts undergo the same
vice versa. In order to give more contextual information keyword extraction procedure as in KB. However, the
fito single skills, we concatenate skill, research field and nal step for the construction of the vector representation
scientific discipline to build one textual representation is diferent. Here, given a skill or a request, we create
for every skill in this way. These preprocessed skills have the corresponding vector representation by averaging
an average length of 128 characters. Table 1 shows an the Word2Vec embeddings of the keywords belonging to
example of a skill hierarchy and the concatenated skill that skill/request. We use Word2Vec word-embeddings,
string. In this specific case, all levels are in English. which were trained by Deepset1 on the whole German</p>
      <p>On the other side, research requests are short texts Wikipedia corpus. In cases where the vector
representaof approximately 1.112 characters in length. Since they tions for a specific word is not found in the embedding
come from diferent authors, they are very diverse both dictionary, we apply compound splitting and a vector
structurally and stylistically. Also, they cover a large retrieval is attempted for the resulting components. This
variety of research fields and can be German or English, procedure is specially useful for German, since many
but mainly German. Our experimental corpus of research German words have a compositional structure, for
exrequests conveys approximately 100 documents. Table 2
shows an example of such a research request. 1https://www.deepset.ai/german-word-embeddings</p>
      <sec id="sec-2-1">
        <title>Sampling method</title>
        <p>ample Forschungsprojekt = Forschung (research) +
Projfeokutn(dprroejceecitv)e. Wa0o−rdvsefcotrowr, hwihchicnhoprreapctriecsaelnlytactaionnceclasnanbye Method STNoiDmpCilaGritiesMAP NDCEGxpertMAP NDCG
impact they might have on the average representation. LM 0.70 0.89 0.63 0.76 0.67</p>
        <p>
          Finally, in the LM approach, we use a multilingual KE 0.25 0.37 0.13 0.16 0.19
language model which is fine-tuned on the task KB 0.28 0.39 0.15 0.28 0.21
of semantic similarity. More precisely, we use the
model paraphrase-multilingual-mpnet-v2, Table 3
provided by Sentence-Transformers 2. This model NDCG@5 and MAP values for the three vectorization
methis suitable for creating vector representations ods and the two sampling methods. LM - Language Model,
of sentences and paragraphs for information re- KE - Keyword-Embeddings, KB - Keyword-Binarizer
trieval, clustering or sentence similarity tasks3. The
model paraphrase-multilingual-mpnet-v2
is the multilingual version of the original for the request, ’1’ when it was not completely relevant,
model all-mpnet-base-v2. The model but also not irrelevant and ’0’ when it was completely
paraphrase-multilingual-mpnet-v2 is trained via irrelevant.
multilingual knowledge distillation [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. In other words, We took two samples of ten requests, each with a
difa smaller multilingual model, in this case XLM-RoBERTa ferent sampling method. In the sampling method ’expert’,
[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], is used as the student model, while a bigger MPNET we selected ten requests in which the authors of this
pa[8] monolingual model is used to guide the multilingual per themselves have expert knowledge of the required
vector representations of translated pairs by means skills - resulting in ten IT and AI related requests. For the
of a double mean squared error loss on the generated sampling method ’top similarities’, we considered the top
representations for the multilingual training pair. The ifve skills with the highest similarity scores for each
repre-trained monolingual teacher model MPNET was quest. We then took the mean of these top five similarity
ifne-tuned with SBERT-like objective [ 9] on more than 1 scores. For each vectorization method, we then selected
billion pairs of sentences/paragraphs4. The pre-training the top ten request with the highest mean similarities.
objective of the teacher model is an usual contrastive Note that the ’top similarities’ sample sets difer among
learning objective. That means, for a given pair of sen- the methods. In addition, we calculated the mean value
tences, or paragraphs or sentence-paragraph, the model from the ’expert’ and the ’top similarities’ sample.
predicts which, out of a set of randomly constructed With 20 relevance assessments for each method, we
pairs with at least one component of the original pair, were able to calculate the Normalized Discounted
Cumuwere actually paired in the billion dataset. In our use lative Gain@5 (NDCG@5) and the Mean Average
Precicase, just the trained student model is used in order to sion (MAP) for each system. In order to calculate these
create multilingual vector representations for skills and measures despite the missing ground truth, we assumed
requests. Both require no further pre-processing steps that there are five matching skills for each request. In
before as the XLM-RoBERTa model has SentencePiece order to calculate the MAP, which requires a binary
releas its base tokenizer and it was previously pre-trained in vance, we considered the relevance labels ’1’ and ’2’ as
many languages, among them English and German as relevant and ’0’ as irrelevant.
well.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Mean</title>
        <p>2.3. Validation
In order to validate the three approaches described in the
preceding section, we took two diferent samples of the
request corpus, retrieved the top five skill
recommendations from each method and assessed the relevance.</p>
        <p>For the experiments at hand, we needed to conduct the
relevance assessment manually. In the near future,
however, a completely expert-labeled ground truth dataset
will be at our hand, recording all relevant skills for each
request. We labeled a request-skill-pair with the
relevance value ’2’ when the skill was completely relevant
2https://www.sbert.net/docs/pretrained_models.html
3https://huggingface.co/sentence-transformers/all-mpnet-base-v2
4https://huggingface.co/sentence-transformers/all-mpnet-base-v2</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Results</title>
      <p>The purpose of our experiment was to find out which
NLP method yields the best results for the task of
recommending skills from a standardised skill ontology to
a specific task or request. Table 3 shows an overview of
the NDCG@5 and the MAP scores obtained during our
experiments.</p>
      <p>From the data, it is apparent that the language
modelbased method yielded by far the best results. Over all
samples, the language model achieved an impressive MAP of
0.82 and and NDCG of 0.67. The other two methods are
far behind.</p>
      <p>To illustrate the findings of these first experiments, we
show the top five skill recommendations of each method</p>
      <sec id="sec-3-1">
        <title>Before prompt engineering</title>
      </sec>
      <sec id="sec-3-2">
        <title>After prompt engineering</title>
        <p>Simulation, control and
operational management of energy
supply systems Field of
competence energy informatics
AI-based autonomous actions
We work on AI-based
autonomous actions. Our field
of competence is energy
informatics, within the research
field of simulation, control
and operational management
of energy supply systems</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Discussion</title>
      <p>The results of these preliminary experiments are very
satisfactory. We have shown that our language-model-based
method in particular performed very well for matching
skills to specific tasks. That was somewhat surprising
against the background that the skills have a
comparatively short text length and thus do not provide much
context for the language model to compute semantic
similarities. Equally surprising was that the
word-embeddingbased method (KE), which were supposed to perform well
even without context, showed such poor performance.
We suspect that this is due to the rather technical
vocabulary in both the skills and the requests that is not present
in our word embedding vocabulary. Our attempt to
counteract this with the compound splitting described above
does not seem to have achieved the expected results.</p>
      <p>Nevertheless, we are convinced that the performance
- particularly that of the LM approach - can still be
improved by further tuning. In future work, we want to
experiment with further text preprocessing and prompt
engineering methods. For example, we are interested
how the transformation of the skill string into a
reallanguage sentence impacts the performance. For this,
a sentence template with slots for the hierarchical
elements of the skill string can be used. Table 4 shows
an example of such a transformed string. With such a
transformation, we hope to provide even more context to
the Language Model, especially to the attention
mechanism. Moreover, LMs are trained and optimized on whole
natural sentences, not on syntaxless word groups.</p>
      <p>Again, we should address that the sample size of this
experiment is still rather small and results need to be
conifrmed as soon as the entire dataset of research requests
was labelled with the matching skills.</p>
      <p>We also hope to make further improvements to our
approach with such a ground truth at hand. Not only would
this allow us to calculate more evaluation measures, such
as precision@k and F1@k, we could also fine-tune the
vector-space model. With contrastive learning, we could
optimize the vector space in a way that requests move
closer to the matching skills and further away from the
mismatching skills, hoping that this new vector space is
transferable to unknown requests.</p>
      <p>Last, and maybe most importantly, we want to
explore the transferability of our method to other, related
problems. These are, e.g., recommending skills for more
general tasks and work assignments or even finding the
worker or team with the optimal skill set for requests,
tasks and work assignments.</p>
      <p>However, it remains very important to mention that
such recommender systems are only useful and properly
utilized when they are designed to support an essentially
human-driven decision-making process.</p>
      <sec id="sec-4-1">
        <title>Language</title>
      </sec>
      <sec id="sec-4-2">
        <title>Model</title>
      </sec>
      <sec id="sec-4-3">
        <title>Keyword</title>
      </sec>
      <sec id="sec-4-4">
        <title>Embedding</title>
      </sec>
      <sec id="sec-4-5">
        <title>Keyword</title>
      </sec>
      <sec id="sec-4-6">
        <title>Binarizer</title>
        <p>We are searching for a solution to link a smart metering system of
highresolution electricity, gas and heat data with our intelligent cloud solution.
In the cloud, we want to automatically process the data using machine
learning to check for consistency and completeness and to enable load
forecasts and cost optimization. We are also looking for the joint
development of innovative business models.</p>
      </sec>
      <sec id="sec-4-7">
        <title>Rank</title>
      </sec>
      <sec id="sec-4-8">
        <title>Research field</title>
      </sec>
      <sec id="sec-4-9">
        <title>Skill</title>
      </sec>
      <sec id="sec-4-10">
        <title>Assessment Label</title>
        <p>1
2
3
4
5
1
2
3
4
5
1
2
3
4
5</p>
        <p>Energy Information
Technology
Energy Information
Technology
Economic and regulatory
assessment
Energy Information
Technology
Energy Information
Technology
Storage &amp; storage
systems
Lightweight construction
technologies
Power grids
Artificial Intelligence
Methods
Artificial Intelligence
Methods
Module manufacturing/
integration
Process
Technologies
Component
manufacturing
Component
manufacturing
Component packaging,
module manufacturing/
integration</p>
        <sec id="sec-4-10-1">
          <title>Data Science, Statistics, Time Series Analyses, AI/ML</title>
        </sec>
        <sec id="sec-4-10-2">
          <title>Data Management</title>
        </sec>
        <sec id="sec-4-10-3">
          <title>Energy system analyses</title>
        </sec>
        <sec id="sec-4-10-4">
          <title>AI-based methods of optimized,</title>
          <p>predictive network operation
management
Standards and interfaces for
interoperable communication</p>
        </sec>
        <sec id="sec-4-10-5">
          <title>Integration of new storage</title>
          <p>systems
Functional integration in
lightweight construction
Modeling of power grids
Generation of Synthetic
Training Data
AI Technologies in
Production &amp; Logistics</p>
        </sec>
        <sec id="sec-4-10-6">
          <title>Packaging for RF and analog mixed-signal modules</title>
        </sec>
        <sec id="sec-4-10-7">
          <title>Epitaxy</title>
        </sec>
        <sec id="sec-4-10-8">
          <title>High- and ultra-highfrequency components (High-Frequency Devices)</title>
        </sec>
        <sec id="sec-4-10-9">
          <title>Actuators, MEMS actuators</title>
          <p>Display, RFID packaging
2
2
2
1
2
0
0
0
0
1
0
0
0
0
0
1911.02116.
[8] K. Song, X. Tan, T. Qin, J. Lu, T.-Y. Liu, Mpnet:
Masked and permuted pre-training for language
understanding, 2020. URL: https://arxiv.org/abs/2004.
09297. doi:10.48550/ARXIV.2004.09297.
[9] N. Reimers, I. Gurevych, Sentence-bert:
Sentence embeddings using siamese bert-networks,
2019. URL: https://arxiv.org/abs/1908.10084. doi:10.</p>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>C.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jiang</surname>
          </string-name>
          , E. Chen,
          <string-name>
            <given-names>H.</given-names>
            <surname>Xiong</surname>
          </string-name>
          ,
          <article-title>Enhancing person-job fit for talent recruitment</article-title>
          , in: K. Collins-Thompson (Ed.),
          <source>The 41st International ACM SIGIR Conference on Research &amp; Development in Information Retrieval</source>
          , ACM Conferences, ACM, New York, NY,
          <year>2018</year>
          , pp.
          <fpage>25</fpage>
          -
          <lpage>34</lpage>
          . doi:
          <volume>10</volume>
          .1145/3209978.3210025.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sigdel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , P. Hoang, M. Liu,
          <string-name>
            <given-names>M.</given-names>
            <surname>Korayem</surname>
          </string-name>
          ,
          <article-title>Embedding-based recommender system for job to candidate matching on scale</article-title>
          ,
          <year>2021</year>
          . URL: https://arxiv.org/pdf/2107.00221.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Lavi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Medentsiy</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          <article-title>Graus, consultantbert: Finetuned siamese sentence-bert for matching jobs and job seekers</article-title>
          ,
          <source>in: The Workshop on Recommender Systems for Human Resources (RecSys in HR 2021)</source>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M. H.</given-names>
            <surname>Jarrahi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Askay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Eshraghi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Smith,</surname>
          </string-name>
          <article-title>Artificial intelligence and knowledge management: A partnership between human and ai</article-title>
          , Business
          <string-name>
            <surname>Horizons</surname>
          </string-name>
          (
          <year>2022</year>
          ). doi:
          <volume>10</volume>
          .1016/j.bushor.
          <year>2022</year>
          .
          <volume>03</volume>
          .002.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>R.</given-names>
            <surname>Campos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Mangaravite</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pasquali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jorge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Nunes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jatowt</surname>
          </string-name>
          ,
          <article-title>Yake! keyword extraction from single documents using multiple local features</article-title>
          ,
          <source>Information Sciences 509</source>
          (
          <year>2020</year>
          )
          <fpage>257</fpage>
          -
          <lpage>289</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.ins.
          <year>2019</year>
          .
          <volume>09</volume>
          .013.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>Making monolingual sentence embeddings multilingual using knowledge distillation, 2020</article-title>
          . URL: https://arxiv.org/abs/
          <year>2004</year>
          .09813. doi:
          <volume>10</volume>
          .48550/ARXIV.
          <year>2004</year>
          .
          <volume>09813</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Conneau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Khandelwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Chaudhary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Wenzek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Guzmán</surname>
          </string-name>
          , E. Grave,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          ,
          <article-title>Unsupervised cross-lingual representation learning at scale</article-title>
          ,
          <year>2019</year>
          . URL: https:
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>