• 沒有找到結果。

Interactive Unknowns Recommendation in E-Learning Systems

N/A
N/A
Protected

Academic year: 2021

Share "Interactive Unknowns Recommendation in E-Learning Systems"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

Interactive Unknowns Recommendation in E-Learning Systems

Abstract—The arise of E-learning systems has led to an anytime-anywhere-learning environment for everyone by pro- viding various online courses and tests. However, due to the lack of teacher-student interaction, such ubiquitous learning is generally not as effective as offline classes. In traditional offline courses, teachers facilitate real-time interaction to teach students in accordance with personal aptitude from students’

feedback in classes. Without the interruption of instructors, it is difficult for users to be aware of personal unknowns. In this paper, we address an important issue on the exploration of user unknowns from interactive question-answering process in E-learning systems. A novel interactive learning system, called CagMab, is devised to interactively recommend questions with a round-by-round strategy, which contributes to applications such as a conversational bot for self-evaluation. The flow enables users to discover their weakness and further helps them to progress.

In fact, despite its importance, discovering personal unknowns remains a challenging problem in E-learning systems. Even though formulating the problem with the multi-armed bandit framework provides a solution, it often leads to suboptimal results for interactive unknowns recommendation as it simply relies on the contextual features of answered questions. Note that each question is associated with concepts and similar concepts are likely to be linked manually or systematically, which naturally forms the concept graphs. Mining the rich relationships among users, questions and concepts could be potentially helpful in providing better unknowns recommendation. To this end, in this paper, we develop a novel interactive learning framework by borrowing strengths from concept-aware graph embedding for learning user unknowns. Our experimental studies on real data show that the proposed framework can effectively discover user unknowns in an interactive fashion for recommendation in E- learning systems.

參考文獻

相關文件

• Adding restrictions on the allowable solutions (the solution space) may make a problem harder, equally hard, or easier.. • It is

• Adding restrictions on the allowable solutions (the solution space) may make a problem harder, equally hard, or easier.. • It is

Using the solution U of Riemann problem to obtain an e approximate solution for the solution U of balance laws..

The aim of the competition is to offer students a platform to express creatively through writing poetry in English. It also provides schools with a channel to

• following up the recommendation of offering vocational English as a new Applied Learning (ApL) course, as proposed by the Task Force on Review of School Curriculum with a view

Bingham & Sitter (2001) used the usual minimum-aberration criterion for unblocked designs to compare split-plot designs, but since it often leads to more than one

Though there’s a growing trend of employing famous Hollywood actors to voice characters in order to provide movies with star power, there are still many unknowns but

= special contextual bandit + verified instances as rewards.. Good Properties of Greedy. Case 1: positive