文档介绍：IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 21, NO. 1, JANUARY 2009 123
A Relation-Based Page Rank Algorithm for
Semantic Web Search Engines
Fabrizio Lamberti, Member, IEEE, Andrea Sanna, and Claudio Demartini, Member, IEEE
Abstract—With the tremendous growth of information available to end users through the Web, search e to play ever a
more critical role. Nevertheless, because of their general-purpose approach, it is always less mon that obtained result sets
provide a burden of useless pages. The next-generation Web architecture, represented by the Semantic Web, provides the layered
architecture possibly allowing ing this limitation. Several search engines have been proposed, which allow increasing
information retrieval accuracy by exploiting a key content of Semantic Web resources, that is, relations. However, in order to rank
results, most of the existing solutions need to work on the whole annotated knowledge base. In this paper, we propose a relation-based
page rank algorithm to be used in conjunction with Semantic Web search engines that simply relies on information that could be
extracted from user queries and on annotated resources. Relevance is measured as the probability that a retrieved resource actually
contains those relations whose existence was assumed by the user at the time of query definition.
Index Terms—Semantic Web, knowledge retrieval, search process, query formulation.
Ç
1INTRODUCTION
N the last years, with the massive growth of the Web, we small town at some distance from the Rome city center is
Iassisted to an explosion of information accessible to also included. However, two hotels located in the historical
users. Nevertheless, at the same time, it has e center of other main Italian cities are also displayed. Finally,
ever more critical for end users to explore this huge three hotels named Roma are included among the 10 most
repository and find needed resources by simply following relevant r