Sotiris Kotsiantis

Prof. Sotiris Kotsiantis

University of Patras
orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
25 December 2020 in Entropy
Verified
Journal Article
Open access
PDF file
PLPantelis Linardatos
Pantelis Linardatos
Vasilis PapastefanopoulosVasilis Papastefanopoulos
Vasilis Papastefanopoulos
Sotiris KotsiantisSotiris Kotsiantis
Sotiris Kotsiantis
Recent advances in artificial intelligence (AI) have led to its widespread industrial adoption, with machine learning systems demonstrating superhuman performance in a significant number of tasks. However, this surge in performance, has often been achieved through increased model complexity, turning such systems into “black box” approaches and causing uncertainty regarding the way they operate and, ultimately, the way that they come to decisions. This ambiguity has made it problematic for machine learning systems to be adopted in sensitive yet critical domains, where their value could be immense, such as healthcare. As a result, scientific interest in the field of Explainable Artificial Intelligence (XAI), a field that is concerned with the development of new methods that explain and interpret machine learning models, has been tremendously reignited over recent years. This study focuses on machine learning interpretability methods; more specifically, a literature review and taxonomy of these methods are presented, as well as links to their programming implementations, in the hope that this survey would serve as a reference point for both theorists and practitioners.

29 June 2011 in Artificial Intelligence Review
Verified
Journal Article
Closed access
PDF file
Sotiris KotsiantisSotiris Kotsiantis
Sotiris Kotsiantis

10 November 2006 in Artificial Intelligence Review
Verified
Journal Article
Closed access
PDF file
Sotiris KotsiantisSotiris Kotsiantis
Sotiris Kotsiantis
IZI. D. Zaharakis
I. D. Zaharakis
PPP. E. Pintelas
P. E. Pintelas

3 September 2024 in Future Internet
Verified
Journal Article
Open access
PDF file
Aristidis VrahatisAristidis Vrahatis
Aristidis Vrahatis
KLKonstantinos Panagiotis Lazaros
Konstantinos Panagiotis Lazaros
Sotiris KotsiantisSotiris Kotsiantis
Sotiris Kotsiantis
Real-world problems often exhibit complex relationships and dependencies, which can be effectively captured by graph learning systems. Graph attention networks (GATs) have emerged as a powerful and versatile framework in this direction, inspiring numerous extensions and applications in several areas. In this review, we present a thorough examination of GATs, covering both diverse approaches and a wide range of applications. We examine the principal GAT-based categories, including Global Attention Networks, Multi-Layer Architectures, graph-embedding techniques, Spatial Approaches, and Variational Models. Furthermore, we delve into the diverse applications of GATs in various systems such as recommendation systems, image analysis, medical domain, sentiment analysis, and anomaly detection. This review seeks to act as a navigational reference for researchers and practitioners aiming to emphasize the capabilities and prospects of GATs.

1 May 2004 in Applied Artificial Intelligence
Verified
Journal Article
Closed access
Sotiris KotsiantisSotiris Kotsiantis
Sotiris Kotsiantis
CPC. Pierrakeas
C. Pierrakeas
PPP. Pintelas
P. Pintelas
The ability to predict a student's performance could be useful in a great number of different ways associated with university-level distance learning. Students' key demographic characteristics and their marks on a few written assignments can constitute the training set for a supervised machine learning algorithm. The learning algorithm could then be able to predict the performance of new students, thus becoming a useful tool for identifying predicted poor performers. The scope of this work is to compare some of the state of the art learning algorithms. Two experiments have been conducted with six algorithms, which were trained using data sets provided by the Hellenic Open University. Among other significant conclusions, it was found that the Naïve Bayes algorithm is the most appropriate to be used for the construction of a software support tool, has more than satisfactory accuracy, its overall sensitivity is extremely satisfactory, and is the easiest algorithm to implement.