SWRank: An Approach for Ranking Semantic Web Reversely and Consistently

Authors:
Gang Wu;Juanzi Li
Affiliations:
-;-
Venue:
SKG '07 Proceedings of the Third International Conference on Semantics, Knowledge and Grid
Year:
2007

Citing 0
Cited 3

Semantic Web for Search

ISWC '09 Proceedings of the 8th International Semantic Web Conference
Discovering and ranking new links for linked data supplier

JIST'11 Proceedings of the 2011 joint international conference on The Semantic Web
A Link-Based Ranking Algorithm for Semantic Web Resources: A Class-Oriented Approach Independent of Link Direction

Journal of Database Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

The semantic web is a typical link-based graph con- sisting of resources (labeled nodes) and relations (labeled edges). Ranking facility is required in order to assist human and intelligent agent in finding appropriate resources from massive knowledge organized in the semantic web. The complexity lies in that relations are labeled and directed, and a huge number of fine-grained resources can describe either schema or instance data. We propose SWRank as a semantic web ranking approach which applies an object- level link analysis ranking algorithm reversely to the direc- tion of relations and consistently across the schema graph and the data graph. Our preliminary experiment shows that the approach has a similar converge property to and more reasonable ranking result than PageRank in evaluating the importance of individual resources in the semantic web.