共查询到19条相似文献,搜索用时 78 毫秒
1.
通过分析远程网络学习系统中学习者对学习资源的访问历史,以及与学习者有类似访问兴趣的同组学习者的学习偏好,为学习者提供个性化的资源推荐服务,能够有效提高各种学习资源的利用效率,从而提高教学质量. 相似文献
2.
随着信息技术和网络教育的发展,学习资源呈现爆炸式增长,面对丰富的学习资源,学习者并不能在短时间内最大程度匹配到适合自己的学习资源。个性化学习资源推荐(Personalized Learning Resource Recommendation,PLRR)利用新一代信息技术,全面分析学习者特征、行为、目标等信息,从海量学习资源中筛选出符合其需求的资源,并以合适的方式呈现给学习者,以提高其学习效率和满意度。本文主要从PLRR基本框架、主要算法、面临的挑战和发展趋势进行阐述,旨在为相关研究者提供一个参考框架,促进PLRR领域交流和发展。 相似文献
3.
何莉 《电脑编程技巧与维护》2016,(20):75-76
随着互联网技术的发展和大数据时代的来临,在线学习平台凭借丰富开放的信息资源、随时随地可以自主学习等优势受到了普遍关注。但随之也产生了信息过载问题,学生在海量信息中很难找到合适的资源,为此个性化推荐应运而生。作为当前解决信息过载最有效的工具之一,个性化推荐技术在过去的几十年里取得了长足的进步。主要对个性化推荐研究现状、关键技术进行了详细阐述,并展望未来的发展趋势。 相似文献
4.
由于在线学习学习者的认知能力的不确定性、学习兴趣的变化性、用户偏好的多样性等,在线学习资源的个性化智能推荐面临新挑战.文章根据学习者认知能力的模糊综合诊断和学习者多重特征信息融合等,对在线学习资源的个性化智能推荐进行了研究,以期为相关研究者提供参考和启发. 相似文献
5.
通过调查发现,E-learning支持系统无法有效地向学习者个性化地推荐学习资源。为了进一步提高推荐系统的性能,本文尝试将协同过滤推荐技术引入学习资源的个性化推荐研究中。协同过滤推荐技术是一种应用最为广泛的个性化推荐技术,然而其面临着冷启动、数据稀疏性问题、规模可扩展性等问题。本文通过介绍协同过滤推荐技术的工作原理、实现方法及存在问题,提出了一个优化的基于协同过滤技术的学习资源个性化推荐系统的理论模型,重点讨论了隐式评分机制和算法的实现,以提升推荐系统的实时响应和推荐精度。 相似文献
6.
随着我国教育信息化进程的不断推进,学习者获取学习资源的方式逐渐从主动检索转变为学习系统自动推荐。智能化的学习内容推荐行为极大地提高了用户获取个性化资源的效率,但是内容推荐在教育领域中的应用仍存在着许多方面的不足。该研究分析了推荐系统在教育领域中的应用现状,介绍了主流的推荐算法及其实现原理,并采用混合推荐模式和不同的推荐策略,设计出个性化学习资源精准推荐系统的系统模型,以期助力学习者的个性化学习。 相似文献
7.
通过搜索资源来学习现已成为网络学习的一种重要的学习方式,为了提高这种方式下的学习效率,本文提出了一种基于Agent的网络推荐系统,通过获取学习者的当前学习需求,与内嵌的专家知识进行集成,利用多属性决策方法作为比较机制,以达到推荐合适学习资源的目的。系统还提出协同过滤方法,将相似学习者的学习资源推荐给学习者。最后。采用JADE平台开发了原型系统,并进行系统的集成和Web应用设计。 相似文献
8.
常规Java课程思政资源个性化推荐系统的推荐效果不佳,因此提出基于深度学习的Java课程思政资源个性化推荐系统。首先设计资源存储器和资源处理器等系统硬件,其次基于深度学习算法构建个性化推荐模型,最后结合数据库及课程资源管理模块完成系统软件设计。测试结果表明,设计的系统能够实现课程资源的个性化推荐,推荐资源与用户需求资源之间的适配度更高。 相似文献
9.
面对海量的学习资源,如何为学习者推荐与情境相匹配的学习资源是亟需解决的问题。文章在详细描述学习资源个性化推荐情境要素的基础上,构建了包含情境感知层、资源管理层、学习诊断层、个性推荐层及学习者界面的学习资源个性化推荐系统,并阐述了系统的推荐流程及实现。在情境感知理论的基础上,构建以情境感知技术为核心的学习资源个性化推荐系统,能提高学习资源与学习者之间的动态适应性,更好地服务于学习者的个性化学习需求。 相似文献
10.
面对海量的在线学习资源,学习者往往面临“信息过载”和“信息迷航”等问题,帮助学习者高效准确地获取适合自己的学习资源来提升学习效果,已成为研究热点.针对现有方法存在的可解释性差、推荐效率和准确度不足等问题,提出了一种基于知识图谱和图嵌入的个性化学习资源推荐方法,它基于在线学习通用本体模型构建在线学习环境知识图谱,利用图嵌入算法对知识图谱进行训练,以优化学习资源推荐中的图计算效率.基于学习者的学习风格特征进行聚类来优化学习者的资源兴趣度,以获得排序后的学习资源推荐结果.实验结果表明,相对于现有方法,所提方法能在大规模图数据场景下显著提升计算效率和个性化学习资源推荐的准确度. 相似文献
11.
12.
13.
Li Hui Li Haining Zhang Shu Zhong Zhaoman Cheng Jiang 《Neural computing & applications》2019,31(9):4455-4462
Neural Computing and Applications - With the continuous development of networks, web-based e-learning is changing the way people acquire knowledge. An increasing number of learners are eager to... 相似文献
14.
Nowadays, the personalized recommendation has become a research hotspot for addressing information overload. Despite this, generating effective recommendations from sparse data remains a challenge. Recently, auxiliary information has been widely used to address data sparsity, but most models using auxiliary information are linear and have limited expressiveness. Due to the advantages of feature extraction and no-label requirements, autoencoder-based methods have become quite popular. However, most existing autoencoder-based methods discard the reconstruction of auxiliary information, which poses huge challenges for better representation learning and model scalability. To address these problems, we propose Serial-Autoencoder for Personalized Recommendation (SAPR), which aims to reduce the loss of critical information and enhance the learning of feature representations. Specifically, we first combine the original rating matrix and item attribute features and feed them into the first autoencoder for generating a higher-level representation of the input. Second, we use a second autoencoder to enhance the reconstruction of the data representation of the prediciton rating matrix. The output rating information is used for recommendation prediction. Extensive experiments on the MovieTweetings and MovieLens datasets have verified the effectiveness of SAPR compared to state-of-the-art models. 相似文献
15.
16.
进入大数据时代,信息超载是互联网用户面临的一个严重的问题,个性化推荐是解决此问题的一个非常有潜力的办法。在学术领域,学术资源个性化推荐是解决信息超载的有效途径,其为用户推荐符合其兴趣的个性化学术信息。从个性化推荐过程的用户建模、推荐对象建模和推荐策略等三个模块角度对现有学术资源个性化推荐研究进行了探讨。针对目前广泛应用的学术资源个性化推荐方法,包括基于内容的推荐、协同过滤推荐和基于网络结构的推荐等,总结其研究的关键点和存在问题,并对学术资源个性化推荐的研究趋势进行了预测。 相似文献
17.
Wan-Yu DengAuthor Vitae Qing-Hua ZhengAuthor VitaeShiguo LianAuthor Vitae Lin ChenAuthor Vitae 《Neurocomputing》2011,74(11):1848-1858
Collaborative filtering has been widely applied in many fields in recent years due to the increase in web-based activities such as e-commerce and online content distribution. Current collaborative filtering techniques such as correlation-based, SVD-based and supervised learning-based approaches provide good accuracy, but are computationally very expensive and can only be deployed in static off-line settings, where the known rating information does not change with time. However, a number of practical scenarios require dynamic adaptive collaborative filtering that can allow new users, items and ratings to enter the system at a rapid rate. In this paper, we consider a novel adaptive personalized recommendation based on adaptive learning. Fast adaptive learning runs through all the aspects of the proposed approach, including training, prediction and updating. Empirical evaluation of our approach on Movielens dataset demonstrates that it is possible to obtain accuracy comparable to that of the correlation-based, SVD-based and supervised learning-based approaches at a much lower computational cost. 相似文献
18.
Automatic multimedia learning resources recommendation has become an increasingly relevant problem: it allows students to discover new learning resources that match their tastes, and enables the e-learning system to target the learning resources to the right students. In this paper, we propose a content-based recommendation algorithm based on convolutional neural network (CNN). The CNN can be used to predict the latent factors from the text information of the multimedia resources. To train the CNN, its input and output should first be solved. For its input, the language model is used. For its output, we propose the latent factor model, which is regularized by L1-norm. Furthermore, the split Bregman iteration method is introduced to solve the model. The major novelty of the proposed recommendation algorithm is that the text information is used directly to make the content-based recommendation without tagging. Experimental results on public databases in terms of quantitative assessment show significant improvements over conventional methods. In addition, the split Bregman iteration method which is introduced to solve the model can greatly improve the training efficiency. 相似文献
19.
Recently, the Internet has made a lot of services and products appear online provided by many tourism sectors. By this way, many information such as timetables, routes, accommodations, and restaurants are easily available to help travelers plan their travels. However, how to plan the most appropriate travel schedule under simultaneously considering several factors such as tourist attractions visiting, local hotels selecting, and travel budget calculation is a challenge. This gives rise to our interest in exploring the recommendation systems with relation to schedule recommendation. Additionally, the personalized concept is not implemented completely in most of travel recommendation systems. One notable problem is that they simply recommended the most popular travel routes or projects, and cannot plan the travel schedule. Moreover, the existing travel planning systems have limits in their capabilities to adapt to the changes based on users’ requirements and planning results. To tackle these problems, we develop a personalized travel planning system that simultaneously considers all categories of user requirements and provides users with a travel schedule planning service that approximates automation. A novel travel schedule planning algorithm is embedded to plan travel schedules based on users’ need. Through the user-adapted interface and adjustable results design, users can replace any unsatisfied travel unit to specific one. The feedback mechanism provides a better accuracy rate for next travel schedule to new users. An experiment was conducted to examine the satisfaction and use intention of the system. The results showed that participants who used the system with schedule planning have statistical significant on user satisfaction and use intention. We also analyzed the validity of applying the proposed algorithm to a user preference travel schedule through a number of practical system tests. In addition, comparing with other travel recommendation systems, our system had better performance on the schedule adjustment, personalization, and feedback giving. 相似文献