Author/Authors :
Tzitzikas, Yannis University of Crete - Computer Science Department, Greece , Tzitzikas, Yannis Institute of Computer Science, FORTH-ICS, Greece , Kotzinos, Dimitris University of Crete - Computer Science Department, Greece , Kotzinos, Dimitris Institute of Computer Science, FORTH-ICS, Greece , Theoharis, Yannis University of Crete - Computer Science Department, Greece , Theoharis, Yannis Institute of Computer Science, FORTH-ICS, Greece
Abstract :
Ranking is a ubiquitous requirement whenever we confront a large collec- tion of atomic or interrelated artifacts. This paper elaborates on this issue for the case of RDF schemas. Specifically, several metrics for evaluating automatic methods for ranking schema elements are proposed and discussed. Subsequently the creation of a test collection for evaluating such methods is described, upon which several ranking methods (from simple to more sophisticated) for RDF schemas are evaluated. This for- mal way for evaluating ranking methods, apart from yielding credible and repeatable results, gave us some interesting insights to the problem. Finally, our experiences from exploiting these ranking methods for visualizing RDF schemas, specifically for deriving and visualizing top-k schema subgraphs, are reported.
