Nikos Karousos
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Nikos Karousos has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- George Vorvilas
Hellenic Open University, Greece
8 shared publications - Vassilios S. Verykios
Hellenic Open University, Patras, Greece
5 shared publications - Despoina Pantazi
School of Science and Technology, Hellenic Open University, 18 Aristotelous St., 263 35 Patras, Greece
3 shared publications - Alexandros Liapis
School of Science and Technology, Hellenic Open University, Patras, Greece
2 shared publications - Dimitra Angelopoulou
Hellenic Open University
2 shared publications Achilles Kameas
1 shared publication
Latest Publications
- Open Access
- 25 April 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (5) , 250
Assigning Candidate Tutors to Modules: A Preference Adjustment Matching Algorithm (PAMA)
Matching problems arise in various settings where two or more entities need to be matched—such as job applicants to positions, students to colleges, organ donors to recipients, and advertisers to ads slots in web advertising platforms. This study introduces the preference adjustment matching algorithm (PAMA), a novel matching framework that pairs elements, which conceptually represent a bipartite graph structure, based on rankings and preferences. In particular, this algorithm is applied to tutor–module assignment in academic settings, and the methodology is built on four key assumptions where each module must receive its required number of candidates, candidates can only be assigned to a module once, eligible candidates based on ranking and module capacity must be assigned, and priority is given to mutual first-preference matches with institutional policies guiding alternative strategies when needed. PAMA operates in iterative rounds, dynamically adjusting modules and tutors’ preferences while addressing capacity and eligibility constraints. The distinctive innovative element of PAMA is that it combines concepts of maximal and stable matching, pending status and deadlock resolution into a single process for matching tutors to modules to meet the specific requirements of academic institutions and their constraints. This approach achieves balanced assignments by adhering to ranking order and considering preferences on both sides (tutors and institution). PAMA was applied to a real dataset provided by the Hellenic Open University (HOU), in which 3982 tutors competed for 1906 positions within 620 modules. Its performance was tested through various scenarios and proved capable of effectively handling both single-round and multi-round assignments. PAMA effectively handles complex cases, allowing policy-based resolution of deadlocks. While it may lose maximality in such instances, it converges to stability, offering a flexible solution for matching-related problems.
- 25 April 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (5) , 250
Open AccessAssigning Candidate Tutors to Modules: A Preference Adjustment Matching Algorithm (PAMA)
Matching problems arise in various settings where two or more entities need to be matched—such as job applicants to positions, students to colleges, organ donors to recipients, and advertisers to ads slots in web advertising platforms. This study introduces the preference adjustment matching algorithm (PAMA), a novel matching framework that pairs elements, which conceptually represent a bipartite graph structure, based on rankings and preferences. In particular, this algorithm is applied to tutor–module assignment in academic settings, and the methodology is built on four key assumptions where each module must receive its required number of candidates, candidates can only be assigned to a module once, eligible candidates based on ranking and module capacity must be assigned, and priority is given to mutual first-preference matches with institutional policies guiding alternative strategies when needed. PAMA operates in iterative rounds, dynamically adjusting modules and tutors’ preferences while addressing capacity and eligibility constraints. The distinctive innovative element of PAMA is that it combines concepts of maximal and stable matching, pending status and deadlock resolution into a single process for matching tutors to modules to meet the specific requirements of academic institutions and their constraints. This approach achieves balanced assignments by adhering to ranking order and considering preferences on both sides (tutors and institution). PAMA was applied to a real dataset provided by the Hellenic Open University (HOU), in which 3982 tutors competed for 1906 positions within 620 modules. Its performance was tested through various scenarios and proved capable of effectively handling both single-round and multi-round assignments. PAMA effectively handles complex cases, allowing policy-based resolution of deadlocks. While it may lose maximality in such instances, it converges to stability, offering a flexible solution for matching-related problems.
- Open Access
- 28 February 2025
- Published by MDPI AG in Preprints.org
Assigning Candidate Tutors to Modules: A Preference Adjustment Matching Algorithm (PAMA)
Matching problems arise in various settings where two or more entities need to be matched—such as job applicants to positions, students to colleges, organ donors to recipients, and advertisers to ad slots in web advertising platforms. Both offline and online bipartite matching algorithms have been developed for these problems, with online methods being particularly important for real-time applications like internet advertising. This study introduces the Preference Adjustment Matching Algorithm (PAMA), a novel matching framework that pairs elements, which conceptually represent a bipartite graph structure, based on rankings and preferences. In particular, this algorithm is applied to tutor-module assignment in academic settings. Tutor-module assignment is the process of assigning tutors to academic modules while balancing tutor preferences, module rankings, and institutional constraints. Based on the fundamental research theory of matching, PAMA combines both maximal and stability principles within fairness and efficiency criteria to achieve flexible and equitable assignments. PAMA operates in iterative rounds, dynamically adjusting modules and tutors’ preferences while addressing capacity and eligibility constraints. The algorithm operates under two distinct scenarios: in the first case it achieves maximal matching, while in the second one, even if it does not maintain maximality due to deadlock resolution, it guarantees its convergence to a stable solution. PAMA was applied to a real dataset provided by the Hellenic Open University (HOU), in which 3,982 tutors competed for 1,906 positions within 620 modules. Its performance was tested through various scenarios and proved capable of effectively handling both single-round and multi-round assignments. Although PAMA has a maximal matching behavior, this property might be lost in the presence of deadlock(s), but these are resolvable, allowing the algorithm to converge to a stable solution. It also adeptly resolved complex situations, offering flexibility for administrative decision-making that aligned with institutional policies, making PAMA a powerful solution for matching related problems.
- 28 February 2025
- Published by MDPI AG in Preprints.org
Open AccessAssigning Candidate Tutors to Modules: A Preference Adjustment Matching Algorithm (PAMA)
Matching problems arise in various settings where two or more entities need to be matched—such as job applicants to positions, students to colleges, organ donors to recipients, and advertisers to ad slots in web advertising platforms. Both offline and online bipartite matching algorithms have been developed for these problems, with online methods being particularly important for real-time applications like internet advertising. This study introduces the Preference Adjustment Matching Algorithm (PAMA), a novel matching framework that pairs elements, which conceptually represent a bipartite graph structure, based on rankings and preferences. In particular, this algorithm is applied to tutor-module assignment in academic settings. Tutor-module assignment is the process of assigning tutors to academic modules while balancing tutor preferences, module rankings, and institutional constraints. Based on the fundamental research theory of matching, PAMA combines both maximal and stability principles within fairness and efficiency criteria to achieve flexible and equitable assignments. PAMA operates in iterative rounds, dynamically adjusting modules and tutors’ preferences while addressing capacity and eligibility constraints. The algorithm operates under two distinct scenarios: in the first case it achieves maximal matching, while in the second one, even if it does not maintain maximality due to deadlock resolution, it guarantees its convergence to a stable solution. PAMA was applied to a real dataset provided by the Hellenic Open University (HOU), in which 3,982 tutors competed for 1,906 positions within 620 modules. Its performance was tested through various scenarios and proved capable of effectively handling both single-round and multi-round assignments. Although PAMA has a maximal matching behavior, this property might be lost in the presence of deadlock(s), but these are resolvable, allowing the algorithm to converge to a stable solution. It also adeptly resolved complex situations, offering flexibility for administrative decision-making that aligned with institutional policies, making PAMA a powerful solution for matching related problems.
- Open Access
- 13 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 51-56
Summarizing University Students? Qualitative Feedback on Online Exams: A Microservice-Oriented Approach
- 13 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 51-56
Open AccessSummarizing University Students? Qualitative Feedback on Online Exams: A Microservice-Oriented Approach
- 12 December 2024
- Published by SAGE Publications in Intelligent Decision Technologies
- Vol. 19 (2) , 781-803
Summarizing responses to open-ended questions in educational surveys: A microservice-oriented approach
Understanding the satisfaction of students’ academic experience is essential for enhancing the educational process and lowering attrition rates. In this context, universities conduct surveys via questionnaires, including both closed-ended and open-ended questions, to track and assess students’ feedback. While closed-ended questions seem useful for rapid quantitative analysis, open-ended ones usually obtain deeper insights and capture a wide spectrum of student experiences. This paper proposes an automated hybrid text summarization approach to handle the problem of assessing vast amounts of qualitative data from responses to open-ended questions. Data preparation, anonymization, normalization, sentence ranking, sentence clustering, extractive, and abstractive summarization, are the main tasks of the proposed approach, which is based on a Microservice-Oriented Architecture. Such an architecture ensures flexibility and scalability, enabling the easy integration of new components that may enhance the approach's overall functionality. Moreover, the applicability of the proposed approach is demonstrated through a dataset containing written responses in the modern Greek language from an online questionnaire completed by about 20.000 students attending study programs at the Hellenic Open University (HOU). The results show that automated text summarization proved to be efficient regarding the time required to produce reports, while also maintaining satisfactory quality.
- 12 December 2024
- Published by SAGE Publications in Intelligent Decision Technologies
- Vol. 19 (2) , 781-803
Summarizing responses to open-ended questions in educational surveys: A microservice-oriented approach
Understanding the satisfaction of students’ academic experience is essential for enhancing the educational process and lowering attrition rates. In this context, universities conduct surveys via questionnaires, including both closed-ended and open-ended questions, to track and assess students’ feedback. While closed-ended questions seem useful for rapid quantitative analysis, open-ended ones usually obtain deeper insights and capture a wide spectrum of student experiences. This paper proposes an automated hybrid text summarization approach to handle the problem of assessing vast amounts of qualitative data from responses to open-ended questions. Data preparation, anonymization, normalization, sentence ranking, sentence clustering, extractive, and abstractive summarization, are the main tasks of the proposed approach, which is based on a Microservice-Oriented Architecture. Such an architecture ensures flexibility and scalability, enabling the easy integration of new components that may enhance the approach's overall functionality. Moreover, the applicability of the proposed approach is demonstrated through a dataset containing written responses in the modern Greek language from an online questionnaire completed by about 20.000 students attending study programs at the Hellenic Open University (HOU). The results show that automated text summarization proved to be efficient regarding the time required to produce reports, while also maintaining satisfactory quality.
- Open Access
- 19 September 2024
- Published by MDPI AG in Electronics
- Vol. 13 (18) , 3722
A Hybrid Text Summarization Technique of Student Open-Ended Responses to Online Educational Surveys
This study introduces a hybrid text summarization technique designed to enhance the analysis of qualitative feedback from online educational surveys. The technique was implemented at the Hellenic Open University (HOU) to tackle the challenges of processing large volumes of student feedback. The TextRank and Walktrap algorithms along with GPT-4o mini were used to analyze student comments regarding positive experiences, study challenges, and suggestions for improvement. The results indicate that students are satisfied with tutor–student interactions but concerns were raised about educational content and scheduling issues. To evaluate the proposed summarization approach, the G-Eval and DeepEval summarization metrics were employed, assessing the relevance, coherence, consistency, fluency, alignment, and coverage of the summaries. This research addresses the increasing demand for effective qualitative data analysis in higher education and contributes to ongoing discussions on student feedback in distance learning environments. By effectively summarizing open-ended responses, universities can better understand student experiences and make informed decisions to improve the educational process.
- 19 September 2024
- Published by MDPI AG in Electronics
- Vol. 13 (18) , 3722
Open AccessA Hybrid Text Summarization Technique of Student Open-Ended Responses to Online Educational Surveys
This study introduces a hybrid text summarization technique designed to enhance the analysis of qualitative feedback from online educational surveys. The technique was implemented at the Hellenic Open University (HOU) to tackle the challenges of processing large volumes of student feedback. The TextRank and Walktrap algorithms along with GPT-4o mini were used to analyze student comments regarding positive experiences, study challenges, and suggestions for improvement. The results indicate that students are satisfied with tutor–student interactions but concerns were raised about educational content and scheduling issues. To evaluate the proposed summarization approach, the G-Eval and DeepEval summarization metrics were employed, assessing the relevance, coherence, consistency, fluency, alignment, and coverage of the summaries. This research addresses the increasing demand for effective qualitative data analysis in higher education and contributes to ongoing discussions on student feedback in distance learning environments. By effectively summarizing open-ended responses, universities can better understand student experiences and make informed decisions to improve the educational process.
- Open Access
- 7 August 2024
- Published by MDPI AG in Preprints.org
A Hybrid Text Summarization Technique of Student Open-Ended Responses to Online Educational Surveys
This study investigates the effectiveness of a text summarization method applied to open-ended student evaluations at the Hellenic Open University, aiming to improve the analysis of qualitative feedback from online educational surveys. To address the challenges of processing large volumes of student feedback, an automated summarization technique utilizing advancements in Natural Language Processing (NLP) and text mining is proposed. Using the TextRank and the Walktrap algorithms, student comments on positive aspects, study challenges, and improvement suggestions were analyzed. The analysis revealed that while some students expressed satisfaction with tutor-student interactions and the organization of educational material, there were also negative comments about outdated content in some modules and scheduling issues. The findings highlight the importance of qualitative feedback for education quality, providing actionable insights for improving curricula and teaching effectiveness. This research responds to the growing need for effective qualitative data analysis in higher education and contributes to ongoing discussions about student satisfaction in distance learning environments. By effectively summarizing open-ended responses, university staff can better understand student experiences and make informed decisions to enhance the educational process.
- 7 August 2024
- Published by MDPI AG in Preprints.org
Open AccessA Hybrid Text Summarization Technique of Student Open-Ended Responses to Online Educational Surveys
This study investigates the effectiveness of a text summarization method applied to open-ended student evaluations at the Hellenic Open University, aiming to improve the analysis of qualitative feedback from online educational surveys. To address the challenges of processing large volumes of student feedback, an automated summarization technique utilizing advancements in Natural Language Processing (NLP) and text mining is proposed. Using the TextRank and the Walktrap algorithms, student comments on positive aspects, study challenges, and improvement suggestions were analyzed. The analysis revealed that while some students expressed satisfaction with tutor-student interactions and the organization of educational material, there were also negative comments about outdated content in some modules and scheduling issues. The findings highlight the importance of qualitative feedback for education quality, providing actionable insights for improving curricula and teaching effectiveness. This research responds to the growing need for effective qualitative data analysis in higher education and contributes to ongoing discussions about student satisfaction in distance learning environments. By effectively summarizing open-ended responses, university staff can better understand student experiences and make informed decisions to enhance the educational process.
- 1 July 2024
- Published by IATED Academy in EDULEARN Proceedings
- Vol. 1, 350-357
ARE TUTOR EVALUATION SCORES CORRELATED TO STUDENT GRADES? AN EMPIRICAL RESEARCH IN DISTANCE ACADEMIC EDUCATION
- 1 July 2024
- Published by IATED Academy in EDULEARN Proceedings
- Vol. 1, 350-357
ARE TUTOR EVALUATION SCORES CORRELATED TO STUDENT GRADES? AN EMPIRICAL RESEARCH IN DISTANCE ACADEMIC EDUCATION
- Open Access
- 1 April 2023
- Published by Turkish Online Journal of Distance Education in Turkish Online Journal of Distance Education
- Vol. 24 (2) , 167-182
CONDUCTING REMOTE ELECTRONIC EXAMINATIONS IN DISTANCE HIGHER EDUCATION: STUDENTS’ PERCEPTIONS
The COVID-19 pandemic forced Higher Educational Institutes (HEIs) to adopt alternative approaches in delivering their learning activities including examinations. Regarding the latter, remote electronic examinations were selected as a one-way solution due to physical presence restriction measures imposed by governments around the world. This paper presents the evaluation of the remote examinations conducted by the Anonymized Open University [AOU]. The evaluation sought to inform decision making about the future of remote examinations at that distance learning organization. A sample of 9.276 students participated voluntarily and filled out a questionnaire. Both qualitative and quantitative analysis was employed. Results revealed that students were satisfied with the remote electronic examination process and they expressed their desire to be examined remotely again. Avoiding travelling and saving money were the main benefits mentioned by students. Issues were reported regarding the examination topics and the examination time. Students suggested the provision of more examination time and improvements in the university procedures and infrastructures that support remote examinations.
- 1 April 2023
- Published by Turkish Online Journal of Distance Education in Turkish Online Journal of Distance Education
- Vol. 24 (2) , 167-182
Open AccessCONDUCTING REMOTE ELECTRONIC EXAMINATIONS IN DISTANCE HIGHER EDUCATION: STUDENTS’ PERCEPTIONS
The COVID-19 pandemic forced Higher Educational Institutes (HEIs) to adopt alternative approaches in delivering their learning activities including examinations. Regarding the latter, remote electronic examinations were selected as a one-way solution due to physical presence restriction measures imposed by governments around the world. This paper presents the evaluation of the remote examinations conducted by the Anonymized Open University [AOU]. The evaluation sought to inform decision making about the future of remote examinations at that distance learning organization. A sample of 9.276 students participated voluntarily and filled out a questionnaire. Both qualitative and quantitative analysis was employed. Results revealed that students were satisfied with the remote electronic examination process and they expressed their desire to be examined remotely again. Avoiding travelling and saving money were the main benefits mentioned by students. Issues were reported regarding the examination topics and the examination time. Students suggested the provision of more examination time and improvements in the university procedures and infrastructures that support remote examinations.
- Open Access
- 30 August 2015
- Published by Springer Nature
- p. 255-262
Recognizing Emotions in Human Computer Interaction: Studying Stress Using Skin Conductance
- 30 August 2015
- Published by Springer Nature
- p. 255-262
Open AccessRecognizing Emotions in Human Computer Interaction: Studying Stress Using Skin Conductance