Wim Westera
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Wim Westera has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
- Konstantinos Georgiadis
Open University of the Netherlands
4 shared publications Enkhbold Nyamsuren
Open University of the Netherlands
2 shared publications- Kiavash Bahreini
Open University of The Netherlands, 10198 Heerlen Netherlands
2 shared publications - Marcus Specht
FernUniversität in Hagen
2 shared publications - Mihai Dascalu
Computer Science & Engineering Department, National University of Science and Technology POLITEHNICA Bucharest, 313 Splaiul Independentei, 060042 Bucharest, Romania
2 shared publications Rob Nadolski
Open University of the Netherlands
2 shared publications
Latest Publications
- Open Access
- 28 August 2022
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 28 (8) , 854-876
Assessing Repetitive Trials in Serious Games
Players in serious games may often need multiple trials for correctly completing a game task. Therefore, the number of attempts should be reflected in the score. This article presents three computational score models that take into account the number of attempts that a player makes to be successful. The models, which are extensions of test theory, quantify the random contributions to the scores that need to be removed. They also describe the influence of prior knowledge used for elimination of incorrect options, and take into account that the decision options in a node may not be equally plausible. In a series of simulation studies the score outcomes of the models are compared under various conditions. Results show that the number of trials cannot be ignored as they have a strong impact on the performance scores to be assigned. Neglecting the number of trials leads to inaccurate scores that significantly overrate the observed performances, occasionally up to 100% or even more. The effects depend on the number of decision options, the presence of obvious, correct or incorrect options given the player´s knowledge level and, to a lesser extent, different plausibility levels of the options to decide upon. The practical feasibility is high, because a simple score formula largely solves the problem.
- 28 August 2022
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 28 (8) , 854-876
Open AccessAssessing Repetitive Trials in Serious Games
Players in serious games may often need multiple trials for correctly completing a game task. Therefore, the number of attempts should be reflected in the score. This article presents three computational score models that take into account the number of attempts that a player makes to be successful. The models, which are extensions of test theory, quantify the random contributions to the scores that need to be removed. They also describe the influence of prior knowledge used for elimination of incorrect options, and take into account that the decision options in a node may not be equally plausible. In a series of simulation studies the score outcomes of the models are compared under various conditions. Results show that the number of trials cannot be ignored as they have a strong impact on the performance scores to be assigned. Neglecting the number of trials leads to inaccurate scores that significantly overrate the observed performances, occasionally up to 100% or even more. The effects depend on the number of decision options, the presence of obvious, correct or incorrect options given the player´s knowledge level and, to a lesser extent, different plausibility levels of the options to decide upon. The practical feasibility is high, because a simple score formula largely solves the problem.
- Open Access
- 1 March 2021
- Published by Serious Games Society in International Journal of Serious Games
- Vol. 8 (1) , 27-44
Comparing Bayesian Statistics and Frequentist Statistics in Serious Games Research
This article presents three empirical studies on the effectiveness of serious games for learning and motivation, while it compares the results arising from Frequentist (classical) Statistics with those from Bayesian Statistics. For a long time it has been technically impracticable to apply Bayesian Statistics and benefit from its conceptual superiority, but the emergence of automated sampling algorithms and user-friendly tools has radically simplified its usage. The three studies include two within-subjects designs and one between-subjects design. Unpaired t-tests, mixed factorial ANOVAs and multiple linear regression are used for the analyses. Overall, the games are found to have clear positive effects on learning and motivation, be it that the results from Bayesian Statistics are more strict and more informative, and possess several conceptual advantages. Accordingly, the paper calls for more emphasis on Bayesian Statistics in serious games research and beyond, as to reduce the present domination by the Frequentist Paradigm.
- 1 March 2021
- Published by Serious Games Society in International Journal of Serious Games
- Vol. 8 (1) , 27-44
Open AccessComparing Bayesian Statistics and Frequentist Statistics in Serious Games Research
This article presents three empirical studies on the effectiveness of serious games for learning and motivation, while it compares the results arising from Frequentist (classical) Statistics with those from Bayesian Statistics. For a long time it has been technically impracticable to apply Bayesian Statistics and benefit from its conceptual superiority, but the emergence of automated sampling algorithms and user-friendly tools has radically simplified its usage. The three studies include two within-subjects designs and one between-subjects design. Unpaired t-tests, mixed factorial ANOVAs and multiple linear regression are used for the analyses. Overall, the games are found to have clear positive effects on learning and motivation, be it that the results from Bayesian Statistics are more strict and more informative, and possess several conceptual advantages. Accordingly, the paper calls for more emphasis on Bayesian Statistics in serious games research and beyond, as to reduce the present domination by the Frequentist Paradigm.
- 27 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Games
- Vol. 13 (2) , 180-192
On the Robustness of Stealth Assessment
Stealth assessment is a methodology that utilizes machine learning for processing unobtrusively collected data from serious games to produce inferences regarding learners' mastery level. Although stealth assessment can produce valid and reliable assessments, its robustness over a wide a range of conditions has not been examined yet. The main reason is its complex, laborious, and time-consuming practical application. Therefore, its exposure to different conditions has been limited, as well as its wider uptake from the serious game community. Nevertheless, a framework for developing a generic tool has been proposed to lift its barriers. In this study, a generic SA software tool was developed based on this framework to examine the robustness of the stealth assessment methodology under various conditions. In specific, the conditions relate to (a) processing datasets of different distribution types and sizes (960 datasets containing a total of 72.336.000 data points are used for this reason), (b) utilizing two different machine learning algorithms (Gaussian Naive Bayes Network and C4.5), and (c) using statistical models relating to two different competency constructs. Results show that stealth assessment is a robust methodology, whilst the generic SA tool is a highly accurate tool capable of handling efficiently a wide range of conditions.
- 27 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Games
- Vol. 13 (2) , 180-192
On the Robustness of Stealth Assessment
Stealth assessment is a methodology that utilizes machine learning for processing unobtrusively collected data from serious games to produce inferences regarding learners' mastery level. Although stealth assessment can produce valid and reliable assessments, its robustness over a wide a range of conditions has not been examined yet. The main reason is its complex, laborious, and time-consuming practical application. Therefore, its exposure to different conditions has been limited, as well as its wider uptake from the serious game community. Nevertheless, a framework for developing a generic tool has been proposed to lift its barriers. In this study, a generic SA software tool was developed based on this framework to examine the robustness of the stealth assessment methodology under various conditions. In specific, the conditions relate to (a) processing datasets of different distribution types and sizes (960 datasets containing a total of 72.336.000 data points are used for this reason), (b) utilizing two different machine learning algorithms (Gaussian Naive Bayes Network and C4.5), and (c) using statistical models relating to two different competency constructs. Results show that stealth assessment is a robust methodology, whilst the generic SA tool is a highly accurate tool capable of handling efficiently a wide range of conditions.
- 1 November 2019
- Published by Springer Nature
- p. 512-521
Reinforcing Stealth Assessment in Serious Games
- 1 November 2019
- Published by Springer Nature
- p. 512-521
Reinforcing Stealth Assessment in Serious Games
- Open Access
- 30 July 2019
- Published by Springer Nature in Education and Information Technologies
- Vol. 25 (1) , 351-380
Artificial intelligence moving serious gaming: Presenting reusable game AI components
- 30 July 2019
- Published by Springer Nature in Education and Information Technologies
- Vol. 25 (1) , 351-380
Open AccessArtificial intelligence moving serious gaming: Presenting reusable game AI components
- Open Access
- 1 August 2018
- Published by Elsevier in Computers & Education
- Vol. 123, 212-224
Automated essay scoring in applied games: Reducing the teacher bandwidth problem in online training
- 1 August 2018
- Published by Elsevier in Computers & Education
- Vol. 123, 212-224
Open AccessAutomated essay scoring in applied games: Reducing the teacher bandwidth problem in online training
- Open Access
- 29 August 2017
- Published by Taylor & Francis in Interactive Learning Environments
- Vol. 26 (4) , 539-552
Simulating serious games: a discrete-time computational model based on cognitive flow theory
This paper presents a computational model for simulating how people learn from serious games. While avoiding the combinatorial explosion of a games micro-states, the model offers a meso-level pathfinding approach, which is guided by cognitive flow theory and various concepts from learning sciences. It extends a basic, existing model by exposing discrete-time evolution, allowing for failure, drop-out, and revisiting of activities, and accounting for efforts made and time spent on tasks, all of which are indispensable elements of gaming. Three extensive simulation studies are presented involving over 10,000 iterations across a wide range of game instances and player profiles for demonstrating model stability and empirical admissibility. The model can be used for investigating quantitative dependences between relevant game variables, gain deeper understanding of how people learn from games, and develop approaches to improving serious game design.
- 29 August 2017
- Published by Taylor & Francis in Interactive Learning Environments
- Vol. 26 (4) , 539-552
Open AccessSimulating serious games: a discrete-time computational model based on cognitive flow theory
This paper presents a computational model for simulating how people learn from serious games. While avoiding the combinatorial explosion of a games micro-states, the model offers a meso-level pathfinding approach, which is guided by cognitive flow theory and various concepts from learning sciences. It extends a basic, existing model by exposing discrete-time evolution, allowing for failure, drop-out, and revisiting of activities, and accounting for efforts made and time spent on tasks, all of which are indispensable elements of gaming. Three extensive simulation studies are presented involving over 10,000 iterations across a wide range of game instances and player profiles for demonstrating model stability and empirical admissibility. The model can be used for investigating quantitative dependences between relevant game variables, gain deeper understanding of how people learn from games, and develop approaches to improving serious game design.
- Open Access
- 23 June 2016
- Published by Springer Nature
- p. 32-41
What Serious Game Studios Want from ICT Research: Identifying Developers’ Needs
- 23 June 2016
- Published by Springer Nature
- p. 32-41
Open AccessWhat Serious Game Studios Want from ICT Research: Identifying Developers’ Needs
- Open Access
- 10 May 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 165-180
RAGE Reusable Game Software Components and Their Integration into Serious Game Engines
- 10 May 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 165-180
Open AccessRAGE Reusable Game Software Components and Their Integration into Serious Game Engines