Please use this identifier to cite or link to this item:
http://hdl.handle.net/10609/92941
Title: | Improving peer grading reliability with graph mining techniques |
Author: | Caballé Llobet, Santi ![]() Capuano, Nicola Miguel Moneo, Jorge |
Others: | Università degli studi di Salerno Universitat Oberta de Catalunya (UOC) |
Keywords: | peer grading assessment MOOCs e-learning graph mining |
Issue Date: | 21-Jul-2016 |
Publisher: | International Journal of Emerging Technologies in Learning |
Citation: | Capuano, N., Caballé, S. & Miguel, J. (2016). Improving peer grading reliability with graph mining techniques. International Journal of Emerging Technologies in Learning, 11(7), 24-33. doi: 10.3991/ijet.v11i07.5878 |
Project identifier: | info:eu-repo/grantAgreement/TIN2013-45303-P |
Also see: | http://online-journals.org/index.php/i-jet/article/download/5878/4024 |
Abstract: | Peer grading is an approach increasingly adopted for assessing students in massive on-line courses, especially for complex assignments where automatic assessment is impossible and the ability of tutors to evaluate and provide feedback at scale is limited. Unfortunately, as students may have different expertise, peer grading often does not deliver accurate results compared to human tutors. In this paper, we describe and compare different methods, based on graph mining techniques, aimed at mitigating this issue by combining peer grades on the basis of the detected expertise of the assessor students. The possibility to improve these results through optimized techniques for assessors' assignment is also discussed. Experimental results with both synthetic and real data are presented and show better performance of our methods in comparison to other existing approaches. |
Language: | English |
URI: | http://hdl.handle.net/10609/92941 |
ISSN: | 1863-0383MIAR |
Appears in Collections: | Articles Articles |


Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
improvingpeer.pdf | 437.37 kB | Adobe PDF | View/Open |
[Comment]
[Mark]
This item is licensed under a Creative Commons License