Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
We present rminer, our open source library for the R tool that facilitates the use of data mining (DM) algorithms, such as neural Networks (NNs) and support vector machines (SVMs),...
Determining the size of an ontology that is automatically learned from texts is an open issue. In this paper, we study the similarity between ontology concepts at different levels ...
Elias Zavitsanos, Sergios Petridis, Georgios Palio...
—This paper introduces new metrics for course evaluation. It is also proposes a ranking algorithm that classifies courses based on the previous course evaluation metrics and sugg...
Stavros Valsamidis, Ioannis Kazanidis, Sotirios Ko...
Most eye trackers work well for open eyes. However, blinking is a physiological necessity for humans. Moreover, for applicationssuch as facial expression analysis and driver aware...