arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.07307cs.IRcs.AI
收藏

LIT-GRAPH:评估深度与浅层图嵌入在领域特定知识图中高质量文本推荐中的表现

LIT-GRAPH: Evaluating Deep vs. Shallow Graph Embeddings for High-Quality Text Recommendation in Domain-Specific Knowledge Graphs

Department of Computer Science, Kansas State University(计算机科学系,堪萨斯州立大学);Department of Curriculum and Instruction, Kansas State University(课程与教学系,堪萨斯州立大学)

Nirmal Gelal, Chloe Snow, Kathleen M. Jagodnik, Ambyr Rios, Hande Küçük McGinty

AI总结:

LIT-GRAPH通过比较深度与浅层图嵌入方法,实现领域特定知识图中高质量文本推荐,提升教学相关性。

摘要:

本研究提出了LIT-GRAPH(文献图推荐与教学启发法),一种基于知识图的推荐系统,旨在帮助高中英语教师选择多样且教学上一致的教材文献。该系统基于英语文学的本体,解决课程停滞的问题,比较了四种图嵌入范式:DeepWalk、偏向随机游走(BRW)、混合(拼接DeepWalk和BRW向量)以及深度模型关系图卷积网络(R-GCN)。结果揭示了关键差异:虽然浅层模型在结构链接预测方面表现优异,R-GCN在语义排名上占优。通过利用关系特定的信息传递,深度模型优先考虑教学相关性而非原始连接性,从而产生更高质量、领域特定的推荐。

英文摘要:

This study presents LIT-GRAPH (Literature Graph for Recommendation and Pedagogical Heuristics), a novel knowledge graph-based recommendation system designed to scaffold high school English teachers in selecting diverse, pedagogically aligned instructional literature. The system is built upon an ontology for English literature, addressing the challenge of curriculum stagnation, where we compare four graph embedding paradigms: DeepWalk, Biased Random Walk (BRW), Hybrid (concatenated DeepWalk and BRW vectors), and the deep model Relational Graph Convolutional Network (R-GCN). Results reveal a critical divergence: while shallow models excelled in structural link prediction, R-GCN dominated semantic ranking. By leveraging relation-specific message passing, the deep model prioritizes pedagogical relevance over raw connectivity, resulting in superior, high-quality, domain-specific recommendations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