On ranking RDF schema elements (and its application in visualization)

被引：0

作者：

Tzitzikas, Yannis ^{[1
,2
]}

Kotzinos, Dimitris ^{[1
,2
]}

Theoharis, Yannis ^{[1
,2
]}

机构：

[1] Univ Crete, Dept Comp Sci, Iraklion, Greece

[2] FORTH ICS, Inst Comp Sci, Iraklion, Greece

来源：

JOURNAL OF UNIVERSAL COMPUTER SCIENCE | 2007年 / 13卷 / 12期

关键词：

schema ranking; schema visualization; semantic web;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Ranking 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.

引用

页码：1854 / 1880

页数：27

共 28 条

[1]

Alani H., 2005, Proceedings of the 3rd international conference on Knowledge captureACM, DOI DOI 10.1145/1088622.1088633

[2]

[Anonymous], 2005, TRCS0506

[3]

[Anonymous], SEMRANK RANKING COMP, DOI DOI 10.1145/1060745.1060766

[4]

[Anonymous], 2004, ISWC DEMO SESSION

[5]

Arrow JK., 1951, SOCIAL CHOICE INDIVI

[6]

Baeza-Yates R.A., 1999, Modern Information Retrieval

[7]

Brickley D, 1999, RESOURCE DESCRIPTION

[8]

Condorcet M, 1785, Essai sur l'application de l'analyse a la probabilite des decisions

[9]

Cooper W. S., 1968, American Documentation, V19, P30, DOI 10.1002/asi.5090190108

[10]

de Borda J.-C.Chevalier., 1781, HIST DEACADEMIE ROYA, V102, P657

← 1 2 3 →