No abstract

No abstract

Peer assessment is a method that has shown a positive impact on learners' cognitive and metacognitive skills. It also represents an effective alternative to instructor-provided assessment within computer-based education and, particularly, in massive online learning settings such as MOOCs. Various platforms have incorporated this mechanism as an assessment tool. However, most of the proposed implementations rely on the random matching of peers. The contributions introduced in this article are intended to step past the randomized approach by modeling learner matching as a many to many assignment problem, and then its resolution by using an appropriate combinatorial optimization algorithm. The adopted approach stands on a matching strategy that is also discussed in this article. Furthermore, we present two key steps on which both the matching strategy and the representation of the problem depend: 1) modeling the learner as an assessor, and 2) clustering assessors into categories that reflect learners’ assessment competency. Additionally, a methodology for increasing the accuracy of peer assessment by weighting the scores given by learners is also introduced. Finally, compared to the random allocation of submissions, the experimentation of the approach has shown promising results in terms of the validity of assessments and the acceptance of peer feedback.

The contribution in the context of this paper relates to the stage of allocating submissions to the assessors within the peer assessment process in MOOCs. We propose an algorithm for the distribution of assignments that involves the learner characteristics related to the evaluation in the methodology of allocating assignments. The inputs of this algorithm are the assessment profiles of learners which include their basic characteristics linked to the evaluation process. The creation of these profiles stands on the use of an assessor model inspired from the literature on learners modeling, a model that we are also discussing in this paper.

No abstract

No abstract