首页 > 最新文献

Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization最新文献

英文 中文
Discovering Hidden Course Requirements and Student Competences from Grade Data 从成绩数据中发现隐藏的课程要求和学生能力
Mara Houbraken, Chang Sun, E. Smirnov, K. Driessens
This paper presents a data driven approach to autonomous course-competency requirement and student-competency level discovery starting from the grades obtained by a sufficiently large set of students. The approach relies on collaborative filtering techniques, more precisely matrix decomposition, to derive the hidden competency requirements and levels that together should be responsible for observed grades. The discovered hidden features are translated into human understandable competencies by matching the computed values to expert input. The approach also allows for grade prediction for so far unobserved student course combinations, allowing for personalized study planning and student guidance. The technique is demonstrated on data from a "Data Science and Knowledge Engineering" Bachelor study, Maastricht University.
本文提出了一种数据驱动的方法,从足够大的学生群体获得的成绩开始,自主地进行课程能力要求和学生能力水平发现。该方法依赖于协同过滤技术,更准确地说,是矩阵分解,以得出隐藏的能力需求和水平,它们应该共同负责观察到的分数。通过将计算值与专家输入相匹配,将发现的隐藏特征转换为人类可理解的能力。该方法还可以预测到目前为止尚未观察到的学生课程组合的成绩,从而实现个性化的学习计划和学生指导。该技术在马斯特里赫特大学“数据科学与知识工程”学士学位研究的数据上得到了证明。
{"title":"Discovering Hidden Course Requirements and Student Competences from Grade Data","authors":"Mara Houbraken, Chang Sun, E. Smirnov, K. Driessens","doi":"10.1145/3099023.3099034","DOIUrl":"https://doi.org/10.1145/3099023.3099034","url":null,"abstract":"This paper presents a data driven approach to autonomous course-competency requirement and student-competency level discovery starting from the grades obtained by a sufficiently large set of students. The approach relies on collaborative filtering techniques, more precisely matrix decomposition, to derive the hidden competency requirements and levels that together should be responsible for observed grades. The discovered hidden features are translated into human understandable competencies by matching the computed values to expert input. The approach also allows for grade prediction for so far unobserved student course combinations, allowing for personalized study planning and student guidance. The technique is demonstrated on data from a \"Data Science and Knowledge Engineering\" Bachelor study, Maastricht University.","PeriodicalId":219391,"journal":{"name":"Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121821456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A Framework for Computational Serendipity 计算意外发现的框架
Xi Niu, Fakhri Abbas
In this paper, we propose a framework for computational serendipity. The framework is used in a recommender system context to find personalized serendipity and meanwhile stimulate user's curiosity. The framework is novel to the serendipity research community in that it decomposes the concept of serendipity into two elements: surprise and value; and provides computational approaches to modeling both of them. The framework also incorporates the concept of curiosity to keep users' interests over a long term. It brings together several fields including information retrieval, cognitive science, computational creativity in artificial intelligence, and text mining. We will describe the framework first and then evaluate it with an implementation called StumbleOn in the health news context. The evaluation serves as a proof-of-concept of this computational serendipity framework.
在本文中,我们提出了一个计算偶然性的框架。该框架用于推荐系统环境中,以发现个性化的意外发现,同时激发用户的好奇心。该框架对意外发现研究界来说是新颖的,因为它将意外发现的概念分解为两个元素:惊喜和价值;并提供了对两者建模的计算方法。该框架还结合了好奇心的概念,以长期保持用户的兴趣。它汇集了几个领域,包括信息检索、认知科学、人工智能中的计算创造力和文本挖掘。我们将首先描述该框架,然后在健康新闻上下文中使用名为StumbleOn的实现对其进行评估。评估作为这个计算意外发现框架的概念证明。
{"title":"A Framework for Computational Serendipity","authors":"Xi Niu, Fakhri Abbas","doi":"10.1145/3099023.3099097","DOIUrl":"https://doi.org/10.1145/3099023.3099097","url":null,"abstract":"In this paper, we propose a framework for computational serendipity. The framework is used in a recommender system context to find personalized serendipity and meanwhile stimulate user's curiosity. The framework is novel to the serendipity research community in that it decomposes the concept of serendipity into two elements: surprise and value; and provides computational approaches to modeling both of them. The framework also incorporates the concept of curiosity to keep users' interests over a long term. It brings together several fields including information retrieval, cognitive science, computational creativity in artificial intelligence, and text mining. We will describe the framework first and then evaluate it with an implementation called StumbleOn in the health news context. The evaluation serves as a proof-of-concept of this computational serendipity framework.","PeriodicalId":219391,"journal":{"name":"Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115740578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
An Approach to Social News Recommendation based on Focused Crawling and Sentiment Analysis 一种基于聚焦爬行和情感分析的社会新闻推荐方法
Matteo Amadei
News recommendation poses several specific challenges compared to other domains, such as freshness and serendipity. The proposed research will develop new methods and techniques to address some of such challenges. With the aim of handling the users' changing interests and the fast evolution overtime of news, my solution will be proposed in the social network domain, exploiting an adaptive focused crawling algorithm. Moreover, it will consider a given user's attitude towards her interests, with the purpose of recommending articles in line with her beliefs. An experimental evaluation is currently being implemented to assess the effectiveness of my approach, also in comparison with state-of-the-art techniques.
与新鲜度和意外发现等其他领域相比,新闻推荐提出了几个具体的挑战。拟议的研究将开发新的方法和技术来解决其中的一些挑战。为了处理用户兴趣的变化和新闻的快速演变,我的解决方案将在社交网络领域提出,利用自适应聚焦爬行算法。此外,它会考虑给定用户对其兴趣的态度,目的是推荐符合其信仰的文章。目前正在进行一项实验性评估,以评估我的方法的有效性,并与最先进的技术进行比较。
{"title":"An Approach to Social News Recommendation based on Focused Crawling and Sentiment Analysis","authors":"Matteo Amadei","doi":"10.1145/3099023.3099027","DOIUrl":"https://doi.org/10.1145/3099023.3099027","url":null,"abstract":"News recommendation poses several specific challenges compared to other domains, such as freshness and serendipity. The proposed research will develop new methods and techniques to address some of such challenges. With the aim of handling the users' changing interests and the fast evolution overtime of news, my solution will be proposed in the social network domain, exploiting an adaptive focused crawling algorithm. Moreover, it will consider a given user's attitude towards her interests, with the purpose of recommending articles in line with her beliefs. An experimental evaluation is currently being implemented to assess the effectiveness of my approach, also in comparison with state-of-the-art techniques.","PeriodicalId":219391,"journal":{"name":"Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization","volume":"227 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122859082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Adaptive Support For Group Formation In Computer Supported Collaborative Learning 计算机支持协同学习中群体形成的自适应支持
A. Adeniran
My doctoral research will investigate adapting group formation in computer supported collaborative learning (CSCL) based on learners' characteristics. As Group based learning leverages on interaction for effective cognition, this project aims to investigate the effect of individual behavioural characteristics on interaction within a group. Based on our findings, we will develop and evaluate a model for adapting group formation for effective interaction in CSCL.
我的博士研究方向是基于学习者特点的计算机支持协作学习(CSCL)中的适应小组形成。基于群体的学习利用互动来获得有效的认知,本项目旨在研究个体行为特征对群体内互动的影响。基于我们的研究结果,我们将开发和评估一个模型,以适应群体形成在CSCL中有效的互动。
{"title":"Adaptive Support For Group Formation In Computer Supported Collaborative Learning","authors":"A. Adeniran","doi":"10.1145/3099023.3099026","DOIUrl":"https://doi.org/10.1145/3099023.3099026","url":null,"abstract":"My doctoral research will investigate adapting group formation in computer supported collaborative learning (CSCL) based on learners' characteristics. As Group based learning leverages on interaction for effective cognition, this project aims to investigate the effect of individual behavioural characteristics on interaction within a group. Based on our findings, we will develop and evaluate a model for adapting group formation for effective interaction in CSCL.","PeriodicalId":219391,"journal":{"name":"Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114173606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Should Learning Material's Selection be Adapted to Learning Style and Personality? 学习材料的选择是否应与学习风格和个性相适应?
Manal Alhathli, J. Masthoff, Advaith Siddharthan
This paper investigates the influence of learner personality and learning styles on the selection of different styles of learning materials. We considered the big five personality traits (focusing in particular on Extroversion and Openness to Experience) and Felder and Soloman's Index of Learning Styles instrument (ILS). We found no real impact of learning styles, except for a small effect for the visual/verbal style. We also did not find an impact of personality on the selection of different styles of learning materials.
本文探讨了学习者个性和学习风格对不同风格学习材料选择的影响。我们考虑了五大人格特征(特别关注外向性和开放性)和费尔德和所罗门的学习风格指数工具(ILS)。我们发现学习风格没有真正的影响,除了视觉/语言风格有一点影响。我们也没有发现个性对不同风格学习材料的选择有影响。
{"title":"Should Learning Material's Selection be Adapted to Learning Style and Personality?","authors":"Manal Alhathli, J. Masthoff, Advaith Siddharthan","doi":"10.1145/3099023.3099079","DOIUrl":"https://doi.org/10.1145/3099023.3099079","url":null,"abstract":"This paper investigates the influence of learner personality and learning styles on the selection of different styles of learning materials. We considered the big five personality traits (focusing in particular on Extroversion and Openness to Experience) and Felder and Soloman's Index of Learning Styles instrument (ILS). We found no real impact of learning styles, except for a small effect for the visual/verbal style. We also did not find an impact of personality on the selection of different styles of learning materials.","PeriodicalId":219391,"journal":{"name":"Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116615225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Learning User Preferences by Observing User-Items Interactions in an IoT Augmented Space 通过观察物联网增强空间中的用户-项目交互来学习用户偏好
David Massimo, Mehdi Elahi, F. Ricci
Recommender systems generate recommendations by analysing which items the user consumes or likes. Moreover, in many scenarios, e.g., when a user is visiting an exhibition or a city, users are faced with a sequence of decisions, and the recommender should therefore suggest, at each decision step, a set of viable recommendations (attractions). In these scenarios the order and the context of the past user choices is a valuable source of data, and the recommender has to effectively exploit this information for understanding the user preferences in order to recommend compelling items. For addressing these scenarios, this paper proposes a novel preference learning model that takes into account the sequential nature of item consumption. The model is based on Inverse Reinforcement Learning, which enables to exploit observations of users' behaviours, when they are making decisions and taking actions, i.e., choosing the items to consume. The results of a proof of concept experiment show that the proposed model can effectively capture the user preferences, the rationale of users decision making process when consuming items in a sequential manner, and can replicate the observed user behaviours.
推荐系统通过分析用户消费或喜欢的商品来生成推荐。此外,在许多情况下,例如,当用户正在参观一个展览或一个城市时,用户面临着一系列的决策,因此推荐人应该在每个决策步骤中提出一组可行的建议(景点)。在这些场景中,过去用户选择的顺序和上下文是一个有价值的数据来源,推荐者必须有效地利用这些信息来理解用户的偏好,以便推荐引人注目的商品。为了解决这些问题,本文提出了一种新的偏好学习模型,该模型考虑了物品消费的顺序性。该模型基于逆强化学习,它可以利用用户行为的观察,当他们做出决定和采取行动时,即选择要消费的物品。概念验证实验的结果表明,所提出的模型可以有效地捕获用户偏好,用户以顺序方式消费商品时决策过程的基本原理,并可以复制观察到的用户行为。
{"title":"Learning User Preferences by Observing User-Items Interactions in an IoT Augmented Space","authors":"David Massimo, Mehdi Elahi, F. Ricci","doi":"10.1145/3099023.3099070","DOIUrl":"https://doi.org/10.1145/3099023.3099070","url":null,"abstract":"Recommender systems generate recommendations by analysing which items the user consumes or likes. Moreover, in many scenarios, e.g., when a user is visiting an exhibition or a city, users are faced with a sequence of decisions, and the recommender should therefore suggest, at each decision step, a set of viable recommendations (attractions). In these scenarios the order and the context of the past user choices is a valuable source of data, and the recommender has to effectively exploit this information for understanding the user preferences in order to recommend compelling items. For addressing these scenarios, this paper proposes a novel preference learning model that takes into account the sequential nature of item consumption. The model is based on Inverse Reinforcement Learning, which enables to exploit observations of users' behaviours, when they are making decisions and taking actions, i.e., choosing the items to consume. The results of a proof of concept experiment show that the proposed model can effectively capture the user preferences, the rationale of users decision making process when consuming items in a sequential manner, and can replicate the observed user behaviours.","PeriodicalId":219391,"journal":{"name":"Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128679437","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Automated Data-Driven Hints for Computer Programming Students 计算机编程学生自动数据驱动提示
S. Chow, K. Yacef, I. Koprinska, J. Curran
Formative feedback is essential for learning computer programming but is also a challenge to automate because of the many solutions a programming exercise can have. Whilst programming tutoring systems can easily generate automated feedback on how correct a program is, they less often provide some personalised guidance on how to improve or fix the code. In this paper, we present an approach for generating hints using previous student data. Utilising a range of techniques such as filtering, clustering and pattern mining, four different types of data-driven hints are generated: input suggestion, code-based, concept and pre-emptive hints. We evaluated our approach with data from 5529 students using the Grok Learning platform for teaching programming in Python. The results show that we can generate various types of hints for over 90% of students with data from only 10 students, and hence, reduce the cold-start problem.
形成性反馈对于学习计算机编程至关重要,但由于编程练习可以有许多解决方案,因此自动化也是一项挑战。虽然编程辅导系统可以很容易地生成关于程序正确性的自动反馈,但它们很少提供一些关于如何改进或修复代码的个性化指导。在本文中,我们提出了一种使用以前的学生数据生成提示的方法。利用过滤、聚类和模式挖掘等一系列技术,生成了四种不同类型的数据驱动提示:输入提示、基于代码的提示、概念提示和先发制人提示。我们用5529名学生的数据来评估我们的方法,这些学生使用Grok学习平台来教授Python编程。结果表明,仅使用10个学生的数据,我们就可以为90%以上的学生生成各种类型的提示,从而减少了冷启动问题。
{"title":"Automated Data-Driven Hints for Computer Programming Students","authors":"S. Chow, K. Yacef, I. Koprinska, J. Curran","doi":"10.1145/3099023.3099065","DOIUrl":"https://doi.org/10.1145/3099023.3099065","url":null,"abstract":"Formative feedback is essential for learning computer programming but is also a challenge to automate because of the many solutions a programming exercise can have. Whilst programming tutoring systems can easily generate automated feedback on how correct a program is, they less often provide some personalised guidance on how to improve or fix the code. In this paper, we present an approach for generating hints using previous student data. Utilising a range of techniques such as filtering, clustering and pattern mining, four different types of data-driven hints are generated: input suggestion, code-based, concept and pre-emptive hints. We evaluated our approach with data from 5529 students using the Grok Learning platform for teaching programming in Python. The results show that we can generate various types of hints for over 90% of students with data from only 10 students, and hence, reduce the cold-start problem.","PeriodicalId":219391,"journal":{"name":"Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization","volume":"50 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113981947","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 23
Graph Embedding Based Recommendation Techniques on the Knowledge Graph 基于知识图的图嵌入推荐技术
László Grad-Gyenge, A. Kiss, P. Filzmoser
This paper presents a novel, graph embedding based recommendation technique. The method operates on the knowledge graph, an information representation technique alloying content-based and collaborative information. To generate recommendations, a two dimensional embedding is developed for the knowledge graph. As the embedding maps the users and the items to the same vector space, the recommendations are then calculated on a spatial basis. Regarding to the number of cold start cases, precision, recall, normalized Cumulative Discounted Gain and computational resource need, the evaluation shows that the introduced technique delivers a higher performance compared to collaborative filtering on top-n recommendation lists. Our further finding is that graph embedding based methods show a more stable performance in the case of an increasing amount of user preference information compared to the benchmark method.
本文提出了一种新的基于图嵌入的推荐技术。该方法是基于知识图的,知识图是一种基于内容和协作的信息表示技术。为了生成推荐,对知识图进行了二维嵌入。当嵌入将用户和项目映射到相同的向量空间时,然后根据空间计算推荐。在冷启动案例的数量、准确率、召回率、标准化累积贴现增益和计算资源需求方面,评估表明,与top-n推荐列表上的协同过滤相比,引入的技术提供了更高的性能。我们进一步发现,与基准方法相比,基于图嵌入的方法在用户偏好信息数量增加的情况下表现出更稳定的性能。
{"title":"Graph Embedding Based Recommendation Techniques on the Knowledge Graph","authors":"László Grad-Gyenge, A. Kiss, P. Filzmoser","doi":"10.1145/3099023.3099096","DOIUrl":"https://doi.org/10.1145/3099023.3099096","url":null,"abstract":"This paper presents a novel, graph embedding based recommendation technique. The method operates on the knowledge graph, an information representation technique alloying content-based and collaborative information. To generate recommendations, a two dimensional embedding is developed for the knowledge graph. As the embedding maps the users and the items to the same vector space, the recommendations are then calculated on a spatial basis. Regarding to the number of cold start cases, precision, recall, normalized Cumulative Discounted Gain and computational resource need, the evaluation shows that the introduced technique delivers a higher performance compared to collaborative filtering on top-n recommendation lists. Our further finding is that graph embedding based methods show a more stable performance in the case of an increasing amount of user preference information compared to the benchmark method.","PeriodicalId":219391,"journal":{"name":"Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115722848","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 24
A Corpus for Modeling Personalities of Web Forum Users 网络论坛用户个性建模的语料库
William R. Wright
{"title":"A Corpus for Modeling Personalities of Web Forum Users","authors":"William R. Wright","doi":"10.1145/3099023.3099045","DOIUrl":"https://doi.org/10.1145/3099023.3099045","url":null,"abstract":"","PeriodicalId":219391,"journal":{"name":"Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114325505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Comparing Peer Recommendation Strategies in a MOOC MOOC中同伴推荐策略的比较
François Bouchet, Hugues Labarthe, K. Yacef, R. Bachelet
Lack of social relationship has been shown to be an important contribution factor for attrition in Massive Open Online Courses (MOOCs). Helping students to connect with other students is therefore a promising solution to alleviate this phenomenon. Following up on our previous research showing that embedding a peer recommender in a MOOC had a positive impact on students' engagement in the MOOC, we compare in this paper the impact of three different peer recommenders: one based on socio-demographic criteria, one based on current progress made in the MOOC, and the last one providing random recommendations. We report our results and analysis (N = 2025 students), suggesting that the socio-demographic-based recommender had a slightly better impact than the random one.
缺乏社会关系已被证明是大规模在线开放课程(MOOCs)流失的一个重要因素。因此,帮助学生与其他学生联系是缓解这一现象的一个有希望的解决方案。我们之前的研究表明,在MOOC中嵌入同行推荐人对学生参与MOOC产生了积极影响,在此基础上,我们在本文中比较了三种不同的同行推荐人的影响:一种基于社会人口统计学标准,一种基于MOOC当前的进展,最后一种提供随机推荐。我们报告了我们的结果和分析(N = 2025名学生),表明基于社会人口统计学的推荐人的影响略好于随机推荐人。
{"title":"Comparing Peer Recommendation Strategies in a MOOC","authors":"François Bouchet, Hugues Labarthe, K. Yacef, R. Bachelet","doi":"10.1145/3099023.3099036","DOIUrl":"https://doi.org/10.1145/3099023.3099036","url":null,"abstract":"Lack of social relationship has been shown to be an important contribution factor for attrition in Massive Open Online Courses (MOOCs). Helping students to connect with other students is therefore a promising solution to alleviate this phenomenon. Following up on our previous research showing that embedding a peer recommender in a MOOC had a positive impact on students' engagement in the MOOC, we compare in this paper the impact of three different peer recommenders: one based on socio-demographic criteria, one based on current progress made in the MOOC, and the last one providing random recommendations. We report our results and analysis (N = 2025 students), suggesting that the socio-demographic-based recommender had a slightly better impact than the random one.","PeriodicalId":219391,"journal":{"name":"Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116973871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
期刊
Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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