计算机科学 ›› 2019, Vol. 46 ›› Issue (6A): 507-510.

• 大数据与数据挖掘 • 上一篇    下一篇

面向知识推荐服务的选课决策

张维国   

  1. 南京旅游职业学院 南京211100
  • 出版日期:2019-06-14 发布日期:2019-07-02
  • 作者简介:张维国(1978-),男,高级实验师,主要研究方向为数据挖掘、数据库技术、计算机网络,E-mail:Jamesnj@163.com。
  • 基金资助:
    本文受2015年度江苏省高等教育教改立项研究课题(2015JSJG375),全国旅游职业教育教学指导委员会2015年科研项目立项课题(LZW201505),南京旅游职业学院科研课题(2016YKT18)资助。

Decision Making of Course Selection Oriented by Knowledge Recommendation Service

ZHANG Wei-guo   

  1. Nanjing Institute of Tourism & Hospitality,Nanjing 211100,China
  • Online:2019-06-14 Published:2019-07-02

摘要: 面对Internet的快速发展以及Web上的海量信息资源,用户如何快速并准确地定位到需要的信息成为了一个亟待解决的问题,面向知识推荐服务的选课决策由此产生。面向知识推荐服务的选课是基于个性化推荐研究的核心问题,其以关联规则Apriori算法的理论为基础,运用协同过滤推荐算法,对Apriori算法进行改进,结合学生的专业、兴趣爱好、学习成绩,构建了选课推荐系统模型和基于该模型的个性化推荐算法分析,通过对学生成绩数据库中的数据进行挖掘,指导学生选择更适合自身情况的课程,为学生高效的学习、个性的发展提供帮助。

关键词: 关联规则, 数据挖掘, 推荐服务, 推荐引擎, 知识推荐

Abstract: Facing the rapid development of the Internet and the massive information resources on the Web,it is urgent to enable users to quickly find the information they want,hence the course selection oriented to knowledge recommendation service is generated .Course selection oriented to knowledge recommendation service is the core issue in the research of personalized recommendation,Based on the theory of the Apriori algorithm of association rules,this method makes use of the traditional collaborative filtering recommendation algorithm to improve Apriori algorithm.Combined with students’ majors,hobbies and academic records,constructs the model of course recommendation system as well as the personalized recommendation algorithm analysis based on this model.Through data mining in the students’ academic record database,it guides students to choose more suitable courses and helps them to learn efficiently and develop with personal characteristics.

Key words: Association rules, Data mining, Knowledge recommendation, Recommendation engine, Recommendation service

中图分类号: 

  • TP399
