吉林大学学报(信息科学版) ›› 2026, Vol. 44 ›› Issue (4): 963-971.

• • 上一篇    下一篇

动态知识图谱与强化学习下职教资源个性化推荐算法

朱 彦1 , 王海林2   

  1. 1. 云南机电职业技术学院 继续教育部, 昆明 650203; 2. 昆明理工大学 信息工程与自动化学院, 昆明 650504
  • 收稿日期:2025-12-03 出版日期:2026-08-06 发布日期:2026-08-06
  • 作者简介:朱彦(1983—), 女, 云南宣威人, 云南机电职业技术学院副教授, 主要从事大学生生涯发展教育和就业创业指导、 计算 机科学与技术研究, (Tel)86-13529430213(E-mail)C411817283@ 126. com
  • 基金资助:
    教育部产学合作协同育人基金资助项目(240703817125047)

Personalized Recommendation Algorithm for Vocational Education Resources Based on Dynamic Knowledge Graph and Reinforcement Learning

ZHU Yan1, WANG Hailin2   

  1. 1. Continuing Education Department, Yunnan Vocational College of Mechanical and Electrical Technology, Kunming 650203, China;2. School of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650504, China
  • Received:2025-12-03 Online:2026-08-06 Published:2026-08-06

摘要:

针对在职教资源个性化推荐算法采用的混沌映射构建推荐学习模型易受维度灾难影响, 导致 NDCG(Normalized Discounted Cumulative Gain)归一化折损增益不理想的问题, 对基于动态知识图谱与强化学习的职教资源个性化推荐算法进行优化设计。构建多源异构数据的职教资源动态知识图谱表征, 引入时序感知的嵌入表征向量得到动态嵌入函数; 通过图注意力网络聚合实体的邻域信息, 更新节点表征, 从而高度集成动态知识图谱的结构信息; 采用 Actor-Critic 架构将目标函数作为最大化累计期望回报, 引入熵正则化, 在满足推荐需求平衡的基础上得到复合奖励式; 引入代价敏感的搜索算法与强化学习策略相结合, 生成启发式评估函数, 通过重采样机制在动态知识图谱中寻找有效资源进行路径插入, 规划自适应推荐路径, 完成职教资源个性化推荐。实验结果表明, 研究算法在不同类型资源下的推荐 NDCG 归一化折损增益始终高于 0. 8, 在排序时更能考虑物品的相关性和位置因素, 将用户更可能感兴趣的物品排在更靠前的位置, 推荐质量良好, 未受浏览筛选迟滞作用影响出现需求不匹配问题, 具有推荐显著一致性。

关键词:

Abstract:

In the design of personalized recommendation algorithms for vocational education resources, chaotic mapping is commonly used to construct recommendation learning models. However, such models are susceptible to the curse of dimensionality, leading to suboptimal NDCG ( Normalized Discounted Cumulative Gain). To address this, an optimized design of a personalized recommendation algorithm is proposed for vocational education resources based on dynamic knowledge graph and reinforcement learning. Specifically, a dynamic knowledge graph representation is constructed from multi-source heterogeneous vocational education resource data, and a temporal-aware embedding representation vector is introduced to derive dynamic embedding functions. A graph attention network is employed to aggregate neighborhood information of entities, updating node representations to deeply integrate structural information of the dynamic knowledge graph. An Actor-Critic framework is adopted to maximize cumulative expected rewards, and entropy regularization is introduced to achieve a composite reward function that balances recommendation objectives. By combining a cost-sensitive search algorithm with the reinforcement learning strategy, a heuristic evaluation function is generated. A resampling mechanism is applied to locate effective resources within the dynamic knowledge graph for path insertion, enabling adaptive recommendation path planning and achieving personalized recommendation of vocational education resources.Experimental results demonstrate that the proposed algorithm consistently achieves NDCG values above 0. 8 across different types of resources. It effectively accounts for item relevance and ranking positions, placing items of higher user interest in more prominent positions. The recommendation quality remains high without being affected by browsing and filtering delays or demand mismatches, exhibiting significant recommendation consistency.

Key words:

中图分类号: 

  • TP391