The ultimate goals of adaptive serious educational games (adaptive SEG) are to promote effective learning and maximising enjoyment for players. Firstly, we develop the SEG by combining knowledge space (learning materials) and game content space to be used to convey learning materials. We propose a novel approach that serves toward minimising experts' involvement in mapping learning materials to game content space. We categorise both content spaces using known procedures and apply BIRCH clustering algorithm to categorise the similarity of the game content. Then, we map both content spaces based on the statistical properties and/or by the knowledge learning handout. Secondly, we construct a predictive model by learning data sets constructed through a survey on public testers who labelled their in-game data with their reported experiences. A Random Forest algorithm non-intrusively predicts experiences via the game data. Lastly, it is not feasible to manually select or adapt the content from both spaces because of the immense amount of options available. Therefore, we apply reinforcement learning technique to generate a series of learning goals that promote an efficient learning for the player. Subsequently, a combination of conditional branching and agglomerative hierarchical clustering select the most appropriate game content for each selected education material. For a proof-of-concept, we apply the proposed approach to producing the SEG, named Chem Dungeon, as a case study to demonstrate the effectiveness of our proposed methods.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:756907 |
| Date | January 2018 |
| Creators | Ar Rosyid, Harits |
| Contributors | Chen, Ke ; Shapiro, Jonathan |
| Publisher | University of Manchester |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | https://www.research.manchester.ac.uk/portal/en/theses/adaptive-serious-educational-games-using-machine-learning(b5f5024b-c7fd-4660-997c-9fd22e140a8f).html |
Page generated in 0.0021 seconds