[1]AGRAWAL R,SRIKANT R.Fast algorithms for mining associa-tion rules[C]∥Proceedings of the 20th International Conference on Very Large Data Bases.San Francisco,CA:Morgan Kaufmann,1994:487-499.
[2]李贵林,杨禹琪,高星,等.企业搜索引擎个性化表示与结果排序算法研究[J].计算机研究与发展,2014,51(1):206-214.
[3]许文艳,刘三阳.知识库系统的逻辑基础[J].计算机学报,2009,32(11):2123-2129.
[4]钟秀琴,刘忠,丁盘苹.基于混合推理的知识库的构建及其应用研究[J].计算机学报,2012,35(4):761-766.
[5]AGRAWAL R,SRIKANT R.Mining sequential patterns[C]∥Proceedings of the 11th International Conference on Data Engineering(ICDE’95).Piscataway,NJ:IEEE,1995:3-14.
[6]周水庚,周傲英,曹晶,等.一种基于密度的快速聚类算法[J].计算机研究与发展,2000,37(11):1287-1292.
[7]DAVIDOV D,TSUR O,RAPPOPORT A.Enhanced sentiment le learning using Twitter hashtags and smileys[C]∥Proceedings of the 23rd International Conference on Computational Linguistics(COLING’10).Stroudsburg,PA:ACL,2010:241-249.
[8]BIFET A,FRANK E.Sentiment knowledge discovery in twitter streaming data[C]∥Proceedings of the 13th International Conference on Discovery Science(DS’10).Berlin:Springer,2010:1-15.
[9]贾彩燕,陆汝钤.关联规则挖掘的取样误差量化模型和快速估计算法[J].计算机学报,2006,29(4):625-634.
[10]单留举,王晓东,马英运.基于大数据的用户学习偏好建模及应用[J].计算机应用与软件,2016,33(1):77-80.
[11]李肇明.基于个人兴趣的用户偏好建模[D].昆明:云南大学,2013.
[12]刘慧婷,周开申,赵鹏.基于滑动窗口的不确定性数据流频繁项集挖掘算法[J].计算机应用与软件,2015,32(12):12-15.
[1] 黎嵘繁, 钟婷, 吴劲, 周帆, 匡平.
基于时空注意力克里金的边坡形变数据插值方法
Spatio-Temporal Attention-based Kriging for Land Deformation Data Interpolation
计算机科学, 2022, 49(8): 33-39. https://doi.org/10.11896/jsjkx.210600161
[2] 曹扬晨, 朱国胜, 孙文和, 吴善超.
未知网络攻击识别关键技术研究
Study on Key Technologies of Unknown Network Attack Identification
计算机科学, 2022, 49(6A): 581-587. https://doi.org/10.11896/jsjkx.210400044
[3] 么晓明, 丁世昌, 赵涛, 黄宏, 罗家德, 傅晓明.
大数据驱动的社会经济地位分析研究综述
Big Data-driven Based Socioeconomic Status Analysis:A Survey
计算机科学, 2022, 49(4): 80-87. https://doi.org/10.11896/jsjkx.211100014
[4] 孔钰婷, 谭富祥, 赵鑫, 张正航, 白璐, 钱育蓉.
基于差分隐私的K-means算法优化研究综述
Review of K-means Algorithm Optimization Based on Differential Privacy
计算机科学, 2022, 49(2): 162-173. https://doi.org/10.11896/jsjkx.201200008
[5] 张亚迪, 孙悦, 刘锋, 朱二周.
结合密度参数与中心替换的改进K-means算法及新聚类有效性指标研究
Study on Density Parameter and Center-Replacement Combined K-means and New Clustering Validity Index
计算机科学, 2022, 49(1): 121-132. https://doi.org/10.11896/jsjkx.201100148
[6] 马董, 李新源, 陈红梅, 肖清.
星型高影响的空间co-location模式挖掘
Mining Spatial co-location Patterns with Star High Influence
计算机科学, 2022, 49(1): 166-174. https://doi.org/10.11896/jsjkx.201000186
[7] 徐慧慧, 晏华.
基于相对危险度的儿童先心病风险因素分析算法
Relative Risk Degree Based Risk Factor Analysis Algorithm for Congenital Heart Disease in Children
计算机科学, 2021, 48(6): 210-214. https://doi.org/10.11896/jsjkx.200500082
[8] 沈夏炯, 杨继勇, 张磊.
基于不相关属性集合的属性探索算法
Attribute Exploration Algorithm Based on Unrelated Attribute Set
计算机科学, 2021, 48(4): 54-62. https://doi.org/10.11896/jsjkx.200800082
[9] 张岩金, 白亮.
一种基于符号关系图的快速符号数据聚类算法
Fast Symbolic Data Clustering Algorithm Based on Symbolic Relation Graph
计算机科学, 2021, 48(4): 111-116. https://doi.org/10.11896/jsjkx.200800011
[10] 张寒烁, 杨冬菊.
基于关系图谱的科技数据分析算法
Technology Data Analysis Algorithm Based on Relational Graph
计算机科学, 2021, 48(3): 174-179. https://doi.org/10.11896/jsjkx.191200154
[11] 邹承明, 陈德.
高维大数据分析的无监督异常检测方法
Unsupervised Anomaly Detection Method for High-dimensional Big Data Analysis
计算机科学, 2021, 48(2): 121-127. https://doi.org/10.11896/jsjkx.191100141
[12] 刘新斌, 王丽珍, 周丽华.
MLCPM-UC:一种基于模式实例分布均匀系数的多级co-location模式挖掘算法
MLCPM-UC:A Multi-level Co-location Pattern Mining Algorithm Based on Uniform Coefficient of Pattern Instance Distribution
计算机科学, 2021, 48(11): 208-218. https://doi.org/10.11896/jsjkx.201000097
[13] 刘晓楠, 宋慧超, 王洪, 江舵, 安家乐.
Grover算法改进与应用综述
Survey on Improvement and Application of Grover Algorithm
计算机科学, 2021, 48(10): 315-323. https://doi.org/10.11896/jsjkx.201100141
[14] 张煜, 陆亿红, 黄德才.
基于密度峰值的加权犹豫模糊聚类算法
Weighted Hesitant Fuzzy Clustering Based on Density Peaks
计算机科学, 2021, 48(1): 145-151. https://doi.org/10.11896/jsjkx.200400043
[15] 游兰, 韩雪薇, 何正伟, 肖丝雨, 何渡, 潘筱萌.
基于改进Seq2Seq的短时AIS轨迹序列预测模型
Improved Sequence-to-Sequence Model for Short-term Vessel Trajectory Prediction Using AIS Data Streams
计算机科学, 2020, 47(9): 169-174. https://doi.org/10.11896/jsjkx.190800060
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!