Repository navigation
Selection Algorithms
The TutorShop Learning Management System, which was built to deploy CTAT tutors on the web, groups individual tutor instances, or "problems" (a problem is a pairing of a student interface and a model, either a behavior graph or a cognitive model), into problem sets at runtime. Each problem set has a selection algorithm that determines which of its problems will be shown to the student and in what sequence.
TutorShop has a number of built-in problem selection algorithms an author could choose from. Besides that it also allows authors to implement their own custom selection algorithms and link them to the system in one of several ways, as described below and further detailed in Interface to Custom Problem Selectors.
One factor that plays into the built-in problem selection algorithms is the number of times each problem has already been run, in case problem repeating is allowed. All built-in algorithms have a preference for selecting problems that have been run fewer times.
The built-in algorithms can be classified into 3 main groups: simple ordering algorithms, mastery algorithms, and custom algorithms.
These algorithms are based on the order of the problems in the problem set. They only choose among problems in the problem set that have not been attempted yet, or among problems that have been attempted the fewest times.
The algorithms are:
- Sequential Order: choose the first problem from the subset mentioned above.
- Random Order: choose a problem randomly from the subset mentioned above.
These algorithms aim to select the problem that could advance the student furthest toward mastery. Mastery is hard-coded to 0.95 probability. The algorithms compute a score for each problem, which is a weighted average of the missing skill probabilities. Where a missing skill probability is the difference between the mastery level (0.95) and the current skill p-known, and the weights are given by the number of opportunities for each skill. Problems exercising skills that have already been mastered are not considered.
The computed score is further adjusted by dividing it by the number of times the problem has already been attempted plus 1 (to avoid division by zero). This gives a preference to problems that have been attempted fewer times.
The algorithms are:
- Sequential Mastery Learning - Harder First: choose the first problem from the subset of problems with the highest score,
- Sequential Mastery Learning - Easier First: choose the first problem from the subset of problems with the lowest score.
- Random Mastery Learning - Harder First: choose a problem randomly from the subset of problems with the highest score.
- Random Mastery Learning - Easier First: choose a problem randomly from the subset of problems with the lowest score.
TutorShop also provides a way for authors to customize the problem selection algorithm, by replacing the standard ones with their own. This could be implemented either as a script running on the same server, or an internet service running on any other server. Tutorshop would send to this service the student model and some data about the problems to choose from in JSON format, and the service would return the next problem choice using whatever strategy it wants.
For details about the TutorShop interface to custom problem selectors see Interface to Custom Problem Selectors.
Getting Started
Using CTAT
HTML Components
- HTML Examples
- CTATAudioButton
- CTATButton
- CTATChatPanel
- CTATCheckBox
- CTATComboBox
- CTATDoneButton
- CTATDragNDrop
- CTATFractionBar
- CTATGroupingComponent
- CTATHintButton
- CTATHintWindow
- CTATImageButton
- CTATJumble
- CTATNumberLine
- CTATNumericStepper
- CTATPieChart
- CTATRadioButton
- CTATSkillWindow
- CTATSubmitButton
- CTATTable
- CTATTextArea
- CTATTextField
- CTATTextInput
- CTATVideo