基于贝叶斯分类算法的网络学习资源个性化推荐系统

IF 3.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Informatica Pub Date : 2023-05-30 DOI:10.31449/inf.v47i3.3979
Xiuhui Wang
{"title":"基于贝叶斯分类算法的网络学习资源个性化推荐系统","authors":"Xiuhui Wang","doi":"10.31449/inf.v47i3.3979","DOIUrl":null,"url":null,"abstract":"In order to meet learners' personalized learning needs, realize learners' personalized development, and solve the problem of learners' information Trek and overload, a development scheme of e-learning resources personalized recommendation system based on Bayesian algorithm is proposed. This paper studies the personalized Association recommendation model integrating association rule mining and Bayesian network, and improves the association rule mining algorithm by combining historical record pruning and Bayesian network verification. In the process of association rule mining, combined with user history, the frequent itemsets in association rules are filtered, and the itemsets below the given threshold are pruned. The pruned item set is input into the Bayesian verification network for personalized verification, and the verification results are sorted and recommended according to the ranking, so as to give priority to the readers who really like the books. The recommendation model solves the problem of weak personalization in the existing recommendation system to a certain extent. Experiments show that Bayesian network can improve the personalization of association recommendation.","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"316 1","pages":"0"},"PeriodicalIF":3.3000,"publicationDate":"2023-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Personalized Recommendation System of E-learning Resources Based on Bayesian Classification Algorithm\",\"authors\":\"Xiuhui Wang\",\"doi\":\"10.31449/inf.v47i3.3979\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to meet learners' personalized learning needs, realize learners' personalized development, and solve the problem of learners' information Trek and overload, a development scheme of e-learning resources personalized recommendation system based on Bayesian algorithm is proposed. This paper studies the personalized Association recommendation model integrating association rule mining and Bayesian network, and improves the association rule mining algorithm by combining historical record pruning and Bayesian network verification. In the process of association rule mining, combined with user history, the frequent itemsets in association rules are filtered, and the itemsets below the given threshold are pruned. The pruned item set is input into the Bayesian verification network for personalized verification, and the verification results are sorted and recommended according to the ranking, so as to give priority to the readers who really like the books. The recommendation model solves the problem of weak personalization in the existing recommendation system to a certain extent. Experiments show that Bayesian network can improve the personalization of association recommendation.\",\"PeriodicalId\":56292,\"journal\":{\"name\":\"Informatica\",\"volume\":\"316 1\",\"pages\":\"0\"},\"PeriodicalIF\":3.3000,\"publicationDate\":\"2023-05-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Informatica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31449/inf.v47i3.3979\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Informatica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31449/inf.v47i3.3979","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

为了满足学习者的个性化学习需求,实现学习者的个性化发展,解决学习者信息跋涉和过载的问题,提出了一种基于贝叶斯算法的电子学习资源个性化推荐系统的开发方案。本文研究了将关联规则挖掘和贝叶斯网络相结合的个性化关联推荐模型,并结合历史记录修剪和贝叶斯网络验证对关联规则挖掘算法进行了改进。在关联规则挖掘过程中,结合用户历史对关联规则中频繁出现的项集进行过滤,对低于给定阈值的项集进行剪枝。将修剪后的项目集输入到贝叶斯验证网络中进行个性化验证,并将验证结果按照排序进行排序和推荐,优先给真正喜欢这些书的读者。该推荐模型在一定程度上解决了现有推荐系统的弱个性化问题。实验表明,贝叶斯网络可以提高关联推荐的个性化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Personalized Recommendation System of E-learning Resources Based on Bayesian Classification Algorithm
In order to meet learners' personalized learning needs, realize learners' personalized development, and solve the problem of learners' information Trek and overload, a development scheme of e-learning resources personalized recommendation system based on Bayesian algorithm is proposed. This paper studies the personalized Association recommendation model integrating association rule mining and Bayesian network, and improves the association rule mining algorithm by combining historical record pruning and Bayesian network verification. In the process of association rule mining, combined with user history, the frequent itemsets in association rules are filtered, and the itemsets below the given threshold are pruned. The pruned item set is input into the Bayesian verification network for personalized verification, and the verification results are sorted and recommended according to the ranking, so as to give priority to the readers who really like the books. The recommendation model solves the problem of weak personalization in the existing recommendation system to a certain extent. Experiments show that Bayesian network can improve the personalization of association recommendation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Informatica
Informatica 工程技术-计算机:信息系统
CiteScore
5.90
自引率
6.90%
发文量
19
审稿时长
12 months
期刊介绍: The quarterly journal Informatica provides an international forum for high-quality original research and publishes papers on mathematical simulation and optimization, recognition and control, programming theory and systems, automation systems and elements. Informatica provides a multidisciplinary forum for scientists and engineers involved in research and design including experts who implement and manage information systems applications.
期刊最新文献
Beyond Quasi-Adjoint Graphs: On Polynomial-Time Solvable Cases of the Hamiltonian Cycle and Path Problems Confidential Transaction Balance Verification by the Net Using Non-Interactive Zero-Knowledge Proofs An Improved Algorithm for Extracting Frequent Gradual Patterns Offloaded Data Processing Energy Efficiency Evaluation Demystifying the Stability and the Performance Aspects of CoCoSo Ranking Method under Uncertain Preferences
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1