<!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>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>within a Digital Study Planning Assistant</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Tobias Hirmer</string-name>
          <email>tobias.hirmer@uni-bamberg.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michaela Ochs</string-name>
          <email>michaela.ochs@uni-bamberg.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andreas Henrich</string-name>
          <email>andreas.henrich@uni-bamberg.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Digital Study Planning Assistant, Vertical Search, Search Scenarios, Recommendation Systems</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>LWDA'23: Lernen</institution>
          ,
          <addr-line>Wissen, Daten, Analysen</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Bamberg, Chair of Media Informatics</institution>
          ,
          <addr-line>An der Weberei 5, 96047 Bamberg</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <abstract>
        <p>The process of study planning can be complex and challenging for students. Due to decentralized information and complex study structures, a demand for individualized assistance arises. Search functionality plays an essential role in providing such support to the students in various ways. Therefore, we introduce the vertical search scenario of a digital study planning assistant (DSPA), which is currently developed, as a promising area of research for the information retrieval community. As a main contribution, we explore four exemplary search scenarios, including major challenges and potential solutions for each.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
ceur-ws.org</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        Due to the various ways in which modules can be applied to current study programs, students
face a multitude of potential paths they can choose before attaining their degree. In order to
support their individual decision process, eficient and efective retrieval of study-planning
related resources provided by the university is an essential aspect. However, the findability
and quality of these resources are not always ideal [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Apart from this, the resources do not
consider the individual students’ backgrounds and prior knowledge [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Sophisticated search
functionality, integrated into a digital study planning assistant (DSPA), may address these issues
and allow for more efective study planning, tailored to the students’ goals such as competency
or career goals. We think that this application domain forms an interesting new scenario of a
vertical search application that has been little explored so far.
      </p>
      <p>
        Projects that seek to support individual study planning have developed throughout recent
years, yet the aspect of what role search plays within these applications is often unclear.
As an early digital study assistant project, SIDDATA connects various data sources in order
to support individual and goal-based studying [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Another project which aims to support
individual study planning is AI Study Buddy [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Further research is focusing on goal-oriented
nEvelop-O
LGOBE
CEUR
Workshop
Proceedings
htp:/ceur-ws.org
ISN1613-073
      </p>
      <p>
        CEUR Workshop Proceedings (CEUR-WS.org)
recommendations [
        <xref ref-type="bibr" rid="ref2 ref5">5, 2</xref>
        ]. While Jiang et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] used diferent models of LSTM to predict next
suitable courses, Basavaraj and Garibay [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] analyzed curriculum structure in combination with
student performance data to generate personalized recommendations.
      </p>
      <p>
        As a focus of this research, we would like to present relevant vertical search scenarios
that became apparent during the work towards a DSPA at the University of Bamberg [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
This DSPA is named BAULA as an acronym for “Bamberger Assistentin zur Unterstützung
der Lehrveranstaltungskoordination und -auswahl” (engl. “Bamberg assistant for supporting
course coordination and selection”). We think that these search scenarios represent challenging
research opportunities for the information retrieval community. In the following, we will first
describe the DSPA application and its data sources. Second, we will introduce four major search
scenarios within this vertical, explore related obstacles, and suggest possible solutions. Last, we
will address overall challenges of this research and conclude.
      </p>
    </sec>
    <sec id="sec-3">
      <title>2. The Digital Study Planning Assistant BAULA</title>
      <p>
        To assist the aforementioned findability of information and to support students in shaping their
studies, a DSPA is developed within two projects at the University of Bamberg. The concept of
this DSPA is depicted in Fig. 2. The general goal of it is to support students in the whole process
of study planning, including tasks such as searching for suitable courses and modules as well
as deciding when to attend these. Besides supporting students, the DSPA might also provide
further support for academic advising, and monitoring features for study program responsibles
and lecturers. To address the main goal of supporting students, the DSPA provides four core
functions based on requirements that were elicited previously [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ]:
• The Dashboard ofers students an overview over their current study path as well as
relevant statistics like their average grade.
• The Interactive Module Handbook extends the current PDF-based handbook with
interactivity like a faceted search and details on demand.
• The planning of the current semester is supported by the Short-term Semester Planning.
      </p>
      <p>
        Here, a course search as well as a timetable function is provided.
• In contrast to the existing projects mentioned earlier, our approach also includes a function
to support the Long-term Study-Planning. Here, students are encouraged to plan beyond
the current semester by providing hints on relevant prerequisites, for example.
Besides this core system, the DSPA is modular extendable to enable further functionality. Two
possible extensions are Competency Visualization [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and Recommender Systems [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>The process of study planning requires data from various sources and university systems.
For the Dashboard, personalized and aggregated data about individual and cohort student data
from the Data Warehouse and the Exam Administration System is necessary to generate helpful
information. The study structure comes from the Exam Administration System. It contains
detailed information about modules and their hierarchical structure within a study program,
which are used to visualize the interactive module handbook. Moreover, the study structure is
required to enable long-term study planning on module level. For short-term semester planning,
the Course Administration System is integrated via an interface to retrieve course-specific data
such as room and timetable information.</p>
    </sec>
    <sec id="sec-4">
      <title>3. Search Scenarios within a DSPA</title>
      <p>Within the DSPA described above, four exemplary search scenarios can be identified as
interesting research areas. These scenarios will be described in more detail in the following section.
They aim to facilitate goal-oriented studying that encourages students to make self-determined
and informed decisions. By providing efective search functionalities, the DSPA can assist
students in navigating their study path efectively.</p>
      <p>
        A central theoretical concept that is related to this goal is the concept of competency. Following
the conceptual understanding of [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], we define competency as a combination of a specific,
domain-bound content and a taxonomy level, which represents the extent to which a certain
content is acquired. Here, we apply Bloom’s taxonomy [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] that was revised by Anderson [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]
and defines six levels of complexity that are described by the action verbs remember, understand,
apply, analyze, evaluate and create. In contrast, by content, we define a specific thematic item
that is taught within the context of a module. In the following paragraphs, we first introduce
search scenarios which are related to competency-related search. Then, we introduce a use case
that is based on module content and last, we illustrate a use case that unites both aspects.
      </p>
      <sec id="sec-4-1">
        <title>3.1. Refining Search with Bloom Taxonomy Levels</title>
        <p>Scenario: A central research area that is relevant to the context of the DSPA is not only
searching for contents of a module (content-based retrieval), but searching for a module that
addresses a specific level of competence ( competence-based retrieval). In the former approach,
the classic module retrieval scenario, results may be retrieved based on their content and thus
concrete thematic units such as “breadth first search”. In contrast, the latter approach of retrieval
relies not only on the content, but a combination of the content and a taxonomy level, for
example “breadth first search” + “implement”. By creating the possibility of competence-based
search within the DSPA, students are supported by a more precise search for modules, which
may be realized as a filter in the form of faceted search or a ranking factor for the results.
Challenges: A challenge in this respect is the varied representation of Bloom’s taxonomy
information in the module descriptions. While standard sets of (verb) operators might be provided
by the university to formulate learning outcomes in the descriptions, module descriptions may
contain verbs that have not been provided by these guidelines or the relevant competency details
are often contained not only in (nominalized) verbs, but also in adverbs and more complex
phrases, partly split within the sentence. For certain contents, competence information might
not even be present in the sentence at all. Another challenge is that operators are not exclusively
assigned to only one taxonomy level, but can appear within several levels.</p>
        <p>Solution approaches: Natural language processing techniques such as language models may
capture the semantic meaning of the competencies rather independent of the concrete words
that are used in the competencies and thus, word variation and ambiguity in the assignment of
verbs to a certain level of taxonomy could be addressed based on similarity. Also, a more detailed
analysis of the syntactic and semantic structure via text/dependency parsing and rule-based
techniques could prove to be helpful.</p>
      </sec>
      <sec id="sec-4-2">
        <title>3.2. Goal-Based Search</title>
        <p>
          Scenario: Goal-based search may be implemented in various ways. A first approach would
be having students define their own study goals and what they want to learn in textual form
within the DSPA (e. g. during the onboarding process). A second approach would be having
students choose goals from an existing competency standard they can select such as [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. Based
on the input given in these two approaches, modules can be retrieved and recommended.
Challenges: A central challenge in the success of this approach is addressing the vocabulary
mismatch, which appears in both scenarios – student vocabulary vs. module vocabulary as
well as competency standard vocabulary vs. module vocabulary. Students may use diferent
words or search for more concrete items that may not be contained in the more general module
descriptions (e. g. React vs. Web-Frameworks). Also, their input can have various forms such as
lists of topics or more detailed explanations. Competency standards often use more abstract
terms than module descriptions. Further dificulties are related to extracting the information
from the competence standards automatically. Also, the assignment of verbs to taxonomy levels
difers across study programs. A specific taxonomy for CS students is e. g. given by [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
Solution approaches: In order to address the vocabulary mismatch, the module as well as
the competence vocabulary may be extended (e. g. Linked Open Data) to give more context,
that aligns both vocabularies. Moreover, transformer-based models like BERT [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] might also
be adaptable to match module contents with competence descriptions. For the diferent forms
of student inputs, query expansion may also be helpful.
        </p>
      </sec>
      <sec id="sec-4-3">
        <title>3.3. Search with Job Descriptions</title>
        <p>Scenario: An interesting research scenario within the context of the DSPA involves
searching with job descriptions. Considering their long-term study plans, students may input job
descriptions into the DSPA, that can use this information to recommend relevant modules to
the students. The job descriptions may be provided either as raw textual input or through a
convenient drag and drop feature.</p>
        <p>
          Challenges: One of the primary challenges in this scenario is the vocabulary mismatch
between job portals and academic documents. This issue has been previously recognized and
studied [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. On one hand, job descriptions, particularly those related to computer science,
tend to employ more concrete language and often mention specific tools or technologies. On
the other hand, module descriptions in an academic context often take a more abstract or
comprehensive approach, providing a broader understanding of the module’s content. They
further may also not be aligned with the current market situation and requirements.
Solution approaches: In order to overcome the vocabulary mismatch, several potential
solutions can be considered. One approach involves using embeddings, which represent textual
information as vectors, thereby abstracting from the individual terms. This allows for a more
thorough analysis of the semantic meaning behind the text. Additionally, the utilization of
terminological reference sources such as ontologies or Linked Open Data (e. g. Wikipedia) can
be beneficial in addressing this challenge. These approaches can help establish connections
between terms from diferent domains, enabling the DSPA to bridge the gap between job
descriptions and module descriptions more efectively.
        </p>
      </sec>
      <sec id="sec-4-4">
        <title>3.4. Search for Advanced and Related Modules</title>
        <p>
          Scenario: Another search scenario might be that students aim to search for modules that
deepen the understanding of a specific, already successfully completed module or search for
related modules that are similar to this module. Therefore, module contents might be represented
as paths within a knowledge graph (e. g. WikiData) or as embedding in a vector space (e. g.
word2vec/doc2vec). Modules can be (inter)connected on various levels, making it challenging
to explore the hierarchical structure and to concretely define the relation between two modules.
Challenges: A main challenge is to define if a relation between two modules exists and how
it can be categorized. Modules can contribute to each other, covering similar topics or give a
more thorough understanding of a specific aspect. It is important to define this relation and
further discuss possible solutions on how these relations can be identified. The relation between
modules might also be afected by the study program of the requesting student.
Solution approaches: Similarity of modules can be identified using word embeddings on
learning materials [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. To identify advanced modules, that deepen the knowledge provided by
a specific module, integrating the search for competence level as described before can contribute
to a solution. Since these competence levels are organized sequentially as well, an advanced
module can be identified searching for the topics of a specific module with a higher competence
level. To further categorize diferent relations between modules, a graph-based approach might
be applicable. As mentioned, the contents of a module can be represented as a knowledge graph.
One assumption might be, that advanced modules expand the leaves (topics) of the queried
module, whereas related modules contribute to the parent nodes of the leaves.
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>4. Data and Challenges</title>
      <p>
        Beyond the already described scenario-specific challenges, this section will shortly address
further challenges covering data issues and self-organizing skills. As previously mentioned, the
data provided by the university is insuficient to meet the current need for personalization [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
Additionally, quality is reduced due to a variety in the extent and wording of module and course
information, which is highly dependent on the specific lecturer. Besides poor data quality,
quantity and accessibility of data is challenging. To the best of our knowledge, large-scale
corpora of (German) module catalogs currently do not exist in the form of one large data set,
but are spread across university websites and repositories.
      </p>
      <p>
        Besides challenges regarding the data, the DSPA and the respective search scenarios need to
assist without directly guiding students too much. Assistance should not lead to help students
the easiest way through study or making study planning obsolete limiting the self-organization
skills of students. Also, the influence of more information on modules or courses (e. g. grade
distribution) might lead to negative efects like a reduced grade [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. Here the described search
scenarios above should help students in making a more informed and conscious decision,
without taking too much responsibility from them.
      </p>
    </sec>
    <sec id="sec-6">
      <title>5. Conclusion</title>
      <p>While the four search scenarios described above each search for modules on the basis of
diferent information needs or diferent formulations of the information need, it is of course
also conceivable to search for other things in the scenario of a DSPA. An example would be
the search for Open Educational Resources (OER). This could be used, for example, to make
alternative suggestions as to how any missing prior knowledge could be acquired. For this
purpose, a pool would first have to be crawled and indexed on the basis of directories for OER.
Then, the question would be how to identify appropriate OER based on the required prior
knowledge listed in module descriptions. This further example of a search scenario in the
DSPA context illustrates the need for appropriate search services as well as the challenges for
information retrieval.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>This research was conducted as part of the projects “Developing Digital Cultures for Teaching”
(DiKuLe) and “Learning from Learners” (VoLL-KI) and was funded by “Stiftung Innovation in
der Hochschullehre” (Foundation for Innovation in Higher Education) as well as “Künstliche
Intelligenz in der Hochschulbildung” (Artificial Intelligence in Higher Education).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ochs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hirmer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Henrich</surname>
          </string-name>
          ,
          <article-title>Studierende und die Studienplanung: Untersuchung von Herausforderungen und Entwicklungsperspektiven eines digitalen</article-title>
          <source>Studienplanungsassistenten</source>
          ,
          <year>2023</year>
          . URL: https://doi.org/10.5281/zenodo.8037697.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>W.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z. A.</given-names>
            <surname>Pardos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <article-title>Goal-based Course Recommendation</article-title>
          ,
          <source>in: Proceedings of the 9th International Conference on Learning Analytics &amp; Knowledge, LAK19</source>
          , Association for Computing Machinery, New York, NY, USA,
          <year>2019</year>
          , pp.
          <fpage>36</fpage>
          -
          <lpage>45</lpage>
          . doi:
          <volume>10</volume>
          .1145/3303772. 3303814.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>C. M.</given-names>
            <surname>König</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Guhr</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. H.</given-names>
            <surname>Breitner</surname>
          </string-name>
          ,
          <article-title>Ein Anreizsystem zur erfolgreichen Implementierung eines digitalen Studienassistenten</article-title>
          , in: N.
          <string-name>
            <surname>Gronau</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Heine</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Poustcchi</surname>
          </string-name>
          , H. Krasnova (Eds.), WI2020 Community Tracks, GITO Verlag,
          <year>2020</year>
          , pp.
          <fpage>33</fpage>
          -
          <lpage>48</lpage>
          . doi:
          <volume>10</volume>
          .30844/wi\_
          <year>2020</year>
          \
          <article-title>_s3-koenig.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Wagner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Helal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Roepke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Judel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Doveren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Goerzen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Soudmand</surname>
          </string-name>
          , G. Lakemeyer,
          <string-name>
            <given-names>U.</given-names>
            <surname>Schroeder</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          ,
          <article-title>A Combined Approach of Process Mining and Rule-Based AI for Study Planning and Monitoring in Higher Education</article-title>
          , in: M.
          <string-name>
            <surname>Montali</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Senderovich</surname>
          </string-name>
          , M. Weidlich (Eds.),
          <source>Process Mining Workshops, Lecture Notes in Business Information Processing</source>
          , Springer Nature Switzerland, Cham,
          <year>2023</year>
          , pp.
          <fpage>513</fpage>
          -
          <lpage>525</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -27815-0\_
          <fpage>37</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>P.</given-names>
            <surname>Basavaraj</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Garibay</surname>
          </string-name>
          ,
          <string-name>
            <surname>A Personalized</surname>
          </string-name>
          ”
          <article-title>Course Navigator” Based on Students' Goal Orientation</article-title>
          , in: Proceedings of the 2018 ACM International Conference on Supporting Group Work, GROUP '18,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2018</year>
          , pp.
          <fpage>98</fpage>
          -
          <lpage>101</lpage>
          . doi:
          <volume>10</volume>
          .1145/3148330.3154508.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>T.</given-names>
            <surname>Hirmer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Etschmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Henrich</surname>
          </string-name>
          ,
          <article-title>Requirements and Prototypical Implementation of a Study Planning Assistant in CS Programs</article-title>
          , in: 2022
          <source>International Symposium on Educational Technology (ISET)</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>281</fpage>
          -
          <lpage>285</lpage>
          . doi:
          <volume>10</volume>
          .1109/ISET55194.
          <year>2022</year>
          .
          <volume>00066</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ochs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hirmer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Henrich</surname>
          </string-name>
          ,
          <article-title>Concept and Possible Impacts of a Study Planning Assistant in Higher Education</article-title>
          , in: 2023
          <source>International Symposium on Educational Technology (ISET)</source>
          ,
          <source>Hong Kong</source>
          ,
          <year>2023</year>
          . (in press).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>T.</given-names>
            <surname>Hirmer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Heyne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Henrich</surname>
          </string-name>
          ,
          <article-title>Die kompetenzorientierte Studienplanung - Entwicklung eines Tools zur Unterstützung von (Lehramts-</article-title>
          )
          <string-name>
            <surname>Studierenden</surname>
          </string-name>
          , in: DELFI 2021,
          <article-title>Gesellschaft für Informatik e</article-title>
          .V.,
          <string-name>
            <surname>Bonn</surname>
          </string-name>
          ,
          <year>2021</year>
          , pp.
          <fpage>121</fpage>
          -
          <lpage>126</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ochs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hirmer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Past</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Henrich</surname>
          </string-name>
          ,
          <article-title>Design-Focused Development of a Course Recommender System for Digital Study Planning</article-title>
          , in: A.
          <string-name>
            <surname>Abelló</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Vassiliadis</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <string-name>
            <surname>Romero</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Wrembel</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Bugiotti</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Gamper</surname>
            ,
            <given-names>G. Vargas</given-names>
          </string-name>
          <string-name>
            <surname>Solar</surname>
          </string-name>
          , E. Zumpano (Eds.),
          <source>New Trends in Database and Information Systems, Communications in Computer and Information Science</source>
          , Springer Nature Switzerland, Cham,
          <year>2023</year>
          , pp.
          <fpage>575</fpage>
          -
          <lpage>582</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -42941-5_
          <fpage>50</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>E.</given-names>
            <surname>Klieme</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Leutner</surname>
          </string-name>
          ,
          <article-title>Kompetenzmodelle zur Erfassung individueller Lernergebnisse und zur Bilanzierung von Bildungsprozessen. Beschreibung eines neu eingerichteten Schwerpunktprogramms der DFG</article-title>
          ,
          <source>Zeitschrift für Pädagogik</source>
          <volume>52</volume>
          (
          <year>2006</year>
          )
          <fpage>876</fpage>
          -
          <lpage>903</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>B. S.</given-names>
            <surname>Bloom</surname>
          </string-name>
          , Taxonomy of Educational Objectives,
          <string-name>
            <surname>McKay</surname>
          </string-name>
          , New York,
          <year>1968</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>L. W.</given-names>
            <surname>Anderson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Krathwohl</surname>
          </string-name>
          ,
          <article-title>A taxonomy for learning, teaching, and assessing: A revision of Bloom's taxonomy of educational objectives</article-title>
          ,
          <source>Longman</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>O.</given-names>
            <surname>Zukunft</surname>
          </string-name>
          , Empfehlungen für Bachelor- und
          <source>Masterprogramme im Studienfach Informatik an Hochschulen</source>
          ,
          <year>2016</year>
          . URL: https://dl.gi.de/handle/20.500.12116/2351.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>U.</given-names>
            <surname>Fuller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. G.</given-names>
            <surname>Johnson</surname>
          </string-name>
          , T. Ahoniemi,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cukierman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Hernán-Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Jackova</surname>
          </string-name>
          , E. Lahtinen,
          <string-name>
            <given-names>T. L.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. M.</given-names>
            <surname>Thompson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Riedesel</surname>
          </string-name>
          , E. Thompson,
          <article-title>Developing a computer science-specific learning taxonomy</article-title>
          , in: Working Group Reports on ITiCSE on Innovation and Technology in Computer Science Education, ITiCSE-WGR '
          <fpage>07</fpage>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2007</year>
          , p.
          <fpage>152</fpage>
          -
          <lpage>170</lpage>
          . URL: https: //doi.org/10.1145/1345443.1345438. doi:
          <volume>10</volume>
          .1145/1345443.1345438.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          , arXiv preprint arXiv:
          <year>1810</year>
          .
          <volume>04805</volume>
          (
          <year>2018</year>
          ). arXiv:
          <year>1810</year>
          .04805.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>C.</given-names>
            <surname>Gallardo Pérez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. González</given-names>
            <surname>Eras</surname>
          </string-name>
          ,
          <string-name>
            <surname>P. Quezada S.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Ludeña</surname>
          </string-name>
          <string-name>
            <surname>González</surname>
          </string-name>
          ,
          <article-title>Comparing competences on academia and occupational contexts based on similarity measures</article-title>
          ,
          <source>in: WEBIST 2015 : 11th International Conference on Web Information Systems and Technologies : Proceedings</source>
          , Scitepress, Setúbal, Portugal,
          <year>2015</year>
          , pp.
          <fpage>540</fpage>
          -
          <lpage>546</lpage>
          . doi:
          <volume>10</volume>
          .5220/0005491405400546.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>N.</given-names>
            <surname>Seidel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. M.</given-names>
            <surname>Rieger</surname>
          </string-name>
          , T. Walle,
          <article-title>Semantic Textual Similarity of Course Materials at a Distance-Learning University</article-title>
          , in: CSEDM@EDM,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>C.</given-names>
            <surname>Holman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. J.</given-names>
            <surname>Aguilar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Levick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Stern</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Plummer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Fishman</surname>
          </string-name>
          ,
          <article-title>Planning for success: How Students Use a Grade Prediction Tool to Win Their Classes</article-title>
          , in: J.
          <string-name>
            <surname>Baron</surname>
            , G. Lynch,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Maziarz</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Blikstein</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Merceron</surname>
          </string-name>
          , G. Siemens (Eds.),
          <source>Proceedings of the Fifth International Conference on Learning Analytics And Knowledge</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2015</year>
          , pp.
          <fpage>260</fpage>
          -
          <lpage>264</lpage>
          . doi:
          <volume>10</volume>
          .1145/2723576.2723632.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>