ReConRank: A Scalable Ranking Method for Semantic Web Data with Context?

Abstract

We present an approach that adapts the well-known PageRank/HITS algorithms to Semantic Web data. Our method combines ranks from the RDF graph with ranks from the context graph, i.e. data sources and their linkage. We present performance evaluation results based on a large RDF data set obtained from the Web.

8 Figures and Tables

Statistics

051015'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

90 Citations

Semantic Scholar estimates that this publication has 90 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Hogan2006ReConRankAS, title={ReConRank: A Scalable Ranking Method for Semantic Web Data with Context?}, author={Aidan Hogan and Andreas Harth and Stefan Decker}, year={2006} }