Despoina Pantazi

Prof. Despoina Pantazi

Auto-generated profile, based on publicly available information

Prof. Despoina Pantazi


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 September 2024 in Electronics
Verified
Journal Article
Open access
PDF file
NKNikos Karousos
Nikos Karousos
GVGeorge Vorvilas
George Vorvilas
DPDespoina Pantazi
Despoina Pantazi
VVVassilios S. Verykios
Vassilios S. Verykios
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.

25 April 2025 in Algorithms
Verified
Journal Article
Open access
PDF file
NKNikos Karousos
Nikos Karousos
DPDespoina Pantazi
Despoina Pantazi
GVGeorge Vorvilas
George Vorvilas
VVVassilios S. Verykios
Vassilios S. Verykios
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.

28 February 2025 in Preprints.org
Verified
Preprint
Open access
PDF file
NKNikos Karousos
Nikos Karousos
DPDespoina Pantazi
Despoina Pantazi
GVGeorge Vorvilas
George Vorvilas
VVVassilios S. Verykios
Vassilios S. Verykios
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.