• English
    • français
    • Deutsch
    • español
    • português (Brasil)
    • Bahasa Indonesia
    • русский
    • العربية
    • 中文
  • 中文 
    • English
    • français
    • Deutsch
    • español
    • português (Brasil)
    • Bahasa Indonesia
    • русский
    • العربية
    • 中文
  • 登入
查看項目 
  •   首頁
  • OAI Data Pool
  • OAI Harvested Content
  • 查看項目
  •   首頁
  • OAI Data Pool
  • OAI Harvested Content
  • 查看項目
JavaScript is disabled for your browser. Some features of this site may not work without it.

瀏覽

所有文獻群體出版日期標題主題作者此合集出版日期標題主題作者個人檔案檢視

我的帳號

登入

The Library

AboutNew SubmissionSubmission GuideSearch GuideRepository PolicyContact

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors

Adaptive Task Assignment in Online Learning Environments

  • CSV
  • RefMan
  • EndNote
  • BibTex
  • RefWorks
Author(s)
Andersen, Per-Arne
Kråkevik, Christian
Goodwin, Morten
Yazidi, Anis
Keywords
Computer Science - Artificial Intelligence

所有記錄
顯示完整的項目記錄
URI
http://hdl.handle.net/20.500.12424/794430
Online Access
http://arxiv.org/abs/1606.07233
Abstract
With the increasing popularity of online learning, intelligent tutoring systems are regaining increased attention. In this paper, we introduce adaptive algorithms for personalized assignment of learning tasks to student so that to improve his performance in online learning environments. As main contribution of this paper, we propose a a novel Skill-Based Task Selector (SBTS) algorithm which is able to approximate a student's skill level based on his performance and consequently suggest adequate assignments. The SBTS is inspired by the class of multi-armed bandit algorithms. However, in contrast to standard multi-armed bandit approaches, the SBTS aims at acquiring two criteria related to student learning, namely: which topics should the student work on, and what level of difficulty should the task be. The SBTS centers on innovative reward and punishment schemes in a task and skill matrix based on the student behaviour. To verify the algorithm, the complex student behaviour is modelled using a neighbour node selection approach based on empirical estimations of a students learning curve. The algorithm is evaluated with a practical scenario from a basic java programming course. The SBTS is able to quickly and accurately adapt to the composite student competency --- even with a multitude of student models.
Comment: 6th International Conference on Web Intelligence
Date
2016-06-23
Type
text
Identifier
oai:arXiv.org:1606.07233
http://arxiv.org/abs/1606.07233
合集
OAI Harvested Content

entitlement

 
DSpace software (copyright © 2002 - 2023)  DuraSpace
快速指南 | 聯絡我們
Open Repository is a service operated by 
Atmire NV
 

導出搜尋結果

導出選項允許您將輸入的查詢所產生的搜尋結果導出到一個檔案中。有不同的格式可以選擇下載。要導出項目,請點擊與最佳下載格式相對應的按鈕。

預設情況下,點擊導出按鈕會導致進行系統允許下,下載最大數量的項目。

要選擇搜索結果的子集,請點擊「選擇性導出」按鈕,然後選擇要導出的項目。每次可以導出的項目數量與完全導出受到同樣的限制。

"

作出選擇後,點擊其中一個導出格式按鈕。導出格式旁邊的氣泡中會顯示即將導出的項目數量。

"