A method to rank nodes in an RDF graph

From Tetherless World Wiki

Jump to: navigation, search

TW-2008-15 Edit TWTR

Citation: Alvaro Graves,Sibel Adali,James A. Hendler. (2008) A method to rank nodes in an RDF graph. In ISWC 2008 Poster and Demo Track, October,2008.

Publication inproceedings ( Edit )
type Poster Paper
bibtype inproceedings
Bibtex basics
author Alvaro Graves;Sibel Adali;James Hendler
title A method to rank nodes in an RDF graph
booktitle ISWC 2008 Poster and Demo Track
year 2008
month October
Bibtex more
Access Paper
abstract Despite the increasing popularity of RDF as a data representation method, there is no accepted measure of the importance of nodes in an RDF graph. Such a measure could be used to

sort the nodes returned by a SPARQL query or to find the important concepts in an RDF graph. In this paper we propose a graph-theoretic measure called noc-order for ranking nodes in RDF graphs based on the notion of centrality. We illustrate that this method is able to capture interesting global properties of the underlying RDF graph using study cases from different knowledge domains. We also show how well noc-order behaves even if the underlying data has some noise, i.e. superfluous and/or erroneous data. Finally, we discuss how information about the importance of different predicates either based on their informativeness, prior semantic information about them or user preferences can be incorporated into this measure. We show the effects of such modifications to the ranking method by examples.

Facts about A method to rank nodes in an RDF graphRDF feed
Abstract Despite the increasing popularity of RDF a … Despite the increasing popularity of RDF as a data representation method, there is no accepted measure of the importance of nodes in an RDF graph. Such a measure could be used to

sort the nodes returned by a SPARQL query or to find the important concepts in an RDF graph. In this paper we propose a graph-theoretic measure called noc-order for ranking nodes in RDF graphs based on the notion of centrality. We illustrate that this method is able to capture interesting global properties of the underlying RDF graph using study cases from different knowledge domains. We also show how well noc-order behaves even if the underlying data has some noise, i.e. superfluous and/or erroneous data. Finally, we discuss how information about the importance of different predicates either based on their informativeness, prior semantic information about them or user preferences can be incorporated into this measure. We show the effects of such modifications to the ranking method by examples. cations to the ranking method by

examples.
Author Alvaro Graves  +, Sibel Adali  +, and James Hendler  +
Bibtype inproceedings  +
Booktitle ISWC 2008 Poster and Demo Track  +
Has author Alvaro Graves  +, Sibel Adali  +, and James Hendler  +
Has identifier TW-2008-15  +
Has publishing details October,2008  +
Has title A method to rank nodes in an RDF graph  +
Has tr id TW-2008-15  +
Has where published ISWC 2008 Poster and Demo Track  +
Has year 2008  +
Month October  +
Title A method to rank nodes in an RDF graph  +
Year 2008  +
Retrieved from "http://tw.rpi.edu/wiki/A_method_to_rank_nodes_in_an_RDF_graph"
Personal tools