Study on complement of knowledge map of educational resources based on semi-supervised learning

In order to improve the effectiveness of completing educational resource knowledge graphs, a complement method of knowledge map of educational resources based on semi-supervised learning is studied. The relationship path features of the education resource knowledge graph are extracted using a path sorting algorithm. Within the interactive connection graph attention network of the semi-supervised deep learning algorithm, the embedding vectors of the knowledge graph are inputted to obtain the encoded representation of contextual features for the embedding vector entities, and the encoded feature matrix is constructed. The semantic matching model tensor decomposition is used to encode the feature matrix and calculate the scores for each triple. The triple with the highest score is selected as the completion result of the knowledge graph. The experimental results show that this method achieves high values in average reciprocal rank, Hits@10, Hits@3, and Hits@1, indicating a good completion effect of the knowledge graph.

Authors

Institutions

Publication Details

Journal
International Journal of Business Intelligence and Data Mining
Published
2024-08-15
DOI
https://doi.org/10.1504/ijbidm.2025.10066020
Primary Topic
Educational Technology and Assessment
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Study on complement of knowledge map of educational resources based on semi-supervised learning

Wei Liu
International Journal of Business Intelligence and Data Mining
Educational Technology and Assessment
article

Study on complement of knowledge map of educational resources based on semi-supervised learning

Wei Liu
article en

Abstract

In order to improve the effectiveness of completing educational resource knowledge graphs, a complement method of knowledge map of educational resources based on semi-supervised learning is studied. The relationship path features of the education resource knowledge graph are extracted using a path sorting algorithm. Within the interactive connection graph attention network of the semi-supervised deep learning algorithm, the embedding vectors of the knowledge graph are inputted to obtain the encoded representation of contextual features for the embedding vector entities, and the encoded feature matrix is constructed. The semantic matching model tensor decomposition is used to encode the feature matrix and calculate the scores for each triple. The triple with the highest score is selected as the completion result of the knowledge graph. The experimental results show that this method achieves high values in average reciprocal rank, Hits@10, Hits@3, and Hits@1, indicating a good completion effect of the knowledge graph.

International Journal of Business Intelligence and Data MiningVol. 1(1)
Chengdu University (CN), Chengdu Normal University (CN)
Quality Education
Openalex Percentile: Top 80%
Educational Technology and Assessment
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.