Efficient Lecturer Peer-Assessment Attribution Using Graph Theory and a Novel Greedy Algorithm
This paper introduces an efficient algorithm to address the issue of lecturer peer-assessment assignment. The motivation for this solution arises from a real-world scenario where a group of lecturers receives teaching feedback through the process of peer assessment. In this context, in the case of a...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10414044/ |
| _version_ | 1797335538058919936 |
|---|---|
| author | Henrique Mohallem Paiva Priscila Falcao dos Santos Marcos R. O. A. Maximo Lucas Niemeyer |
| author_facet | Henrique Mohallem Paiva Priscila Falcao dos Santos Marcos R. O. A. Maximo Lucas Niemeyer |
| author_sort | Henrique Mohallem Paiva |
| collection | DOAJ |
| description | This paper introduces an efficient algorithm to address the issue of lecturer peer-assessment assignment. The motivation for this solution arises from a real-world scenario where a group of lecturers receives teaching feedback through the process of peer assessment. In this context, in the case of a large group, manually keeping track of desires and constraints is hard, and therefore a computational solution is paramount. The proposed technique looks for a solution where every teacher is evaluated by a target number of peers. Moreover, affinity between peers may be encoded in the algorithm to give preference to solutions where the assignments have higher affinity. The problem is framed using a directed weighted graph, where the weights are the affinity between peers, and the proposed greedy algorithm regularizes this graph to achieve the attribution. Results are presented where the proposed approach is applied to both real and simulated data, resulting in adequate attributions within an efficient time frame. |
| first_indexed | 2024-03-08T08:39:51Z |
| format | Article |
| id | doaj.art-ea2c6648e20046b498e0e1e53b599bcf |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-03-08T08:39:51Z |
| publishDate | 2024-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-ea2c6648e20046b498e0e1e53b599bcf2024-02-02T00:02:45ZengIEEEIEEE Access2169-35362024-01-0112147421475010.1109/ACCESS.2024.335861310414044Efficient Lecturer Peer-Assessment Attribution Using Graph Theory and a Novel Greedy AlgorithmHenrique Mohallem Paiva0https://orcid.org/0000-0001-7081-8383Priscila Falcao dos Santos1Marcos R. O. A. Maximo2https://orcid.org/0000-0003-2944-4476Lucas Niemeyer3Institute of Technology and Leadership—INTELI, São Paulo, SP, BrazilInstitute of Technology and Leadership—INTELI, São Paulo, SP, BrazilAeronautics Institute of Technology—ITA, São José dos Campos, São Paulo, BrazilInstitute of Technology and Leadership—INTELI, São Paulo, SP, BrazilThis paper introduces an efficient algorithm to address the issue of lecturer peer-assessment assignment. The motivation for this solution arises from a real-world scenario where a group of lecturers receives teaching feedback through the process of peer assessment. In this context, in the case of a large group, manually keeping track of desires and constraints is hard, and therefore a computational solution is paramount. The proposed technique looks for a solution where every teacher is evaluated by a target number of peers. Moreover, affinity between peers may be encoded in the algorithm to give preference to solutions where the assignments have higher affinity. The problem is framed using a directed weighted graph, where the weights are the affinity between peers, and the proposed greedy algorithm regularizes this graph to achieve the attribution. Results are presented where the proposed approach is applied to both real and simulated data, resulting in adequate attributions within an efficient time frame.https://ieeexplore.ieee.org/document/10414044/Peer assessmentteaching feedbacktechnology in educationallocation algorithmgraphs |
| spellingShingle | Henrique Mohallem Paiva Priscila Falcao dos Santos Marcos R. O. A. Maximo Lucas Niemeyer Efficient Lecturer Peer-Assessment Attribution Using Graph Theory and a Novel Greedy Algorithm IEEE Access Peer assessment teaching feedback technology in education allocation algorithm graphs |
| title | Efficient Lecturer Peer-Assessment Attribution Using Graph Theory and a Novel Greedy Algorithm |
| title_full | Efficient Lecturer Peer-Assessment Attribution Using Graph Theory and a Novel Greedy Algorithm |
| title_fullStr | Efficient Lecturer Peer-Assessment Attribution Using Graph Theory and a Novel Greedy Algorithm |
| title_full_unstemmed | Efficient Lecturer Peer-Assessment Attribution Using Graph Theory and a Novel Greedy Algorithm |
| title_short | Efficient Lecturer Peer-Assessment Attribution Using Graph Theory and a Novel Greedy Algorithm |
| title_sort | efficient lecturer peer assessment attribution using graph theory and a novel greedy algorithm |
| topic | Peer assessment teaching feedback technology in education allocation algorithm graphs |
| url | https://ieeexplore.ieee.org/document/10414044/ |
| work_keys_str_mv | AT henriquemohallempaiva efficientlecturerpeerassessmentattributionusinggraphtheoryandanovelgreedyalgorithm AT priscilafalcaodossantos efficientlecturerpeerassessmentattributionusinggraphtheoryandanovelgreedyalgorithm AT marcosroamaximo efficientlecturerpeerassessmentattributionusinggraphtheoryandanovelgreedyalgorithm AT lucasniemeyer efficientlecturerpeerassessmentattributionusinggraphtheoryandanovelgreedyalgorithm |