首页|期刊导航|计算机工程与应用|知识图谱与推荐算法任务优化及领域应用发展综述

知识图谱与推荐算法任务优化及领域应用发展综述OA

Overview of Task Optimization and Domain Application Development of Knowledge Graph and Recommendation Algorithm

中文摘要英文摘要

推荐算法作为当前信息过滤的核心技术,需要通过知识图谱的语义关联以及结构化知识来解决信息碎片化和可解释性不足的问题.为了进一步促进知识图谱与推荐算法的技术融合,研究推荐模型性能提升的关键和多领域多技术的发展,并将知识图谱与推荐算法结合过程分为知识图谱模块优化、推荐任务模块优化、多任务模块优化三部分.从发展历程、优化改进、核心技术等角度详细梳理各模块相关理论和研究成果;同时结合当前领域发展趋势,总结了大模型、医学领域和电商领域应用的最新发展及存在的挑战;最后对知识图谱与推荐算法存在的问题进行总结与展望,为后续研究提供新的拓展思路.

As the core technology of current information filtering,recommendation algorithms need to solve the problems of information fragmentation and insufficient interpretability through semantic association of knowledge graphs and struc-tured knowledge.In order to further promote the technological integration of knowledge graph and recommendation algo-rithm,research the key to improve the performance of recommendation models and the development of multi-domain and multi-technology,this paper decomposes the process of combining knowledge graph with recommendation algorithm into three parts:knowledge graph module optimization,recommendation task module optimization,and multi-task module optimization.The paper comprehensively reviews the relevant theories and research results of each module from the per-spectives of development history,optimization and improvement,core technology,etc.Simultaneously,catering to the current development trends in the field,the latest developments and challenges in the applications of large language models,medicine and e-commerce fields are summarized.Finally,a summary and outlook is provided on the existing problems of knowledge graphs and recommendation algorithms,providing new ideas for future research.

韩一鸣;魏国辉

山东中医药大学 医学信息工程学院,济南 250355山东中医药大学 医学信息工程学院,济南 250355

信息技术与安全科学

知识图谱推荐算法多任务学习大语言模型

knowledge graphrecommendation algorithmmulti-task learninglarge language models

《计算机工程与应用》 2026 (10)

26-53,28

国家自然科学基金(61702087)山东省自然科学基金面上项目(ZR2022MH203)山东省研究生优质教育教学资源项目(SDYKC2023044)山东中医药大学教育教学研究课题(实验教学专项)(SYJX2022013).

10.3778/j.issn.1002-8331.2505-0279

评论