Uncovering Latent Knowledge: A Comparison of Two Algorithms

摘要

At the beginning of every course, it can be expected that several students have some syllabus knowledge. For efficiency in learning systems, and to combat student frustration and boredom, it is important to quickly uncover this latent knowledge. This enables students to begin new learning immediately. In this paper we compare two algorithms used to achieve this goal, both based on the theory of Knowledge Spaces. Simulated students were created with appropriate answering patterns based on predefined latent knowledge from a subsection of a real course. For each student, both algorithms were applied to compare their efficiency and their accuracy. We examine the trade-off between both sets of outcomes, and conclude with the merits and constraints of each algorithm.