Customized Pedagogical Recommendation Using Automated Planning for Sequencing Based on Bloom's Taxonomy

Customized Pedagogical Recommendation Using Automated Planning for Sequencing Based on Bloom's Taxonomy

Newarney Torrezão Costa, Denis José de Almeida, Gustavo Prado Oliveira, Márcia Aparecida Fernandes
Copyright: © 2022 |Pages: 19
DOI: 10.4018/ijdet.296700
Article PDF Download
Open access articles are freely available for download

Abstract

Personalized sequencing and recommendation of pedagogical actions in virtual learning environments are relevant aspects in promoting an effective learning process with computer-aided support. Hence, this work investigates the use of automated planning to sequence these actions according to student profiles. Actions are modeled to correspond to the cognitive process described by Bloom’s Taxonomy, and the student profile is set using the Revised Approaches to Studying Inventory. Both models share theoretical foundations linked to the cognitive process, and the mapping of these two theories is one of the contributions merged into this study. In planning, through use of a genetic algorithm and the problem formulation as an optimization problem, one can correctly manage the search for good solutions, as demonstrated in this work. Through use of Digital Bloom’s Taxonomy, one arrives at a recommend set of actions. Experiments were performed using 41 students. The results were promising and demonstrate the viability of the proposal.
Article Preview
Top

2. Automated Planning And Action Sequencing

A systematic literature review described in da Costa et al. (2019) presented the AP application advances, limitations, and challenges in the pedagogical process and pointed to AP as an essential tool for interfacing the e-learning requirements and delivering personalized content. However, suppose there are many actions or parameters in the student profile, the state space of action sequences increases. In that case, the classical AP with Planning Domain Definition Language (PDDL) is impracticable when it comes to the search for a solution. Dwivedi et al. (2018) describe that in this case, GA is more suitable for dealing with this PA issue since it can minimize the computational effort.

Complete Article List

Search this Journal:
Reset
Volume 22: 1 Issue (2024)
Volume 21: 2 Issues (2023)
Volume 20: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 19: 4 Issues (2021)
Volume 18: 4 Issues (2020)
Volume 17: 4 Issues (2019)
Volume 16: 4 Issues (2018)
Volume 15: 4 Issues (2017)
Volume 14: 4 Issues (2016)
Volume 13: 4 Issues (2015)
Volume 12: 4 Issues (2014)
Volume 11: 4 Issues (2013)
Volume 10: 4 Issues (2012)
Volume 9: 4 Issues (2011)
Volume 8: 4 Issues (2010)
Volume 7: 4 Issues (2009)
Volume 6: 4 Issues (2008)
Volume 5: 4 Issues (2007)
Volume 4: 4 Issues (2006)
Volume 3: 4 Issues (2005)
Volume 2: 4 Issues (2004)
Volume 1: 4 Issues (2003)
View Complete Journal Contents Listing