Show simple item record

dc.contributor.authorToupikov, Nickolaien
dc.contributor.authorUmbrich, Jürgenen
dc.contributor.authorDelbru, Renauden
dc.contributor.authorHausenblas, Michaelen
dc.contributor.authorTummarello, Giovannien
dc.identifier.citationNickolai Toupikov, Jürgen Umbrich , Renaud Delbru, Michael Hausenblas, Giovanni Tummarello "DING! Dataset Ranking using Formal Descriptions", Linked Data on the Web Workshop (LDOW 09), in conjunction with 18th International World Wide Web Conference (WWW 09), 2009.en
dc.description.abstractConsidering that thousands if not millions of linked datasets will be published soon, we motivate in this paper the need for an efficient and effective way to rank interlinked datasets based on formal descriptions of their characteristics. We propose DING (from Dataset RankING) as a new approach to rank linked datasets using information provided by the voiD vocabulary. DING is a domain-independent link anal- ysis that measures the popularity of datasets by considering the cardinality and types of the relationships. We propose also a methodology to automatically assign weights to link types. We evaluate the proposed ranking algorithm against other well known ones, such as PageRank or HITS, using synthetic voiD descriptions. Early results show that DING performs better than the standardWeb ranking algorithms.en
dc.subject.lcshWorld Wide Weben
dc.titleDING! Dataset Ranking using Formal Descriptionsen
dc.typeWorkshop paperen
dc.contributor.funderScience Foundation Irelanden

Files in this item

Attribution-NonCommercial-NoDerivs 3.0 Ireland
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. Please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record