On Ranking RDF Schema Elements (and its Application in Visualization)

dc.creatorTzitzikas,Yannis
dc.creatorKotzinos,Dimitris
dc.creatorTheoharis,Yannis
dc.date2007
dc.date.accessioned2024-02-06T12:55:59Z
dc.date.available2024-02-06T12:55:59Z
dc.descriptionRanking is a ubiquitous requirement whenever we confront a large collection 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 formal 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.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-013-12-1854
dc.identifierhttps://lib.jucs.org/article/28907/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/9546
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 13(12): 1854-1880
dc.subjectschema ranking
dc.subjectschema visualization
dc.subjectsemantic web
dc.titleOn Ranking RDF Schema Elements (and its Application in Visualization)
dc.typeResearch Article
Файлы