<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>The problem of thematic indexing of Open Educational Resources (OERs) is often a time-consuming and costly manual task, relying on expert knowledge. In addition, a lot of online resources may be poorly annotated with arbitrary, ad-hoc keywords instead of standard, controlled vocabularies, a fact that stretches up the search space and hampers interoperability. In this paper, we propose an approach that facilitates curators and instructors to annotate thematically educational content. To achieve this, we combine explicit knowledge graph representations with vector-based learning of formal thesaurus terms. We apply this technique in the domain of biomedical literature and show that it is possible to produce a reasonable set of thematic suggestions which exceed a certain similarity threshold. Our method yields acceptable levels for precision and recall against corpora already indexed by human experts. Ordering of recommendations is significant and this approach can also have satisfactory results for the ranking problem. However, traditional IR metrics may not be adequate due to semantic relations amongst recommended terms being underutilized.</p>
</abstract>

The problem of thematic indexing of Open Educational Resources (OERs) is often a time-consuming and costly manual task, relying on expert knowledge. In addition, a lot of online resources may be poorly annotated with arbitrary, ad-hoc keywords instead of standard, controlled vocabularies, a fact that stretches up the search space and hampers interoperability. In this paper, we propose an approach that facilitates curators and instructors to annotate thematically educational content. To achieve this, we combine explicit knowledge graph representations with vector-based learning of formal thesaurus terms. We apply this technique in the domain of biomedical literature and show that it is possible to produce a reasonable set of thematic suggestions which exceed a certain similarity threshold. Our method yields acceptable levels for precision and recall against corpora already indexed by human experts. Ordering of recommendations is significant and this approach can also have satisfactory results for the ranking problem. However, traditional IR metrics may not be adequate due to semantic relations amongst recommended terms being underutilized.

Semantic Classification and Indexing of Open Educational Resources with Word Embeddings and Ontologies

Cybernetics and Information Technologies

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

The problem of thematic indexing of Open Educational Resources (OERs) is often a time-consuming and costly manual task, relying on expert knowledge. In...

Semantic Classification and Indexing of Open Educational Resources with Word Embeddings and Ontologies

Publié en ligne: 13 sept. 2020

Pages: 95 - 116

Reçu: 09 mars 2020

Accepté: 26 juin 2020

DOI: https://doi.org/10.2478/cait-2020-0043

Mots clés
Learning objects, Open Educational Resources (OERs), classification, word embeddings, thesauri, ontologies, doc2vec, federated search, MeSH

© 2020 Dimitrios A. Koutsomitropoulos et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Semantic Classification and Indexing of Open Educational Resources with Word Embeddings and Ontologies

Publié en ligne: 13 sept. 2020

Pages: 95 - 116

Reçu: 09 mars 2020

Accepté: 26 juin 2020

DOI: https://doi.org/10.2478/cait-2020-0043

Mots clésLearning objects, Open Educational Resources (OERs), classification, word embeddings, thesauri, ontologies, doc2vec, federated search, MeSH

© 2020 Dimitrios A. Koutsomitropoulos et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Mots clés
Learning objects, Open Educational Resources (OERs), classification, word embeddings, thesauri, ontologies, doc2vec, federated search, MeSH